# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172099 | nguyenkhangninh99 | Detecting Molecules (IOI16_molecules) | C++20 | 37 ms | 4280 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#define ll long long
vector<int> find_subset(int l, int u, vector<int> w){
queue<int> q;
vector<int> res;
vector<array<int, 2>> a;
ll cur = 0;
for (int i = 0; i < w.size(); i++) a.push_back({w[i], i});
sort(a.begin(), a.end());
for (int i = 0; i < w.size(); i++){
cur += a[i][0];
q.push(a[i][1]);
if(cur > u){
cur -= w[q.front()];
q.pop();
}
if(l <= cur && cur <= u){
while (!q.empty()){
res.push_back(q.front());
q.pop();
}
break;
}
}
return res;
}
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... |