oj.uz

답안 #342126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
342126 2021-01-01T12:06:25 Z Karliver Detecting Molecules (IOI16_molecules) C++14
100 / 100
 78 ms 7168 KB 
#include "molecules.h"
#include <bits/stdc++.h>
#include <fstream>
#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(12)<<(x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i, b) for (int i=0; i<b; ++i)
using ll = long long;
const int mod = (ll)998244353;
#define PI acos(-1)
typedef pair<int , int> pairs;
typedef complex<ll> G;
const int INF = 1e9 + 1;
const int N = 2e6 + 2;
const double eps = 1e-7;

vector<int> find_subset(int l, int r, vector<int> a) {



    int n = a.size();
    vector<pairs>b(n);
    for(int i = 0;i < n; ++i) {

        b[i] = {a[i], i};
    }

    sort(b.begin(), b.end());
    sort(a.begin(), a.end());

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

    auto cmp = [&](int pos) {
        int ls = a[pos] + r - l;
        int low = pos;
        int high = upper_bound(a.begin() + pos, a.end(), ls) - a.begin();
        --high;


        int ans = -1;
        while(low < high) {
            int mid = (low + high) / 2;
            ll ps = pre[mid + 1] - pre[pos];

            if(ps >= l && ps <= r ) {
                ans = mid;
                break;
            }
            if(ps < l) {
                low = mid + 1;
            }
            else high = mid;
        }
        ll ss = pre[low + 1] - pre[pos];
        if(ss >= l && ss <= r) ans = low;
        return ans;
    };

    int st = -1;
    int ed = -1;

    for(int i = 0;i < n; ++i) {
        int ans = cmp(i);
        if(ans == -1)continue;
        st = i;
        ed = ans;
        break;
    }
    if(st == -1)return vector<int>(0);
    int sz = ed - st + 1;

    vector<int>ans;
    for(int i = st;i <= ed;++i)ans.push_back(b[i].second);

    return ans;


}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:74:9: warning: unused variable 'sz' [-Wunused-variable]
   74 |     int sz = ed - st + 1;
      |         ^~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

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