# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
312100 | 2020-10-12T11:18:16 Z | Nayna | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 256 KB |
#include "molecules.h" #include <bits/stdc++.h> typedef long long ll; using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { ll sum = 0; int idx = -1; for(int i = 0; i < w.size(); i++) { sum+=w[i]; if(sum>=l) { idx = i; break; } } vector<int>res; if(sum>=l && sum<=u) for(int i = 0; i <= idx; i++) res.push_back(i+1); else res.push_back(0); return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 256 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 | 0 ms | 256 KB | sum of weights should be in [302..304] but it is 50 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 256 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 | 0 ms | 256 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 | 0 ms | 256 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 | 0 ms | 256 KB | sum of weights should be in [10..12] but it is 9 |
2 | Halted | 0 ms | 0 KB | - |