Submission #1063648

#TimeUsernameProblemLanguageResultExecution timeMemory
1063648HappyCapybaraDetecting Molecules (IOI16_molecules)C++17
9 / 100
1 ms604 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(); sort(w.begin(), w.end()); ll ls = 0, rs = 0; int cur = 0; while (!(ls <= u && rs >= l)){ if (cur == n) return vector<int>(0); ls += (ll) w[cur]; rs += (ll) w[n-cur-1]; cur++; } int next = cur; while (!(l <= ls && ls <= u)){ ls += (ll) w[next]-(ll) w[next-cur]; next++; } vector<int> res(cur); for (int i=0; i<cur; i++) res[i] = next-cur+i; 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...