# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1115238 | 2024-11-20T09:15:48 Z | Zflop | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 336 KB |
#pragma once #include <bits/stdc++.h> #include <vector> using namespace std; const int NMAX = (int)1e3 * 2; std::vector<int> find_subset(int l, int u, std::vector<int> w) { vector<pair<int,int>>p; for (int i = 0; i < w.size();++i) p.push_back({w[i],i}); sort(p.begin(),p.end()); vector<int>v; int s = 0; for (int i = w.size() - 1; i >= 0;--i) { if (s >= l && s <= u) return v; if (s + p[i].first <= u) { v.push_back(p[i].second); s += p[i].first; } } return v; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | sum of weights should be in [10..12] but it is 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | sum of weights should be in [302..304] but it is 255 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | sum of weights should be in [10..12] but it is 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | sum of weights should be in [10..12] but it is 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | sum of weights should be in [10..12] but it is 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | sum of weights should be in [10..12] but it is 9 |
2 | Halted | 0 ms | 0 KB | - |