# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
61060 | 2018-07-25T07:20:41 Z | Tenuun | Detecting Molecules (IOI16_molecules) | C++17 | 3 ms | 628 KB |
#include "molecules.h" #include<bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, std::vector<int> w) { vector<int>res; vector<pair<int, int> >v; for(int i=0; i<w.size(); i++){ v.push_back({w[i], i}); } sort(v.rbegin(), v.rend()); long long curr=0; int L=0, r=0; while(L<v.size()){ r=max(r, L); if(L==r){ curr=v[L].first; res.clear(); res.push_back(v[L].second); } while(r+1<v.size() && curr<l){ curr+=v[r+1].first; res.push_back(v[r+1].second); r++; } if(curr>=l && curr<=u) return res; while(res.size() && curr>u){ curr-=v[L].first; swap(*res.begin(), *res.end()); res.pop_back(); L++; } if(curr>=l && curr<=u) return res; L++; } if(curr>=l && curr<=u) return res; else return res={}, res; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 472 KB | OK (n = 1, answer = NO) |
3 | Correct | 3 ms | 472 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 472 KB | OK (n = 2, answer = YES) |
5 | Correct | 3 ms | 472 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 472 KB | OK (n = 3, answer = YES) |
7 | Correct | 3 ms | 524 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
13 | Correct | 3 ms | 628 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 628 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 628 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
18 | Correct | 3 ms | 628 KB | OK (n = 100, answer = NO) |
19 | Correct | 3 ms | 628 KB | OK (n = 100, answer = YES) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 628 KB | sum of weights should be in [302..304] but it is 305 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 472 KB | OK (n = 1, answer = NO) |
3 | Correct | 3 ms | 472 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 472 KB | OK (n = 2, answer = YES) |
5 | Correct | 3 ms | 472 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 472 KB | OK (n = 3, answer = YES) |
7 | Correct | 3 ms | 524 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
13 | Correct | 3 ms | 628 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 628 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 628 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
18 | Correct | 3 ms | 628 KB | OK (n = 100, answer = NO) |
19 | Correct | 3 ms | 628 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 628 KB | sum of weights should be in [302..304] but it is 305 |
21 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 472 KB | OK (n = 1, answer = NO) |
3 | Correct | 3 ms | 472 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 472 KB | OK (n = 2, answer = YES) |
5 | Correct | 3 ms | 472 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 472 KB | OK (n = 3, answer = YES) |
7 | Correct | 3 ms | 524 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
13 | Correct | 3 ms | 628 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 628 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 628 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
18 | Correct | 3 ms | 628 KB | OK (n = 100, answer = NO) |
19 | Correct | 3 ms | 628 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 628 KB | sum of weights should be in [302..304] but it is 305 |
21 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 472 KB | OK (n = 1, answer = NO) |
3 | Correct | 3 ms | 472 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 472 KB | OK (n = 2, answer = YES) |
5 | Correct | 3 ms | 472 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 472 KB | OK (n = 3, answer = YES) |
7 | Correct | 3 ms | 524 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
13 | Correct | 3 ms | 628 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 628 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 628 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
18 | Correct | 3 ms | 628 KB | OK (n = 100, answer = NO) |
19 | Correct | 3 ms | 628 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 628 KB | sum of weights should be in [302..304] but it is 305 |
21 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 472 KB | OK (n = 1, answer = NO) |
3 | Correct | 3 ms | 472 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 472 KB | OK (n = 2, answer = YES) |
5 | Correct | 3 ms | 472 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 472 KB | OK (n = 3, answer = YES) |
7 | Correct | 3 ms | 524 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 576 KB | OK (n = 3, answer = YES) |
13 | Correct | 3 ms | 628 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 628 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 628 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 628 KB | OK (n = 3, answer = NO) |
18 | Correct | 3 ms | 628 KB | OK (n = 100, answer = NO) |
19 | Correct | 3 ms | 628 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 628 KB | sum of weights should be in [302..304] but it is 305 |
21 | Halted | 0 ms | 0 KB | - |