oj.uz

답안 #208627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208627 2020-03-11T23:37:09 Z DavidDamian Detecting Molecules (IOI16_molecules) C++11
31 / 100
 685 ms 65536 KB 
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
map<pii,short> memo;
int S[200005];
int A[100005];
bool possible(int i,int L,int R)
{
    if(L<0 || i==0 || S[i]<L) return false;
    if(L<=A[i] && A[i]<=R) return true;
    if(memo[pii(i,L)]==0){
        bool ans=possible(i-1,L-A[i],R-A[i]) || possible(i-1,L,R);
        if(ans) memo[pii(i,L)]=1;
        else memo[pii(i,L)]=-1;
    }
    if(memo[pii(i,L)]==-1) return false;
    else return true;
}
void createSubset(vector<int>& ans,int i,int L,int R)
{
    if(L<=A[i] && A[i]<=R){
        ans.push_back(i-1);
        return;
    }
    if(possible(i-1,L-A[i],R-A[i])){
        ans.push_back(i-1);
        createSubset(ans,i-1,L-A[i],R-A[i]);
    }
    else{
        createSubset(ans,i-1,L,R);
    }
}
vector<int> find_subset(int l, int r, vector<int> w) {
    for(int i=0;i<w.size();i++){
        A[i+1]=w[i];
    }
    for(int i=1;i<=w.size();i++){
        S[i]=S[i-1]+A[i];
    }
    vector<int> subset;
    if(possible(w.size(),l,r)){
        createSubset(subset,w.size(),l,r);
    }
    return subset;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:35:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<w.size();i++){
                 ~^~~~~~~~~
molecules.cpp:38:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1;i<=w.size();i++){
                 ~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB OK (n = 1, answer = NO)
2 Correct 5 ms 376 KB OK (n = 1, answer = NO)
3 Correct 5 ms 376 KB OK (n = 1, answer = YES)
4 Correct 5 ms 376 KB OK (n = 2, answer = YES)
5 Correct 5 ms 376 KB OK (n = 2, answer = YES)
6 Correct 5 ms 376 KB OK (n = 3, answer = YES)
7 Correct 5 ms 380 KB OK (n = 3, answer = YES)
8 Correct 5 ms 376 KB OK (n = 3, answer = YES)
9 Correct 5 ms 376 KB OK (n = 3, answer = YES)
10 Correct 5 ms 376 KB OK (n = 3, answer = YES)
11 Correct 5 ms 376 KB OK (n = 3, answer = YES)
12 Correct 5 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 5 ms 376 KB OK (n = 3, answer = YES)
15 Correct 5 ms 380 KB OK (n = 3, answer = YES)
16 Correct 5 ms 376 KB OK (n = 3, answer = NO)
17 Correct 5 ms 376 KB OK (n = 3, answer = NO)
18 Correct 5 ms 376 KB OK (n = 100, answer = NO)
19 Correct 5 ms 376 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB OK (n = 12, answer = YES)
2 Correct 5 ms 376 KB OK (n = 12, answer = YES)
3 Correct 5 ms 376 KB OK (n = 12, answer = NO)
4 Correct 5 ms 376 KB OK (n = 12, answer = NO)
5 Correct 5 ms 376 KB OK (n = 12, answer = YES)
6 Correct 5 ms 376 KB OK (n = 12, answer = YES)
7 Correct 5 ms 376 KB OK (n = 12, answer = YES)
8 Correct 14 ms 376 KB OK (n = 12, answer = YES)
9 Correct 5 ms 376 KB OK (n = 6, answer = YES)
10 Correct 5 ms 376 KB OK (n = 12, answer = YES)
11 Correct 5 ms 376 KB OK (n = 100, answer = NO)
12 Correct 5 ms 376 KB OK (n = 100, answer = YES)
13 Correct 5 ms 376 KB OK (n = 100, answer = NO)
14 Correct 4 ms 380 KB OK (n = 100, answer = YES)
15 Correct 12 ms 1016 KB OK (n = 100, answer = YES)
16 Correct 5 ms 376 KB OK (n = 100, answer = YES)
17 Correct 6 ms 504 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB OK (n = 1, answer = NO)
2 Correct 5 ms 376 KB OK (n = 1, answer = NO)
3 Correct 5 ms 376 KB OK (n = 1, answer = YES)
4 Correct 5 ms 376 KB OK (n = 2, answer = YES)
5 Correct 5 ms 376 KB OK (n = 2, answer = YES)
6 Correct 5 ms 376 KB OK (n = 3, answer = YES)
7 Correct 5 ms 380 KB OK (n = 3, answer = YES)
8 Correct 5 ms 376 KB OK (n = 3, answer = YES)
9 Correct 5 ms 376 KB OK (n = 3, answer = YES)
10 Correct 5 ms 376 KB OK (n = 3, answer = YES)
11 Correct 5 ms 376 KB OK (n = 3, answer = YES)
12 Correct 5 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 5 ms 376 KB OK (n = 3, answer = YES)
15 Correct 5 ms 380 KB OK (n = 3, answer = YES)
16 Correct 5 ms 376 KB OK (n = 3, answer = NO)
17 Correct 5 ms 376 KB OK (n = 3, answer = NO)
18 Correct 5 ms 376 KB OK (n = 100, answer = NO)
19 Correct 5 ms 376 KB OK (n = 100, answer = YES)
20 Correct 5 ms 376 KB OK (n = 12, answer = YES)
21 Correct 5 ms 376 KB OK (n = 12, answer = YES)
22 Correct 5 ms 376 KB OK (n = 12, answer = NO)
23 Correct 5 ms 376 KB OK (n = 12, answer = NO)
24 Correct 5 ms 376 KB OK (n = 12, answer = YES)
25 Correct 5 ms 376 KB OK (n = 12, answer = YES)
26 Correct 5 ms 376 KB OK (n = 12, answer = YES)
27 Correct 14 ms 376 KB OK (n = 12, answer = YES)
28 Correct 5 ms 376 KB OK (n = 6, answer = YES)
29 Correct 5 ms 376 KB OK (n = 12, answer = YES)
30 Correct 5 ms 376 KB OK (n = 100, answer = NO)
31 Correct 5 ms 376 KB OK (n = 100, answer = YES)
32 Correct 5 ms 376 KB OK (n = 100, answer = NO)
33 Correct 4 ms 380 KB OK (n = 100, answer = YES)
34 Correct 12 ms 1016 KB OK (n = 100, answer = YES)
35 Correct 5 ms 376 KB OK (n = 100, answer = YES)
36 Correct 6 ms 504 KB OK (n = 100, answer = YES)
37 Correct 7 ms 636 KB OK (n = 28, answer = YES)
38 Correct 5 ms 376 KB OK (n = 27, answer = YES)
39 Correct 5 ms 376 KB OK (n = 90, answer = YES)
40 Correct 5 ms 376 KB OK (n = 100, answer = YES)
41 Correct 5 ms 376 KB OK (n = 100, answer = YES)
42 Correct 5 ms 376 KB OK (n = 10, answer = YES)
43 Correct 5 ms 376 KB OK (n = 100, answer = YES)
44 Correct 5 ms 376 KB OK (n = 100, answer = YES)
45 Correct 10 ms 1016 KB OK (n = 100, answer = YES)
46 Correct 5 ms 376 KB OK (n = 100, answer = YES)
47 Correct 5 ms 376 KB OK (n = 100, answer = NO)
48 Correct 5 ms 376 KB OK (n = 100, answer = NO)
49 Correct 6 ms 632 KB OK (n = 100, answer = NO)
50 Correct 5 ms 376 KB OK (n = 100, answer = YES)
51 Correct 5 ms 376 KB OK (n = 100, answer = YES)
52 Correct 13 ms 1272 KB OK (n = 100, answer = YES)
53 Correct 5 ms 380 KB OK (n = 100, answer = YES)
54 Correct 5 ms 376 KB OK (n = 100, answer = YES)

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB OK (n = 1, answer = NO)
2 Correct 5 ms 376 KB OK (n = 1, answer = NO)
3 Correct 5 ms 376 KB OK (n = 1, answer = YES)
4 Correct 5 ms 376 KB OK (n = 2, answer = YES)
5 Correct 5 ms 376 KB OK (n = 2, answer = YES)
6 Correct 5 ms 376 KB OK (n = 3, answer = YES)
7 Correct 5 ms 380 KB OK (n = 3, answer = YES)
8 Correct 5 ms 376 KB OK (n = 3, answer = YES)
9 Correct 5 ms 376 KB OK (n = 3, answer = YES)
10 Correct 5 ms 376 KB OK (n = 3, answer = YES)
11 Correct 5 ms 376 KB OK (n = 3, answer = YES)
12 Correct 5 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 5 ms 376 KB OK (n = 3, answer = YES)
15 Correct 5 ms 380 KB OK (n = 3, answer = YES)
16 Correct 5 ms 376 KB OK (n = 3, answer = NO)
17 Correct 5 ms 376 KB OK (n = 3, answer = NO)
18 Correct 5 ms 376 KB OK (n = 100, answer = NO)
19 Correct 5 ms 376 KB OK (n = 100, answer = YES)
20 Correct 5 ms 376 KB OK (n = 12, answer = YES)
21 Correct 5 ms 376 KB OK (n = 12, answer = YES)
22 Correct 5 ms 376 KB OK (n = 12, answer = NO)
23 Correct 5 ms 376 KB OK (n = 12, answer = NO)
24 Correct 5 ms 376 KB OK (n = 12, answer = YES)
25 Correct 5 ms 376 KB OK (n = 12, answer = YES)
26 Correct 5 ms 376 KB OK (n = 12, answer = YES)
27 Correct 14 ms 376 KB OK (n = 12, answer = YES)
28 Correct 5 ms 376 KB OK (n = 6, answer = YES)
29 Correct 5 ms 376 KB OK (n = 12, answer = YES)
30 Correct 5 ms 376 KB OK (n = 100, answer = NO)
31 Correct 5 ms 376 KB OK (n = 100, answer = YES)
32 Correct 5 ms 376 KB OK (n = 100, answer = NO)
33 Correct 4 ms 380 KB OK (n = 100, answer = YES)
34 Correct 12 ms 1016 KB OK (n = 100, answer = YES)
35 Correct 5 ms 376 KB OK (n = 100, answer = YES)
36 Correct 6 ms 504 KB OK (n = 100, answer = YES)
37 Correct 7 ms 636 KB OK (n = 28, answer = YES)
38 Correct 5 ms 376 KB OK (n = 27, answer = YES)
39 Correct 5 ms 376 KB OK (n = 90, answer = YES)
40 Correct 5 ms 376 KB OK (n = 100, answer = YES)
41 Correct 5 ms 376 KB OK (n = 100, answer = YES)
42 Correct 5 ms 376 KB OK (n = 10, answer = YES)
43 Correct 5 ms 376 KB OK (n = 100, answer = YES)
44 Correct 5 ms 376 KB OK (n = 100, answer = YES)
45 Correct 10 ms 1016 KB OK (n = 100, answer = YES)
46 Correct 5 ms 376 KB OK (n = 100, answer = YES)
47 Correct 5 ms 376 KB OK (n = 100, answer = NO)
48 Correct 5 ms 376 KB OK (n = 100, answer = NO)
49 Correct 6 ms 632 KB OK (n = 100, answer = NO)
50 Correct 5 ms 376 KB OK (n = 100, answer = YES)
51 Correct 5 ms 376 KB OK (n = 100, answer = YES)
52 Correct 13 ms 1272 KB OK (n = 100, answer = YES)
53 Correct 5 ms 380 KB OK (n = 100, answer = YES)
54 Correct 5 ms 376 KB OK (n = 100, answer = YES)
55 Correct 6 ms 632 KB OK (n = 10000, answer = YES)
56 Runtime error 685 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
57 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB OK (n = 1, answer = NO)
2 Correct 5 ms 376 KB OK (n = 1, answer = NO)
3 Correct 5 ms 376 KB OK (n = 1, answer = YES)
4 Correct 5 ms 376 KB OK (n = 2, answer = YES)
5 Correct 5 ms 376 KB OK (n = 2, answer = YES)
6 Correct 5 ms 376 KB OK (n = 3, answer = YES)
7 Correct 5 ms 380 KB OK (n = 3, answer = YES)
8 Correct 5 ms 376 KB OK (n = 3, answer = YES)
9 Correct 5 ms 376 KB OK (n = 3, answer = YES)
10 Correct 5 ms 376 KB OK (n = 3, answer = YES)
11 Correct 5 ms 376 KB OK (n = 3, answer = YES)
12 Correct 5 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 5 ms 376 KB OK (n = 3, answer = YES)
15 Correct 5 ms 380 KB OK (n = 3, answer = YES)
16 Correct 5 ms 376 KB OK (n = 3, answer = NO)
17 Correct 5 ms 376 KB OK (n = 3, answer = NO)
18 Correct 5 ms 376 KB OK (n = 100, answer = NO)
19 Correct 5 ms 376 KB OK (n = 100, answer = YES)
20 Correct 5 ms 376 KB OK (n = 12, answer = YES)
21 Correct 5 ms 376 KB OK (n = 12, answer = YES)
22 Correct 5 ms 376 KB OK (n = 12, answer = NO)
23 Correct 5 ms 376 KB OK (n = 12, answer = NO)
24 Correct 5 ms 376 KB OK (n = 12, answer = YES)
25 Correct 5 ms 376 KB OK (n = 12, answer = YES)
26 Correct 5 ms 376 KB OK (n = 12, answer = YES)
27 Correct 14 ms 376 KB OK (n = 12, answer = YES)
28 Correct 5 ms 376 KB OK (n = 6, answer = YES)
29 Correct 5 ms 376 KB OK (n = 12, answer = YES)
30 Correct 5 ms 376 KB OK (n = 100, answer = NO)
31 Correct 5 ms 376 KB OK (n = 100, answer = YES)
32 Correct 5 ms 376 KB OK (n = 100, answer = NO)
33 Correct 4 ms 380 KB OK (n = 100, answer = YES)
34 Correct 12 ms 1016 KB OK (n = 100, answer = YES)
35 Correct 5 ms 376 KB OK (n = 100, answer = YES)
36 Correct 6 ms 504 KB OK (n = 100, answer = YES)
37 Correct 7 ms 636 KB OK (n = 28, answer = YES)
38 Correct 5 ms 376 KB OK (n = 27, answer = YES)
39 Correct 5 ms 376 KB OK (n = 90, answer = YES)
40 Correct 5 ms 376 KB OK (n = 100, answer = YES)
41 Correct 5 ms 376 KB OK (n = 100, answer = YES)
42 Correct 5 ms 376 KB OK (n = 10, answer = YES)
43 Correct 5 ms 376 KB OK (n = 100, answer = YES)
44 Correct 5 ms 376 KB OK (n = 100, answer = YES)
45 Correct 10 ms 1016 KB OK (n = 100, answer = YES)
46 Correct 5 ms 376 KB OK (n = 100, answer = YES)
47 Correct 5 ms 376 KB OK (n = 100, answer = NO)
48 Correct 5 ms 376 KB OK (n = 100, answer = NO)
49 Correct 6 ms 632 KB OK (n = 100, answer = NO)
50 Correct 5 ms 376 KB OK (n = 100, answer = YES)
51 Correct 5 ms 376 KB OK (n = 100, answer = YES)
52 Correct 13 ms 1272 KB OK (n = 100, answer = YES)
53 Correct 5 ms 380 KB OK (n = 100, answer = YES)
54 Correct 5 ms 376 KB OK (n = 100, answer = YES)
55 Correct 6 ms 632 KB OK (n = 10000, answer = YES)
56 Runtime error 685 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
57 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB OK (n = 1, answer = NO)
2 Correct 5 ms 376 KB OK (n = 1, answer = NO)
3 Correct 5 ms 376 KB OK (n = 1, answer = YES)
4 Correct 5 ms 376 KB OK (n = 2, answer = YES)
5 Correct 5 ms 376 KB OK (n = 2, answer = YES)
6 Correct 5 ms 376 KB OK (n = 3, answer = YES)
7 Correct 5 ms 380 KB OK (n = 3, answer = YES)
8 Correct 5 ms 376 KB OK (n = 3, answer = YES)
9 Correct 5 ms 376 KB OK (n = 3, answer = YES)
10 Correct 5 ms 376 KB OK (n = 3, answer = YES)
11 Correct 5 ms 376 KB OK (n = 3, answer = YES)
12 Correct 5 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 5 ms 376 KB OK (n = 3, answer = YES)
15 Correct 5 ms 380 KB OK (n = 3, answer = YES)
16 Correct 5 ms 376 KB OK (n = 3, answer = NO)
17 Correct 5 ms 376 KB OK (n = 3, answer = NO)
18 Correct 5 ms 376 KB OK (n = 100, answer = NO)
19 Correct 5 ms 376 KB OK (n = 100, answer = YES)
20 Correct 5 ms 376 KB OK (n = 12, answer = YES)
21 Correct 5 ms 376 KB OK (n = 12, answer = YES)
22 Correct 5 ms 376 KB OK (n = 12, answer = NO)
23 Correct 5 ms 376 KB OK (n = 12, answer = NO)
24 Correct 5 ms 376 KB OK (n = 12, answer = YES)
25 Correct 5 ms 376 KB OK (n = 12, answer = YES)
26 Correct 5 ms 376 KB OK (n = 12, answer = YES)
27 Correct 14 ms 376 KB OK (n = 12, answer = YES)
28 Correct 5 ms 376 KB OK (n = 6, answer = YES)
29 Correct 5 ms 376 KB OK (n = 12, answer = YES)
30 Correct 5 ms 376 KB OK (n = 100, answer = NO)
31 Correct 5 ms 376 KB OK (n = 100, answer = YES)
32 Correct 5 ms 376 KB OK (n = 100, answer = NO)
33 Correct 4 ms 380 KB OK (n = 100, answer = YES)
34 Correct 12 ms 1016 KB OK (n = 100, answer = YES)
35 Correct 5 ms 376 KB OK (n = 100, answer = YES)
36 Correct 6 ms 504 KB OK (n = 100, answer = YES)
37 Correct 7 ms 636 KB OK (n = 28, answer = YES)
38 Correct 5 ms 376 KB OK (n = 27, answer = YES)
39 Correct 5 ms 376 KB OK (n = 90, answer = YES)
40 Correct 5 ms 376 KB OK (n = 100, answer = YES)
41 Correct 5 ms 376 KB OK (n = 100, answer = YES)
42 Correct 5 ms 376 KB OK (n = 10, answer = YES)
43 Correct 5 ms 376 KB OK (n = 100, answer = YES)
44 Correct 5 ms 376 KB OK (n = 100, answer = YES)
45 Correct 10 ms 1016 KB OK (n = 100, answer = YES)
46 Correct 5 ms 376 KB OK (n = 100, answer = YES)
47 Correct 5 ms 376 KB OK (n = 100, answer = NO)
48 Correct 5 ms 376 KB OK (n = 100, answer = NO)
49 Correct 6 ms 632 KB OK (n = 100, answer = NO)
50 Correct 5 ms 376 KB OK (n = 100, answer = YES)
51 Correct 5 ms 376 KB OK (n = 100, answer = YES)
52 Correct 13 ms 1272 KB OK (n = 100, answer = YES)
53 Correct 5 ms 380 KB OK (n = 100, answer = YES)
54 Correct 5 ms 376 KB OK (n = 100, answer = YES)
55 Correct 6 ms 632 KB OK (n = 10000, answer = YES)
56 Runtime error 685 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
57 Halted 0 ms 0 KB -