Submission #1063995

#TimeUsernameProblemLanguageResultExecution timeMemory
1063995ducksaysquackDetecting Molecules (IOI16_molecules)C++98
100 / 100
35 ms5724 KiB
#include <bits/stdc++.h> #include "molecules.h" #define f first #define s second using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { int n = w.size(); vector<pair<int,int>> p(n); for(int i=0;i<n;i++) p[i].f = w[i], p[i].s = i; sort(begin(p),end(p)); long long x = 0, y = 0, c = p[0].f; while(y < n) { while(c > u) c -= p[x].f, x++; if(c >= l) break; y++; if(y < n) c += p[y].f; } vector<int> v; if(y == n) return v; else {for(int i=x;i<=y;i++) v.push_back(p[i].s); return v;} }
#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...