oj.uz

답안 #972865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972865 2024-05-01T09:14:47 Z VinhLuu Detecting Molecules (IOI16_molecules) C++17
100 / 100
 47 ms 7344 KB 
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 1e6 + 5;
int block = 555;
const int mod = 1e9 + 7;
//const ll oo = 5e18;

int n, a[N];

vector<int> find_subset(int L,int R,vector<int> _w){
    vector<int> w;
    for(int i = 0; i < _w.size(); i ++) w.pb(i);
    sort(all(w), [&] (int x,int y){return _w[x] < _w[y];});
    for(int i = 0; i < w.size(); i ++){
        a[i] = w[i];
        w[i] = _w[w[i]];
    }
    int ptr = 0;
    vector<int> ans;
    if(w[0] >= L && w[0] <= R){ans.pb(0); return ans;}
    deque<int> dq;
    ll tmp = w[0];
    dq.pb(0);
    for(int i = 1; i < w.size(); i ++){
        dq.push_front(i);
        tmp += w[i];
        if(tmp >= L && tmp <= R){
            while(!dq.empty()){
                ans.pb(a[dq.back()]);
                dq.pop_back();
            }
            sort(all(ans));
            return ans;
        }
        while(!dq.empty() && tmp >= R){
            tmp -= w[dq.back()];
            dq.pop_back();
        }
        if(tmp >= L && tmp <= R){
            while(!dq.empty()){
                ans.pb(a[dq.back()]);
                dq.pop_back();
            }
            sort(all(ans));
            return ans;
        }

    }

    return ans;
}

//#define lpv
#ifdef lpv

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    int l, u; cin >> l >> u;
    int x;
    vector<int> input;
    while (cin >> x) input.push_back(x);

    for (auto i : find_subset(l, u, input))
    cout << i << ' ';
}
#endif // lpv

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:24:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i = 0; i < _w.size(); i ++) w.pb(i);
      |                    ~~^~~~~~~~~~~
molecules.cpp:26:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i = 0; i < w.size(); i ++){
      |                    ~~^~~~~~~~~~
molecules.cpp:36:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for(int i = 1; i < w.size(); i ++){
      |                    ~~^~~~~~~~~~
molecules.cpp:30:9: warning: unused variable 'ptr' [-Wunused-variable]
   30 |     int ptr = 0;
      |         ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB OK (n = 1, answer = NO)
2 Correct 1 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 344 KB OK (n = 3, answer = YES)
9 Correct 0 ms 344 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 1 ms 348 KB OK (n = 3, answer = YES)
13 Correct 0 ms 344 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 344 KB OK (n = 3, answer = YES)
16 Correct 0 ms 348 KB OK (n = 3, answer = NO)
17 Correct 0 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Correct 0 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 348 KB OK (n = 12, answer = YES)
22 Correct 0 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 348 KB OK (n = 12, answer = NO)
24 Correct 0 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 344 KB OK (n = 12, answer = YES)
26 Correct 0 ms 348 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 0 ms 348 KB OK (n = 6, answer = YES)
29 Correct 0 ms 348 KB OK (n = 12, answer = YES)
30 Correct 1 ms 348 KB OK (n = 100, answer = NO)
31 Correct 0 ms 348 KB OK (n = 100, answer = YES)
32 Correct 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 444 KB OK (n = 100, answer = YES)
34 Correct 0 ms 348 KB OK (n = 100, answer = YES)
35 Correct 0 ms 348 KB OK (n = 100, answer = YES)
36 Correct 0 ms 348 KB OK (n = 100, answer = YES)
37 Correct 0 ms 348 KB OK (n = 28, answer = YES)
38 Correct 0 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 344 KB OK (n = 90, answer = YES)
40 Correct 1 ms 348 KB OK (n = 100, answer = YES)
41 Correct 0 ms 348 KB OK (n = 100, answer = YES)
42 Correct 1 ms 448 KB OK (n = 10, answer = YES)
43 Correct 0 ms 348 KB OK (n = 100, answer = YES)
44 Correct 0 ms 600 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 0 ms 344 KB OK (n = 100, answer = NO)
48 Correct 0 ms 348 KB OK (n = 100, answer = NO)
49 Correct 0 ms 348 KB OK (n = 100, answer = NO)
50 Correct 1 ms 348 KB OK (n = 100, answer = YES)
51 Correct 0 ms 348 KB OK (n = 100, answer = YES)
52 Correct 1 ms 348 KB OK (n = 100, answer = YES)
53 Correct 0 ms 348 KB OK (n = 100, answer = YES)
54 Correct 0 ms 348 KB OK (n = 100, answer = YES)
55 Correct 2 ms 520 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
60 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
61 Correct 1 ms 856 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 856 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
64 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 528 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 344 KB OK (n = 865, answer = YES)
73 Correct 1 ms 356 KB OK (n = 820, answer = YES)
74 Correct 1 ms 608 KB OK (n = 7500, answer = NO)
75 Correct 1 ms 608 KB OK (n = 10000, answer = NO)
76 Correct 1 ms 600 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
78 Correct 1 ms 604 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
80 Correct 1 ms 608 KB OK (n = 10000, answer = YES)
81 Correct 1 ms 608 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 608 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 720 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 608 KB OK (n = 10000, answer = YES)
88 Correct 1 ms 608 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 716 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 608 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 348 KB OK (n = 1, answer = YES)
95 Correct 0 ms 344 KB OK (n = 3, answer = YES)
96 Correct 0 ms 348 KB OK (n = 3, answer = NO)
97 Correct 0 ms 348 KB OK (n = 3, answer = YES)
98 Correct 15 ms 5840 KB OK (n = 150000, answer = NO)
99 Correct 29 ms 6600 KB OK (n = 200000, answer = YES)
100 Correct 32 ms 7120 KB OK (n = 200000, answer = NO)
101 Correct 34 ms 6852 KB OK (n = 200000, answer = YES)
102 Correct 36 ms 7112 KB OK (n = 200000, answer = YES)
103 Correct 24 ms 6608 KB OK (n = 200000, answer = YES)
104 Correct 23 ms 6308 KB OK (n = 200000, answer = YES)
105 Correct 26 ms 6596 KB OK (n = 200000, answer = NO)
106 Correct 47 ms 6492 KB OK (n = 200000, answer = YES)
107 Correct 38 ms 7344 KB OK (n = 200000, answer = NO)
108 Correct 23 ms 6592 KB OK (n = 200000, answer = NO)
109 Correct 22 ms 6596 KB OK (n = 200000, answer = NO)
110 Correct 21 ms 5956 KB OK (n = 200000, answer = YES)
111 Correct 17 ms 6096 KB OK (n = 200000, answer = YES)
112 Correct 23 ms 6088 KB OK (n = 200000, answer = YES)
113 Correct 19 ms 6204 KB OK (n = 200000, answer = YES)
114 Correct 22 ms 6340 KB OK (n = 200000, answer = YES)
115 Correct 19 ms 6352 KB OK (n = 200000, answer = YES)
116 Correct 17 ms 6096 KB OK (n = 200000, answer = YES)
117 Correct 19 ms 6092 KB OK (n = 200000, answer = YES)