# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1115208 | 2024-11-20T08:41:38 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; int dp[NMAX],from[NMAX]; std::vector<int> find_subset(int l, int u, std::vector<int> w) { dp[0] = 1; for (int i = 0; i < w.size();++i) { for (int j = u + 1; j >= 0;--j) if (dp[j]) { dp[j + w[i]] = 1; from[j] = i; } } vector<int>v; int este = 0; for (int i = u; i >= l;--i) if (dp[i]) { este = i; break; } v.push_back(este); while (from[v.back()]) { v.push_back(from[v.back()]); } 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 | Integer 304 violates the range [0, 11] |
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 | - |