oj.uz

답안 #1116733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116733 2024-11-22T09:08:41 Z SalihSahin Detecting Molecules (IOI16_molecules) C++14
69 / 100
 44 ms 5900 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
#include "molecules.h"

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<pair<int, int> > a(n);
    for(int i = 0; i < n; i++){
        a[i] = {w[i], i};
    }
    sort(a.begin(), a.end());

    vector<int> pre(n+1);
    for(int i = 0; i < n; i++){
        pre[i+1] = pre[i] + a[i].first;
    }

    vector<int> ans;
    int r = 0;

    int st = -1, sz = -1, lst = -1;

    for(int i = 0; i < n; i++){
        while(r < n && a[r].first - a[i].first <= u - l) r++;
        bool ok = 0;
        int x = 0;

        int lp = 1, rp = r - i;
        while(lp < rp){
            int mid = (lp + rp)/2;

            if(pre[i + mid] - pre[i] >= u) rp = mid;
            else lp = mid + 1;
        }
        if(lp > 1 && pre[i + lp] - pre[i] > u) lp--;
        if(pre[i + lp] - pre[i] > u) continue;

        int cntlmax = lp; // cntlmax ya da daha az kisi olacak

        lp = 1, rp = r - i;
        while(lp < rp){
            int mid = (lp + rp)/2;

            if(pre[r] - pre[r - mid] < l) lp = mid + 1;
            else rp = mid;
        }

        if(pre[r] - pre[r - lp] < l) continue;
        int cntrmin = lp;

        if(cntrmin <= cntlmax){
            x = cntrmin;
            ok = 1;
        }

        if(ok){
            st = i;
            sz = x;
            lst = r-1;
            break;
        }
    }

    if(st == -1) return ans;
    else{
        //cout<<st<<" den baslayan "<<sz<<" sizelık array dondurcez"<<endl;
        // [st, lst] aralıgından sz sizelık secicez
        int sum = 0, rem = sz;
        for(int i = 0; i < sz; i++){
            sum += a[i + st].first;
        }

        for(int i = lst; i >= st; i--){
            if(!rem) break;
            int now = a[i].first;
            int added = a[st + rem - 1].first;

            if(sum + (now - added) <= u){
                ans.pb(a[i].second);
                rem--;
                sum += (now - added);
            }
        }

        return ans;
    }
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 336 KB OK (n = 1, answer = NO)
3 Correct 1 ms 336 KB OK (n = 1, answer = YES)
4 Correct 1 ms 336 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 504 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 436 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 336 KB OK (n = 3, answer = YES)
11 Correct 1 ms 504 KB OK (n = 3, answer = YES)
12 Correct 1 ms 336 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 2 ms 444 KB OK (n = 3, answer = NO)
17 Correct 1 ms 512 KB OK (n = 3, answer = NO)
18 Correct 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Correct 1 ms 336 KB OK (n = 12, answer = YES)
21 Correct 1 ms 336 KB OK (n = 12, answer = YES)
22 Correct 1 ms 336 KB OK (n = 12, answer = NO)
23 Correct 1 ms 336 KB OK (n = 12, answer = NO)
24 Correct 1 ms 336 KB OK (n = 12, answer = YES)
25 Correct 1 ms 336 KB OK (n = 12, answer = YES)
26 Correct 1 ms 336 KB OK (n = 12, answer = YES)
27 Correct 1 ms 336 KB OK (n = 12, answer = YES)
28 Correct 1 ms 336 KB OK (n = 6, answer = YES)
29 Correct 1 ms 336 KB OK (n = 12, answer = YES)
30 Correct 1 ms 336 KB OK (n = 100, answer = NO)
31 Correct 1 ms 336 KB OK (n = 100, answer = YES)
32 Correct 1 ms 336 KB OK (n = 100, answer = NO)
33 Correct 1 ms 336 KB OK (n = 100, answer = YES)
34 Correct 1 ms 336 KB OK (n = 100, answer = YES)
35 Correct 1 ms 336 KB OK (n = 100, answer = YES)
36 Correct 1 ms 440 KB OK (n = 100, answer = YES)
37 Correct 1 ms 336 KB OK (n = 28, answer = YES)
38 Correct 1 ms 336 KB OK (n = 27, answer = YES)
39 Correct 1 ms 336 KB OK (n = 90, answer = YES)
40 Correct 1 ms 336 KB OK (n = 100, answer = YES)
41 Correct 1 ms 336 KB OK (n = 100, answer = YES)
42 Correct 1 ms 336 KB OK (n = 10, answer = YES)
43 Correct 1 ms 504 KB OK (n = 100, answer = YES)
44 Correct 1 ms 336 KB OK (n = 100, answer = YES)
45 Correct 1 ms 336 KB OK (n = 100, answer = YES)
46 Correct 1 ms 336 KB OK (n = 100, answer = YES)
47 Correct 1 ms 336 KB OK (n = 100, answer = NO)
48 Correct 1 ms 336 KB OK (n = 100, answer = NO)
49 Correct 1 ms 336 KB OK (n = 100, answer = NO)
50 Correct 1 ms 336 KB OK (n = 100, answer = YES)
51 Correct 1 ms 336 KB OK (n = 100, answer = YES)
52 Correct 1 ms 336 KB OK (n = 100, answer = YES)
53 Correct 1 ms 336 KB OK (n = 100, answer = YES)
54 Correct 1 ms 336 KB OK (n = 100, answer = YES)
55 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 528 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 764 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 452 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 336 KB OK (n = 865, answer = YES)
73 Correct 1 ms 336 KB OK (n = 820, answer = YES)
74 Correct 2 ms 452 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 512 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 592 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
78 Correct 4 ms 592 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 608 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 548 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 760 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 592 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 632 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 764 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 336 KB OK (n = 1, answer = YES)
95 Correct 1 ms 336 KB OK (n = 3, answer = YES)
96 Correct 1 ms 336 KB OK (n = 3, answer = NO)
97 Correct 1 ms 336 KB OK (n = 3, answer = YES)
98 Correct 29 ms 4176 KB OK (n = 150000, answer = NO)
99 Incorrect 44 ms 5900 KB Contestant can not find answer, jury can
100 Halted 0 ms 0 KB -