# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1200363 | abckefji | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 332 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int, int>
#define ti tuple<int, int, int>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#include "molecules.h"
vector<int> find_subset(int l, int r, vector<int> w) {
int n=w.size();
sort(w.begin(), w.end());
ll currsum=0;
deque<int> window;
for(int i=0; i<n; i++) {
currsum+=w[i];
window.push_back(i);
while(window.size() && currsum>r) {
currsum-=w[window.front()];
window.pop_front();
}
if(currsum>=l) {
return vector<int>(window.begin(), window.end());
}
}
return std::vector<int>(0);
}
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... |