oj.uz

답안 #473978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
473978 2021-09-16T13:52:39 Z cs71107 Detecting Molecules (IOI16_molecules) C++14
100 / 100
 76 ms 5188 KB 
#include "molecules.h"

#include <bits/stdc++.h>
#define f first
#define s second

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

const int MAXN = 2e5+10;

pii A[MAXN];
ll psum[MAXN];

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    
    int n = (int)w.size();

    for(int i=1;i<=n;i++){
        A[i] = pii(w[i-1],i-1);
    }

    sort(A+1,A+n+1);

    for(int i=1;i<=n;i++){
        psum[i] = psum[i-1]+(ll)A[i].f;
    }

    ll lsum = 0;
    ll rsum = 0;

    ll curv = 0;
    ll lv = 0;
    ll rv = 0;

    vector<int> ans;

    int idx = 1;

    for(int i=1;i<=n;i++){

        lsum += (ll)A[i].f;
        rsum += (ll)A[n+1-i].f;

        if(lsum>u)break;
        if(rsum<l)continue;

        if(lsum>=l){
            for(int j=1;j<=i;j++){
                ans.push_back(A[j].s);
            }
        }
        else if(rsum<=u){
            for(int j=1;j<=i;j++){
                ans.push_back(A[n+1-j].s);
            }
        }
        else {
            
            idx = 1;
            curv = 0;

            for(int j=i-1;j>=0;j--){
                
                while(idx<=n){
                    
                    lv = curv + A[idx].f + (psum[idx+j]-psum[idx]);
                    rv = curv + A[idx].f + (psum[n]-psum[n-j]);

                    if(lv<=l&&u<=rv)break;

                    idx++;
                }

                assert(idx<=n);

                ans.push_back(A[idx].s);
                curv += (ll)A[idx].f;
                
                lv = curv + (psum[idx+j]-psum[idx]);
                rv = curv + (psum[n]-psum[n-j]);

                if(l<=lv&&lv<=u){
                    for(int t=idx+1;t<=idx+j;t++){
                        ans.push_back(A[t].s);
                    }
                    break;
                }
                else if(l<=rv&&rv<=u){
                    for(int t=n-j+1;t<=n;t++){
                        ans.push_back(A[t].s);
                    }
                    break;
                }

                idx++;
            }
        }

        break;
    }

    return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 292 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 4 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 2 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 204 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 460 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 460 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 292 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 4 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 2 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 204 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 460 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 460 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 2 ms 420 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 460 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 460 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 460 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 292 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 4 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 2 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 204 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 460 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 460 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 2 ms 420 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 460 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 460 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 204 KB OK (n = 1, answer = YES)
95 Correct 0 ms 204 KB OK (n = 3, answer = YES)
96 Correct 1 ms 204 KB OK (n = 3, answer = NO)
97 Correct 0 ms 204 KB OK (n = 3, answer = YES)
98 Correct 35 ms 3784 KB OK (n = 150000, answer = NO)
99 Correct 50 ms 4960 KB OK (n = 200000, answer = YES)
100 Correct 51 ms 4968 KB OK (n = 200000, answer = NO)
101 Correct 50 ms 5188 KB OK (n = 200000, answer = YES)
102 Correct 52 ms 4924 KB OK (n = 200000, answer = YES)
103 Correct 48 ms 4956 KB OK (n = 200000, answer = YES)
104 Correct 47 ms 4932 KB OK (n = 200000, answer = YES)
105 Correct 44 ms 4920 KB OK (n = 200000, answer = NO)
106 Correct 50 ms 5052 KB OK (n = 200000, answer = YES)
107 Correct 47 ms 4928 KB OK (n = 200000, answer = NO)
108 Correct 56 ms 4964 KB OK (n = 200000, answer = NO)
109 Correct 44 ms 4980 KB OK (n = 200000, answer = NO)
110 Correct 40 ms 4936 KB OK (n = 200000, answer = YES)
111 Correct 32 ms 4968 KB OK (n = 200000, answer = YES)
112 Correct 30 ms 4940 KB OK (n = 200000, answer = YES)
113 Correct 31 ms 5056 KB OK (n = 200000, answer = YES)
114 Correct 59 ms 5048 KB OK (n = 200000, answer = YES)
115 Correct 34 ms 5008 KB OK (n = 200000, answer = YES)
116 Correct 76 ms 4932 KB OK (n = 200000, answer = YES)
117 Correct 41 ms 4928 KB OK (n = 200000, answer = YES)