Submission #1063651

#TimeUsernameProblemLanguageResultExecution timeMemory
1063651HappyCapybaraDetecting Molecules (IOI16_molecules)C++17
100 / 100
46 ms6492 KiB
#include "molecules.h" #include<bits/stdc++.h> using namespace std; #define ll long long vector<int> find_subset(int l, int u, vector<int> w){ int n = w.size(); vector<int> v = w; vector<pair<int,int>> fts(n); for (int i=0; i<n; i++) fts[i] = {w[i], i}; sort(v.begin(), v.end()); sort(fts.begin(), fts.end()); ll ls = 0, rs = 0; int cur = 0; while (!(ls <= u && rs >= l)){ if (cur == n) return vector<int>(0); ls += (ll) v[cur]; rs += (ll) v[n-cur-1]; cur++; } int next = cur; while (!(l <= ls && ls <= u)){ ls += (ll) v[next]-(ll) v[next-cur]; next++; } vector<int> res(cur); for (int i=0; i<cur; i++) res[i] = fts[next-cur+i].second; return res; }
#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...