oj.uz

답안 #622725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
622725 2022-08-04T13:51:13 Z SAAD Detecting Molecules (IOI16_molecules) C++17
100 / 100
 82 ms 7264 KB 
#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#include "molecules.h"
ll cm[(int)(2*1e5) + 5];
vector<int> find_subset(int l, int u, vector<int> w) {
    vii s;
    vi res;
    for (int i = 0; i < w.size(); i++) {
        s.push_back({ w[i],i });
    }
    sort(s.begin(), s.end());
    ll sum = 0 ;
    for (int i = 0; i < s.size(); i++) {
        sum += s[i].first;
        cm[i] = sum;
    }
    for (int i = 1; i <= s.size(); i++) {
        ll mn = cm[i-1] , mx = cm[s.size()-1] - (s.size() - i - 1 >=0?cm[s.size()-i-1]:0) ;
        if (mn > u || mx < l) continue;
        int k = i , le = 0 , r = i-1 ;
        sum = mn;
        while (r < s.size()) {
            ll num = cm[r] - (le - 1 >= 0 ? cm[le - 1] : 0);
            if ( num >= l && num <= u) {
                for (int j = le; j <= r; j++) {
                    res.push_back(s[j].second);
                }
                break;
            }
            if (r == s.size() - 1) break;
            le++;
            r++;
        }
        if (!res.empty()) break;
    }
    return res;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < w.size(); i++) {
      |                     ~~^~~~~~~~~~
molecules.cpp:36:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
molecules.cpp:40:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for (int i = 1; i <= s.size(); i++) {
      |                     ~~^~~~~~~~~~~
molecules.cpp:45:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         while (r < s.size()) {
      |                ~~^~~~~~~~~~
molecules.cpp:53:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |             if (r == s.size() - 1) break;
      |                 ~~^~~~~~~~~~~~~~~
molecules.cpp:43:13: warning: unused variable 'k' [-Wunused-variable]
   43 |         int k = i , le = 0 , r = i-1 ;
      |             ^

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 232 KB OK (n = 1, answer = NO)
3 Correct 1 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 0 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 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 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 0 ms 308 KB OK (n = 12, answer = YES)
3 Correct 0 ms 212 KB OK (n = 12, answer = NO)
4 Correct 1 ms 316 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 0 ms 212 KB OK (n = 12, answer = YES)
8 Correct 0 ms 212 KB OK (n = 12, answer = YES)
9 Correct 0 ms 212 KB OK (n = 6, answer = YES)
10 Correct 0 ms 212 KB OK (n = 12, answer = YES)
11 Correct 1 ms 212 KB OK (n = 100, answer = NO)
12 Correct 1 ms 312 KB OK (n = 100, answer = YES)
13 Correct 1 ms 212 KB OK (n = 100, answer = NO)
14 Correct 1 ms 212 KB OK (n = 100, answer = YES)
15 Correct 1 ms 308 KB OK (n = 100, answer = YES)
16 Correct 1 ms 308 KB OK (n = 100, answer = YES)
17 Correct 1 ms 312 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 232 KB OK (n = 1, answer = NO)
3 Correct 1 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 0 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 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 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 0 ms 308 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 316 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 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 312 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 308 KB OK (n = 100, answer = YES)
35 Correct 1 ms 308 KB OK (n = 100, answer = YES)
36 Correct 1 ms 312 KB OK (n = 100, answer = YES)
37 Correct 1 ms 308 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 308 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 308 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 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 308 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 308 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 312 KB OK (n = 100, answer = YES)
54 Correct 1 ms 308 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 232 KB OK (n = 1, answer = NO)
3 Correct 1 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 0 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 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 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 0 ms 308 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 316 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 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 312 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 308 KB OK (n = 100, answer = YES)
35 Correct 1 ms 308 KB OK (n = 100, answer = YES)
36 Correct 1 ms 312 KB OK (n = 100, answer = YES)
37 Correct 1 ms 308 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 308 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 308 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 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 308 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 308 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 312 KB OK (n = 100, answer = YES)
54 Correct 1 ms 308 KB OK (n = 100, answer = YES)
55 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 724 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 708 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 704 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 708 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 644 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 704 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
72 Correct 1 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 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 232 KB OK (n = 1, answer = NO)
3 Correct 1 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 0 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 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 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 0 ms 308 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 316 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 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 312 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 308 KB OK (n = 100, answer = YES)
35 Correct 1 ms 308 KB OK (n = 100, answer = YES)
36 Correct 1 ms 312 KB OK (n = 100, answer = YES)
37 Correct 1 ms 308 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 308 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 308 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 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 308 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 308 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 312 KB OK (n = 100, answer = YES)
54 Correct 1 ms 308 KB OK (n = 100, answer = YES)
55 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 724 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 708 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 704 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 708 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 644 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 704 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 340 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)
74 Correct 2 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 704 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 724 KB OK (n = 10000, answer = YES)
82 Correct 2 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 4 ms 644 KB OK (n = 10000, answer = YES)
88 Correct 4 ms 724 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 644 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 644 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 232 KB OK (n = 1, answer = NO)
3 Correct 1 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 0 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 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 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 0 ms 308 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 316 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 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 312 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 308 KB OK (n = 100, answer = YES)
35 Correct 1 ms 308 KB OK (n = 100, answer = YES)
36 Correct 1 ms 312 KB OK (n = 100, answer = YES)
37 Correct 1 ms 308 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 308 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 308 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 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 308 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 308 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 312 KB OK (n = 100, answer = YES)
54 Correct 1 ms 308 KB OK (n = 100, answer = YES)
55 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 724 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 708 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 704 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 708 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 644 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 704 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 340 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)
74 Correct 2 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 704 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 724 KB OK (n = 10000, answer = YES)
82 Correct 2 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 4 ms 644 KB OK (n = 10000, answer = YES)
88 Correct 4 ms 724 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 644 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 212 KB OK (n = 1, answer = YES)
95 Correct 1 ms 212 KB OK (n = 3, answer = YES)
96 Correct 1 ms 212 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 32 ms 4748 KB OK (n = 150000, answer = NO)
99 Correct 45 ms 6576 KB OK (n = 200000, answer = YES)
100 Correct 82 ms 7228 KB OK (n = 200000, answer = NO)
101 Correct 43 ms 6460 KB OK (n = 200000, answer = YES)
102 Correct 57 ms 7072 KB OK (n = 200000, answer = YES)
103 Correct 43 ms 6680 KB OK (n = 200000, answer = YES)
104 Correct 40 ms 6424 KB OK (n = 200000, answer = YES)
105 Correct 36 ms 5880 KB OK (n = 200000, answer = NO)
106 Correct 42 ms 6428 KB OK (n = 200000, answer = YES)
107 Correct 43 ms 7264 KB OK (n = 200000, answer = NO)
108 Correct 40 ms 5892 KB OK (n = 200000, answer = NO)
109 Correct 38 ms 5820 KB OK (n = 200000, answer = NO)
110 Correct 33 ms 6104 KB OK (n = 200000, answer = YES)
111 Correct 31 ms 6300 KB OK (n = 200000, answer = YES)
112 Correct 31 ms 6076 KB OK (n = 200000, answer = YES)
113 Correct 28 ms 6204 KB OK (n = 200000, answer = YES)
114 Correct 28 ms 6188 KB OK (n = 200000, answer = YES)
115 Correct 36 ms 6284 KB OK (n = 200000, answer = YES)
116 Correct 33 ms 6056 KB OK (n = 200000, answer = YES)
117 Correct 35 ms 6032 KB OK (n = 200000, answer = YES)