Submission #469213

#TimeUsernameProblemLanguageResultExecution timeMemory
469213flashmtDetecting Molecules (IOI16_molecules)C++17
100 / 100
70 ms6308 KiB
#include <bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { int n = size(w); vector<long long> s(n + 1); vector<int> id(n); iota(begin(id), end(id), 0); sort(begin(id), end(id), [&](int u, int v) { return w[u] < w[v]; }); for (int i = 0; i < n; i++) s[i + 1] = s[i] + w[id[i]]; for (int k = 1; k <= n; k++) { if (s[k] > u || s[n] - s[n - k] < l) continue; for (int i = k; i <= n; i++) if (l <= s[i] - s[i - k] && s[i] - s[i - k] <= u) { vector<int> ans; for (int j = i - k; j < i; j++) ans.push_back(id[j]); sort(begin(ans), end(ans)); return ans; } } return {}; }
#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...