# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1200352 | abckefji | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 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 mn, int mx, vector<int> w) {
int n=w.size();
ll currsum=0;
for(int r=0, l=0; r<n; r++) {
currsum+=w[r];
while(l<r && currsum>mx) {
currsum-=w[l];
l++;
}
if(currsum>=mn && l!=r) {
vector<int> ans;
for(int j=l; j<=r; j++) ans.push_back(j);
return ans;
}
}
return 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... |