# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161519 | 2019-11-02T20:12:18 Z | kostia244 | Detecting Molecules (IOI16_molecules) | C++14 | 3 ms | 376 KB |
#include "molecules.h" #include<bits/stdc++.h> #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define pb push_back using namespace std; using ll = long long; using vi = vector<int>; vi find_subset(int l, int u, std::vector<int> w) { vi t; if(l>u)return {}; for(int i = 0; i < w.size(); i++) { t.pb(i); if((i+1)*w[0]>=l&&(i+1)*w[0]<=u)return t; } return {}; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Contestant can not find answer, jury can |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 376 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 376 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 376 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 376 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |