# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
529853 | new_acc | Detecting Molecules (IOI16_molecules) | C++14 | 50 ms | 8596 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<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=5e5+10;
vi find_subset(int l,int u, vi a){
vector<pair<int,int> >w;
for(int i=0;i<a.size();i++) w.push_back({a[i],i});
int n=w.size();
w.push_back({0,-1});
vl pref;
pref.push_back(0);
sort(w.begin(),w.end());
vi res;
ll mini=w[1].fi;
for(int i=1;i<=n;i++) w[i].fi-=mini;
for(int i=1;i<=n;i++) pref.push_back(pref[pref.size()-1]+w[i].fi);
for(int i=1;i<=n;i++){
ll nu=u-mini*(ll)i,nl=l-mini*(ll)i;
if(pref[i]>nu or pref[n]-pref[n-i]<nl) continue;
ll curr=0;
for(int j=1;j<=i;j++){
curr+=w[j].fi;
res.push_back(w[j].se);
}
for(int j=1;j<=i;j++){
if(curr>=nl) break;
curr+=w[n-j+1].fi-w[j].fi;
res[j-1]=w[n-j+1].se;
}
sort(res.begin(),res.end());
return res;
}
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... |