Submission #472102

#TimeUsernameProblemLanguageResultExecution timeMemory
472102Cross_RatioDetecting Molecules (IOI16_molecules)C++14
100 / 100
61 ms6296 KiB
#include <bits/stdc++.h> //#include "molecules.h" using namespace std; typedef pair<int,int> P; vector<int> find_subset(int l, int u, vector<int> w) { int i; int N = w.size(); vector<P> V; for(i=0;i<N;i++) { V.push_back(P(w[i],i)); } sort(V.begin(),V.end()); int j = 0; long long int sum = 0; for(i=0;i<N;i++) { sum += V[i].first; if(sum > u) { while(sum > u) { sum -= V[j].first; j++; } if(sum >= l) { vector<int> ans; for(int k=j;k<=i;k++) ans.push_back(V[k].second); sort(ans.begin(),ans.end()); return ans; } } else if(sum >= l) { vector<int> ans; for(int k=j;k<=i;k++) ans.push_back(V[k].second); sort(ans.begin(),ans.end()); return ans; } } return vector<int> {}; }
#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...