oj.uz

답안 #416019

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
416019 2021-06-01T20:05:25 Z AugustinasJucas Detecting Molecules (IOI16_molecules) C++14
100 / 100
 75 ms 10116 KB 
#include <bits/stdc++.h>
using namespace std;
#include "molecules.h"

vector<int> find_subset(int l, int r, vector<int> w) {
    vector<pair<int, int> > deltas;
    vector<pair<int, int> > mas;
    for(int i = 0; i < w.size(); i++){
        mas.push_back({w[i], i});
    }
    sort(mas.begin(), mas.end());
    long long sm = 0;
    for(auto x : mas){
        deltas.push_back({x.first - mas[0].first, x.second});
        sm += x.first - mas[0].first;
    }
    sort(deltas.begin(), deltas.end());
    vector<long long> pref;
    for(auto x : deltas){
        pref.push_back((pref.size() ? pref.back() : 0ll) + x.first);
    }
//    cout << "skaiciai: "; for(auto x : deltas) cout << x.first << " "; 
//    cout <<endl;
    for(int i = 1; i <= (int) w.size(); i++){
        long long L = l - 1ll *  i * mas[0].first;
        long long R = r - 1ll * i * mas[0].first;

        // reikia i skaiciu, kad ju suma butu intervale [L; R];
        // pref[j] - pref[i-j]
//        cout << "reikia " << i << " skaiciu, kad ju suma butu intervale " << L << "; " << R << endl;
        if(pref[i-1] > R || pref[(int)pref.size() - 1] - ((int)pref.size()-1-i < 0 ? 0ll : pref[(int)pref.size()-1-i]) < L) continue;
  //      cout << "ce! " << endl;
        deque<int> ret1;
        vector<int> ret;
        long long cur = 0;
        for(int j = 0; j < i; j++){
            ret1.push_back(deltas[j].second);
            cur += deltas[j].first;
        }
//        cout << "CUR = " << cur << endl;
        if(L <= cur && cur <= R){
            for(auto x : ret1) ret.push_back(x);
            return ret;
        }
        for(int j = i; j < w.size(); j++){
            ret1.push_back(deltas[j].second);
            ret1.pop_front();
            cur -= deltas[j-i].first;
            cur += deltas[j].first;
            if(L <= cur && cur <= R){
                for(auto x : ret1) ret.push_back(x);
                return ret;
            }
            if(L <= cur && cur <= R){
                return ret;
            }
        }
        return {};
    }
    return {};
    
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:8:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for(int i = 0; i < w.size(); i++){
      |                    ~~^~~~~~~~~~
molecules.cpp:45:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for(int j = i; j < w.size(); j++){
      |                        ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 2 ms 292 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 2 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 308 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 1 ms 204 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 252 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 2 ms 296 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 204 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 204 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 2 ms 288 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 204 KB OK (n = 100, answer = YES)
55 Correct 5 ms 724 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 716 KB OK (n = 10000, answer = YES)
57 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
58 Correct 6 ms 716 KB OK (n = 10000, answer = YES)
59 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
63 Correct 4 ms 676 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 752 KB OK (n = 10000, answer = YES)
65 Correct 4 ms 688 KB OK (n = 10000, answer = YES)
66 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
67 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 744 KB OK (n = 10000, answer = YES)
69 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
71 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 332 KB OK (n = 865, answer = YES)
73 Correct 1 ms 332 KB OK (n = 820, answer = YES)
74 Correct 3 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
76 Correct 4 ms 736 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 684 KB OK (n = 10000, answer = NO)
78 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 688 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 716 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
82 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 684 KB OK (n = 10000, answer = YES)
85 Correct 4 ms 784 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 688 KB OK (n = 10000, answer = YES)
88 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 204 KB OK (n = 1, answer = YES)
95 Correct 1 ms 204 KB OK (n = 3, answer = YES)
96 Correct 1 ms 204 KB OK (n = 3, answer = NO)
97 Correct 1 ms 204 KB OK (n = 3, answer = YES)
98 Correct 45 ms 7636 KB OK (n = 150000, answer = NO)
99 Correct 64 ms 9628 KB OK (n = 200000, answer = YES)
100 Correct 66 ms 10096 KB OK (n = 200000, answer = NO)
101 Correct 67 ms 9424 KB OK (n = 200000, answer = YES)
102 Correct 71 ms 10072 KB OK (n = 200000, answer = YES)
103 Correct 67 ms 9632 KB OK (n = 200000, answer = YES)
104 Correct 63 ms 9368 KB OK (n = 200000, answer = YES)
105 Correct 58 ms 8800 KB OK (n = 200000, answer = NO)
106 Correct 66 ms 9272 KB OK (n = 200000, answer = YES)
107 Correct 75 ms 10116 KB OK (n = 200000, answer = NO)
108 Correct 59 ms 8824 KB OK (n = 200000, answer = NO)
109 Correct 59 ms 8756 KB OK (n = 200000, answer = NO)
110 Correct 54 ms 8952 KB OK (n = 200000, answer = YES)
111 Correct 48 ms 9124 KB OK (n = 200000, answer = YES)
112 Correct 46 ms 9148 KB OK (n = 200000, answer = YES)
113 Correct 47 ms 9244 KB OK (n = 200000, answer = YES)
114 Correct 49 ms 9240 KB OK (n = 200000, answer = YES)
115 Correct 48 ms 9244 KB OK (n = 200000, answer = YES)
116 Correct 55 ms 8988 KB OK (n = 200000, answer = YES)
117 Correct 58 ms 9012 KB OK (n = 200000, answer = YES)