Submission #243699

#TimeUsernameProblemLanguageResultExecution timeMemory
243699KubinDetecting Molecules (IOI16_molecules)C++17
0 / 100
5 ms384 KiB
#include <bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { const size_t n = w.size(); sort(w.begin(), w.end()); int a = w[0]; for(auto& x : w) x -= a; vector<int64_t> s(n + 1), z(n + 1); for(size_t i = 0; i < n; i++) s[i+1] = s[i] + w[i], z[i+1] = z[i] + w[n-i-1]; vector<int> result; for(size_t k = 1; result.empty() and k <= n; k++) { for(size_t i = 0; i <= k; i++) { auto c = (int64_t)k * a + s[i] + z[k-i]; if(l <= c and c <= u) { result.reserve(k); copy(w.begin(), w.begin() + i, back_inserter(result)); copy(w.end() - (k-i), w.end(), back_inserter(result)); } } } for(auto& x : result) x += a; return result; }
#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...