답안 #312232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312232 2020-10-12T19:41:39 Z Nayna Detecting Molecules (IOI16_molecules) C++14
100 / 100
66 ms 6884 KB
#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

const int mxn = 1e5+5;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair<ll,ll>pii;
typedef pair<int,pii>piii;

#define  sf scanf
#define  pf printf

#define  input freopen("in.txt","r",stdin)
#define  output freopen("out.txt","w",stdout)

#define  inf 1e16
#define  ff first
#define  ss second
#define  MP make_pair
#define  pb push_back
#define  all(v) v.begin(), v.end()
#define  printcase(cases) printf("Case %d:", cases);
#define  Unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define  FAST  ios_base::sync_with_stdio(0);cout.tie(0)
//#define  endl printf("\n")
#define  __lcm(a, b) ((a*b)/__gcd(a, b))


vector<int> find_subset(int l, int u, vector<int> w)
{
    int n = w.size();
    vector<pii>arr;
    for(int i = 0; i < n; i++) arr.push_back({w[i], i});
    sort(all(arr));
    ll pre[n+10];
    pre[0] = arr[0].ff;
    for(int i = 1; i < n; i++) pre[i] = pre[i-1]+arr[i].ff;
    vector<int>res;
    for(int i = 0; i < n; i++)
    {
        int lo = i, hi = n-1;
        while(lo<=hi)
        {
            int mid = (lo+hi)>>1;
            int r = mid;
            ll sum = 0;
            if(i==0) sum = pre[r];
            else sum = pre[r]-pre[i-1];
            if(sum>u) hi = mid-1;
            else if(sum<l) lo = mid+1;
            else if(sum>=l && sum<=u)
            {
                for(int j = i; j <= r; j++) res.push_back(arr[j].ss);
                return res;
            }

        }
    }
    return res;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 12, answer = YES)
2 Correct 0 ms 256 KB OK (n = 12, answer = YES)
3 Correct 0 ms 256 KB OK (n = 12, answer = NO)
4 Correct 1 ms 256 KB OK (n = 12, answer = NO)
5 Correct 0 ms 256 KB OK (n = 12, answer = YES)
6 Correct 0 ms 256 KB OK (n = 12, answer = YES)
7 Correct 1 ms 384 KB OK (n = 12, answer = YES)
8 Correct 0 ms 256 KB OK (n = 12, answer = YES)
9 Correct 1 ms 256 KB OK (n = 6, answer = YES)
10 Correct 1 ms 384 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 0 ms 256 KB OK (n = 100, answer = NO)
14 Correct 0 ms 256 KB OK (n = 100, answer = YES)
15 Correct 0 ms 256 KB OK (n = 100, answer = YES)
16 Correct 0 ms 256 KB OK (n = 100, answer = YES)
17 Correct 1 ms 256 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 1 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 1 ms 384 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 1 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 384 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 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 1 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 276 KB OK (n = 10, answer = YES)
43 Correct 1 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 0 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 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 256 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)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 1 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 1 ms 384 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 1 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 384 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 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 1 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 276 KB OK (n = 10, answer = YES)
43 Correct 1 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 0 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 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 256 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 1052 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 3 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 3 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)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 1 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 1 ms 384 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 1 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 384 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 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 1 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 276 KB OK (n = 10, answer = YES)
43 Correct 1 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 0 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 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 256 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 1052 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 3 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 3 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 3 ms 768 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
79 Correct 3 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 768 KB OK (n = 10000, answer = NO)
86 Correct 3 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 2 ms 800 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 1 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 1 ms 384 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 1 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 384 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 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 1 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 276 KB OK (n = 10, answer = YES)
43 Correct 1 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 0 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 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 256 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 1052 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 3 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 3 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 3 ms 768 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
79 Correct 3 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 768 KB OK (n = 10000, answer = NO)
86 Correct 3 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 2 ms 800 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
94 Correct 0 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 0 ms 256 KB OK (n = 3, answer = YES)
98 Correct 42 ms 5744 KB OK (n = 150000, answer = NO)
99 Correct 57 ms 6756 KB OK (n = 200000, answer = YES)
100 Correct 64 ms 6752 KB OK (n = 200000, answer = NO)
101 Correct 58 ms 6880 KB OK (n = 200000, answer = YES)
102 Correct 63 ms 6752 KB OK (n = 200000, answer = YES)
103 Correct 54 ms 6752 KB OK (n = 200000, answer = YES)
104 Correct 57 ms 6756 KB OK (n = 200000, answer = YES)
105 Correct 56 ms 6756 KB OK (n = 200000, answer = NO)
106 Correct 61 ms 6880 KB OK (n = 200000, answer = YES)
107 Correct 66 ms 6756 KB OK (n = 200000, answer = NO)
108 Correct 57 ms 6756 KB OK (n = 200000, answer = NO)
109 Correct 56 ms 6772 KB OK (n = 200000, answer = NO)
110 Correct 44 ms 6752 KB OK (n = 200000, answer = YES)
111 Correct 38 ms 6756 KB OK (n = 200000, answer = YES)
112 Correct 40 ms 6756 KB OK (n = 200000, answer = YES)
113 Correct 40 ms 6756 KB OK (n = 200000, answer = YES)
114 Correct 43 ms 6756 KB OK (n = 200000, answer = YES)
115 Correct 42 ms 6756 KB OK (n = 200000, answer = YES)
116 Correct 49 ms 6756 KB OK (n = 200000, answer = YES)
117 Correct 47 ms 6884 KB OK (n = 200000, answer = YES)