oj.uz

답안 #500722

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500722 2021-12-31T22:15:26 Z aryan12 Detecting Molecules (IOI16_molecules) C++17
100 / 100
 51 ms 8204 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
    return a.first < b.first;
}

vector<int> find_subset(int l, int r, vector<int> w) {
    vector<pair<long long, long long> > a;
    for(long long i = 0; i < w.size(); i++) {
        a.push_back(make_pair(w[i], i));
    }
    sort(a.begin(), a.end(), cmp);
    long long left = 0, right = 0, sum = a[0].first;
    for(long long i = 1; i < a.size(); i++) {
        sum += a[i].first;
        if(sum > r) {
            break;
        }
        right = i;
    }
    vector<int> ans;
    if(sum >= l && sum <= r) {
        for(long long i = 0; i <= right; i++) {
            ans.push_back(a[i].second);
        }
    }
    else {
        int f = 0;
        sum = 0;
        left = 0, right = -1;
        int x = a.size() - 1;
        for(left = 0; left < a.size(); left++) {
            if(left != 0) sum -= a[left - 1].first;
            //cout << "right = " << right << ", a.size() - 1 = " << a.size() - 1 << ", sum + a[right + 1].first = " << sum + a[right + 1].first << ", r = " << r << "\n";
            while(right < x && sum + a[right + 1].first <= r) {
                //cout << "party all night\n";
                right++;
                sum += a[right].first;
            }
            //cout << "left = " << left << ", right = " << right << "\n";
            if(sum >= l && sum <= r) {
                f = 1;
                break;
            }
        }
        if(f == 1) {
            for(long long i = left; i <= right; i++) {
                ans.push_back(a[i].second);
            }
        }
    }
    return ans;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:11:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for(long long i = 0; i < w.size(); i++) {
      |                          ~~^~~~~~~~~~
molecules.cpp:16:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(long long i = 1; i < a.size(); i++) {
      |                          ~~^~~~~~~~~~
molecules.cpp:34:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for(left = 0; left < a.size(); left++) {
      |                       ~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 1 ms 308 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 216 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 1 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 292 KB OK (n = 12, answer = YES)
26 Correct 1 ms 296 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 292 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 0 ms 292 KB OK (n = 100, answer = YES)
35 Correct 0 ms 204 KB OK (n = 100, answer = YES)
36 Correct 0 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 292 KB OK (n = 27, answer = YES)
39 Correct 0 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 0 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 288 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 292 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 0 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 296 KB OK (n = 100, answer = YES)
53 Correct 0 ms 292 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 688 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 744 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 764 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 692 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 744 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 292 KB OK (n = 820, answer = YES)
74 Correct 1 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 740 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 760 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 812 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 808 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 752 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 812 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 756 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 688 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 204 KB OK (n = 1, answer = YES)
95 Correct 0 ms 204 KB OK (n = 3, answer = YES)
96 Correct 0 ms 204 KB OK (n = 3, answer = NO)
97 Correct 1 ms 204 KB OK (n = 3, answer = YES)
98 Correct 33 ms 6464 KB OK (n = 150000, answer = NO)
99 Correct 37 ms 7576 KB OK (n = 200000, answer = YES)
100 Correct 42 ms 8204 KB OK (n = 200000, answer = NO)
101 Correct 38 ms 7432 KB OK (n = 200000, answer = YES)
102 Correct 47 ms 8072 KB OK (n = 200000, answer = YES)
103 Correct 32 ms 7576 KB OK (n = 200000, answer = YES)
104 Correct 32 ms 7432 KB OK (n = 200000, answer = YES)
105 Correct 34 ms 6812 KB OK (n = 200000, answer = NO)
106 Correct 47 ms 7348 KB OK (n = 200000, answer = YES)
107 Correct 51 ms 8204 KB OK (n = 200000, answer = NO)
108 Correct 30 ms 6804 KB OK (n = 200000, answer = NO)
109 Correct 30 ms 6804 KB OK (n = 200000, answer = NO)
110 Correct 29 ms 7064 KB OK (n = 200000, answer = YES)
111 Correct 27 ms 7192 KB OK (n = 200000, answer = YES)
112 Correct 30 ms 7064 KB OK (n = 200000, answer = YES)
113 Correct 28 ms 7180 KB OK (n = 200000, answer = YES)
114 Correct 29 ms 7212 KB OK (n = 200000, answer = YES)
115 Correct 28 ms 7176 KB OK (n = 200000, answer = YES)
116 Correct 26 ms 7064 KB OK (n = 200000, answer = YES)
117 Correct 26 ms 7036 KB OK (n = 200000, answer = YES)