oj.uz

답안 #299391

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
299391 2020-09-14T20:17:42 Z c4ts0up Detecting Molecules (IOI16_molecules) C++17
100 / 100
 73 ms 6884 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define ff first
#define ss second
typedef long long ll;

ll n;
vector <pair <ll,int> > arr;
vector <ll> ps;
vector <int> res;

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

    // pasamos los valores al arreglo global
    for (int i=0; i<n; i++) arr.pb({(ll)(w[i]), (i)});
    // ordenamos el arreglo
    sort(arr.begin(), arr.end());
    // hacemos el prefix sum
    ps.resize(n+1);
    ps[0] = 0LL;
    for (int i=0; i<n; i++) ps[i+1] = ps[i] + arr[i].ff;

    //cout << "ps: ";
    //for (int x : ps) cout << x << ", ";
    //cout << endl;

    // fuerza bruta
    int bajo, alto;
    bool flag = false;

    for (int i=0; i<n && !flag; i++) {
        int lb = i, ub = n, mid;
        while (lb <= ub) {
            mid = (lb+ub)/2;
            if (ps[mid]-ps[i] < l) lb = mid+1;
            else ub = mid-1;
        }

        //cout << i << " : " << "lb = " << lb << ", ub = " << ub << ", mid = " << mid << endl;
        
        if (i <= lb && lb <= n && l <= ps[lb]-ps[i] && ps[lb]-ps[i] <= u) {
            bajo = i;
            alto = lb-1;
            flag = true;
        }
        if (i <= ub && ub <= n && l <= ps[ub]-ps[i] && ps[ub]-ps[i] <= u) {
            bajo = i;
            alto = ub-1;
            flag = true;
        }
    }

    if (flag) {
        for (int idx=bajo; idx<=alto; idx++) res.pb(arr[idx].ss);
    }

    return res;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

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