# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
218550 | 2020-04-02T09:24:24 Z | emil_physmath | Detecting Molecules (IOI16_molecules) | C++17 | 6 ms | 384 KB |
#include "molecules.h" #include <algorithm> #include <iostream> #include <bitset> #include <vector> using namespace std; bitset<10001> dp[10001], take[10001]; vector<int> find_subset(int l, int u, vector<int> a) { int n = a.size(); vector<pair<int, int> > w(n); for (int i = 0; i < n; ++i) w[i] = {a[i], i}; sort(w.begin(), w.end(), greater<pair<int, int> >()); vector<int> res; for (int i = 0, sum = w[0].first; i < n; sum += w[++i].first) { res.push_back(w[i].second); if (sum >= l) if (sum <= u) return res; else return vector<int>(0); } return vector<int>(0); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | OK (n = 1, answer = NO) |
2 | Correct | 5 ms | 256 KB | OK (n = 1, answer = NO) |
3 | Correct | 5 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
5 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
10 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 5 ms | 256 KB | OK (n = 3, answer = NO) |
14 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
15 | Correct | 4 ms | 384 KB | OK (n = 3, answer = YES) |
16 | Correct | 5 ms | 384 KB | OK (n = 3, answer = NO) |
17 | Correct | 4 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 5 ms | 384 KB | OK (n = 100, answer = NO) |
19 | Correct | 6 ms | 384 KB | OK (n = 100, answer = YES) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Contestant can not find answer, jury can |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | OK (n = 1, answer = NO) |
2 | Correct | 5 ms | 256 KB | OK (n = 1, answer = NO) |
3 | Correct | 5 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
5 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
10 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 5 ms | 256 KB | OK (n = 3, answer = NO) |
14 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
15 | Correct | 4 ms | 384 KB | OK (n = 3, answer = YES) |
16 | Correct | 5 ms | 384 KB | OK (n = 3, answer = NO) |
17 | Correct | 4 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 5 ms | 384 KB | OK (n = 100, answer = NO) |
19 | Correct | 6 ms | 384 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 5 ms | 384 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | OK (n = 1, answer = NO) |
2 | Correct | 5 ms | 256 KB | OK (n = 1, answer = NO) |
3 | Correct | 5 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
5 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
10 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 5 ms | 256 KB | OK (n = 3, answer = NO) |
14 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
15 | Correct | 4 ms | 384 KB | OK (n = 3, answer = YES) |
16 | Correct | 5 ms | 384 KB | OK (n = 3, answer = NO) |
17 | Correct | 4 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 5 ms | 384 KB | OK (n = 100, answer = NO) |
19 | Correct | 6 ms | 384 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 5 ms | 384 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | OK (n = 1, answer = NO) |
2 | Correct | 5 ms | 256 KB | OK (n = 1, answer = NO) |
3 | Correct | 5 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
5 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
10 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 5 ms | 256 KB | OK (n = 3, answer = NO) |
14 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
15 | Correct | 4 ms | 384 KB | OK (n = 3, answer = YES) |
16 | Correct | 5 ms | 384 KB | OK (n = 3, answer = NO) |
17 | Correct | 4 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 5 ms | 384 KB | OK (n = 100, answer = NO) |
19 | Correct | 6 ms | 384 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 5 ms | 384 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | OK (n = 1, answer = NO) |
2 | Correct | 5 ms | 256 KB | OK (n = 1, answer = NO) |
3 | Correct | 5 ms | 256 KB | OK (n = 1, answer = YES) |
4 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
5 | Correct | 5 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
7 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
9 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
10 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 5 ms | 256 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
13 | Correct | 5 ms | 256 KB | OK (n = 3, answer = NO) |
14 | Correct | 4 ms | 256 KB | OK (n = 3, answer = YES) |
15 | Correct | 4 ms | 384 KB | OK (n = 3, answer = YES) |
16 | Correct | 5 ms | 384 KB | OK (n = 3, answer = NO) |
17 | Correct | 4 ms | 256 KB | OK (n = 3, answer = NO) |
18 | Correct | 5 ms | 384 KB | OK (n = 100, answer = NO) |
19 | Correct | 6 ms | 384 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 5 ms | 384 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |