Submission #114550

#TimeUsernameProblemLanguageResultExecution timeMemory
114550wilwxkDetecting Molecules (IOI16_molecules)C++11
100 / 100
59 ms7164 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN=2e5+5; pair<ll, int> v[MAXN]; vector<int> resp; ll L, R; int n; vector<int> find_subset(int u, int l, vector<int> w) { L=u; R=l; int n=w.size(); for(int i=1; i<=n; i++) v[i]={w[i-1], i-1}; sort(v+1, v+1+n); int ind=1; ll soma=0; for(int i=1; i<=n; i++) { soma+=v[i].first; while(soma>R&&ind<i) soma-=v[ind++].first; if(L<=soma&&soma<=R) { //printf("achou!! %d %d\n", ind, i); for(int j=ind; j<=i; j++) resp.push_back(v[j].second); break; } } if(resp.size()) sort(resp.begin(), resp.end()); return resp; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...