# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
995612 | 2024-06-09T12:55:59 Z | Marszpace | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 604 KB |
#include "molecules.h" #include<bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, 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(),greater<pair<int,int>>()); vector<int> subs; int sum=0; for(auto [wi,pos]:p){ if(sum+wi<=u){ sum+=wi; subs.push_back(pos); if(sum>=l){return subs;} } } return vector<int>(0); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 604 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Contestant can not find answer, jury can |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 604 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 348 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 604 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 348 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 604 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 348 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 604 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 348 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |