Submission #402438

#TimeUsernameProblemLanguageResultExecution timeMemory
402438dxz05Detecting Molecules (IOI16_molecules)C++14
0 / 100
1 ms292 KiB
#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<int> perm(n);
    for (int i = 0; i < n; i++){
        perm[i] = i;
        if (l <= w[i] && w[i] <= u) return vector<int>(1, i);
    }

    sort(perm.begin(), perm.end(), [&](int i, int j){
        return w[i] < w[j];
    });

    for (int i = 0; i < n - 1; i++){
        int x = perm[i], y = perm[n - 1];
        if (l <= w[x] + w[y] && w[x] + w[y] <= u){
            vector<int> v = {y, x};
            return v;
        }
    }

    return vector<int>(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...