# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1200379 | abckefji | Detecting Molecules (IOI16_molecules) | C++20 | 36 ms | 4128 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();
vector<pi> mem;
for(int i=0; i<n; i++) mem.push_back({w[i], i});
sort(all(mem));
ll currsum=0;
for(int r=0, l=0; r<n; r++) {
currsum+=mem[r].first;
while(l<=r && currsum>mx) {
currsum-=mem[l].first;
l++;
}
if(currsum>=mn && l<=r) {
vector<int> ans;
for(int j=l; j<=r; j++) ans.push_back(mem[j].second);
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... |