oj.uz

답안 #746309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
746309 2023-05-22T09:40:17 Z Sami_Massah Detecting Molecules (IOI16_molecules) C++17
100 / 100
 57 ms 7740 KB 
#include <bits/stdc++.h>
using namespace std;


const long long maxn = 2e5 + 12, mod = 998244353, inf = 1e9 + 12 ;
long long mn[200000 + 12], mx[200000 + 12];
vector <int> ans, f;
vector <pair<int, int>> a2;

vector <int> find_subset(int l, int u, vector <int> w){

    int n = w.size();
    for(int i = 0; i < n; i++)
        a2.push_back(make_pair(w[i], i));
    sort(a2.begin(), a2.end());
    mn[0] = a2[0].first;
    for(int i = 1; i < n; i++)
        mn[i] = mn[i - 1] + a2[i].first;
    mx[n - 1] = a2[n - 1].first;
    for(int i = n - 2; i >= 0; i--)
        mx[i] = mx[i + 1] + a2[i].first;
    for(int i = 1; i <= n; i++){
    //    cout << mn[i - 1] << ' ' << mx[n - i] << endl;
        if(mn[i - 1] <= u && l <= mx[n - i]){
      //      cout << i << endl;
            long long sum = mx[n - i];
            for(int j = n - i; j < n; j++)
                ans.push_back(j);
            int loc = 0;
            while(sum < l || sum > u){
                if(ans[loc] == loc){
                    loc += 1;
                }
                else{
                    int now = ans[loc];
                    long long sum2 = sum - a2[now].first + a2[loc].first;
                    if(sum2 > u){
                        sum = sum2;
                        ans[loc] = loc;
                        loc += 1;

                    }
                    else{
                        sum = sum - a2[now].first + a2[now - 1].first;
                        ans[loc] -= 1;
                    }
                }
            }
            for(int j = 0; j < ans.size(); j++){
                //cout << ans[j] << endl;
                ans[j] = a2[ans[j]].second;

                }
          //  cout << endl;
            return ans;

        }

    }
    return ans;



}
/*
int main(){
    vector <int> f;
    int n, l, r;
    cin >> n >> l >> r;
    for(int i = 0; i < n; i++){
        int a;
        cin >> a;
        f.push_back(a);

    }
    vector <int> nat = find_subset(l, r, f);
    for(int i: nat)
        cout << i << ' ';


}

*/

Compilation message

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

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

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