# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1219905 | nickolasarapidis | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
vector<int> find_subset(int l, int r, vector<int> w){
int N = w.size(), sum = 0;
vector<pair<int, int>> W(N);
for(int i = 0; i < N; i++){
W[i] = {w[i], i};
sum += w[i];
}
sort(W.begin(), W.end());
bool done = false;
vector<int> ans;
for(int i = 0; i < N; i++){
if(done){
ans.push_back(W[i].S);
continue;
}
sum -= W[i].F;
if(sum >= l and sum <= r){
done;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |