isaiah-perumalla

#include <pthread.h>
#include <stdio.h>
 
int x, y = 0;
int r0, r1;
 
void *core0 (void *arg)
{
  x = 1;
  asm volatile ("" ::: "memory"); // ensure GCC compiler will not reorder 

isaiah-perumalla

def solution(N, A, B, C):
    edges = [(C[i],A[i],B[i]) for i in xrange(len(A))]
    edges.sort(key=lambda e: e[0])
    maxLenAt = [0]*N
    costAt = [0]*N
   
    def updatePath(u,costu,lenu, v,costv, lenv, cost):
        if costu < cost and lenu+1 > lenv:
            maxLenAt[v] = lenu+1 
            costAt[v] = cost

isaiah-perumalla

def water_collected(A):
    sortedHeights = [(x,i) for i,x in enumerate(A)]
    sortedHeights.sort(key=lambda v: v[0]*-1) #sort in decreasing order
    
    leftIdx = rightIdx = sortedHeights[0][1]
    waterLevel = 0
    for i in xrange(1,len(A)):
        x,idx = sortedHeights[i]
        if idx > rightIdx:
            water = (idx-rightIdx-1)*x

isaiah-perumalla

 #include<iostream>
 #include<vector>
 #include<algorithm>
 using namespace std;
 struct Elephant { 
   int iq,  weight, index;
   static bool iq_greater(const Elephant& e1, const Elephant& e2) {
     return e1.iq >= e2.iq;
   }
};

isaiah-perumalla

#Problem

The essence of the problem is given a collection of n items of varying size, let T_sum be the sum of all item sizes. we need to able to answer the question, does a subset of items exist such that the sum of the items in the sumset is equal to K. where K is some integer that satisfies the constraints K <= T_max and (total-K) <= T_max . Where T_max is the maximum time allowed.

#Solution

Brute force approach would be iterate through all the subsets of the items.

Let S₁, S₂ ... S_2ⁿ all subsets, we iterate through each subset to see if there exist a subset S_k such that the sum of S_k = K. This approach is guarenteed to be correct, however it is impossibly slow because we have to iterate 2ⁿ subsets. since the number of items in the collection can reach 100, in the worst case we would have to examine 2¹⁰⁰ subsets this is clearly intractable.