# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69047 | TuGSGeReL | Detecting Molecules (IOI16_molecules) | C++14 | 3 ms | 640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pub push_back
#define pob pop_back
#define ss second
#define ff first
#define ext exit(0)
using namespace std;
int i;
ll s;
vector<pair<int,int> >v;
vector<int> find_subset(int l, int u, vector<int> w) {
for(i=0;i<w.size();i++) v.pub(mp(w[i],i));
sort(w.begin(),w.end());
deque<pair<int,int> >ans1;
vector<int>ans;
for(i=0;i<v.size();i++){
if(s+v[i].ff<=u){
s+=v[i].ff;
ans1.pub(mp(v[i].ff,v[i].ss));
}
else if(s-ans1[0].ff+v[i].ff<=u){
s-=ans1[0].ff-v[i].ff;
ans1.pop_front();
ans1.pub(mp(v[i].ff,v[i].ss));
}
}
for(i=0;i<ans1.size();i++){
ans.pub(ans1[i].ss);
}
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... |