# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1236866 | kaltspielerhy | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> trans(deque<int> q) {
vector<int> res;
while (!q.empty()) {
res.push_back(q.back());
q.pop_back();
}
return res;
}
vector<int> find_subset(int l, int u, vector<int> w) {
sort(w.begin(), w.end());
int N = w.size();
int idx = N-1;
ll somme = 0;
int nbAjouts = 0;
vector<int> sommeCum(N+1, 0);
for (int i = 1; i <= N; i++) {
sommeCum[i] = sommeCum[i-1]+w[i-1];
}
int end = 0;
for (int iDep = 1; iDep <= N; iDep++) {
while (end <= N && sommeCum[end]-sommeCum[iDep-1] < l) {
end++;
}
if (sommeCum[end]-sommeCum[iDep-1] <= u) {
vector<int> res;
for (int i = iDep; i <= end; i++) {
res.push_back(i);
}
return res;
}
}
return vector<int>();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |