Submission #299616

#TimeUsernameProblemLanguageResultExecution timeMemory
299616ValeeDetecting Molecules (IOI16_molecules)C++14
9 / 100
1 ms384 KiB
#include "molecules.h" #include <bits/stdc++.h> #define ll long long using namespace std; vector<int> find_subset(int l, int u, vector<int> v) { bool ok = false; vector<int>ans; int n = (int)v.size(); sort(v.begin(), v.end()); int lb = 0, rb = n+1, lans = 0, rans = 0; while (lb < rb && !ok){ ll m = (lb+rb)>>1, sz = 0, sum = 0; for (int i = 0; i < n; i++){ sz++; if (sz <= m) sum += v[i]; else sum += v[i]-v[i-m]; if (l <= sum && sum <= u){ lans = max(0LL, i-m+1); rans = i; ok = true; break; } } if (sum > u) rb = m; else lb = m+1; } if (ok) for (int i = lans; i <= rans; i++) ans.push_back(i); return ans; }
#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...