Submission #314268

#TimeUsernameProblemLanguageResultExecution timeMemory
314268kuboDetecting Molecules (IOI16_molecules)C11
0 / 100
0 ms256 KiB
#include <stdio.h>
#include <stdlib.h>


int cmpfunc (const void * a, const void * b)
{
    return ( *(int*)a - *(int*)b );
}


int find_subset (int l, int u, int w[], int n, int result[])
{
    qsort(w, n, sizeof(int), cmpfunc);
    int i = 0, j = 0;
    long v = 0;
    do {
        if (v < l && j<n-1) {
            v += w[j++];
        } else if (v > u && i<n) {
            v -= w[i++];
        } else {
            break;
        }
    } while (1);
    if (v>=l && v>=u) {
        for (int k=i; k<j; ++k)
            result[k-i] = w[k];
        return j-i;
    }
    return 0;
}


#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...