oj.uz

답안 #500589

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500589 2021-12-31T13:14:09 Z InternetPerson10 Detecting Molecules (IOI16_molecules) C++17
100 / 100
 50 ms 6716 KB 
#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector<pair<int, int>> ps;
vector<int> ans;
vector<ll> s, p;

vector<int> find_subset(int l, int u, std::vector<int> w) {
    ll x = 0, g = -1;
    ps.resize(w.size());
    for(int i = 0; i < w.size(); i++)  {
        ps[i] = {w[i], i};
    }
    sort(ps.begin(), ps.end());
    for(int i = 0; i < w.size(); i++) {
        w[i] = ps[i].first;
    }
    s.resize(w.size());
    p.resize(w.size());
    for(int i = 0; i < w.size(); i++) {
        if(i == 0) s[i] = w[i];
        else s[i] = s[i-1] + w[i];
    }
    for(int i = w.size() - 1; i >= 0; i--) {
        if(i == w.size() - 1) p[w.size() - 1 - i] = w[i];
        else p[w.size() - 1 - i] = p[w.size() - 2 - i] + w[i];
    }
    for(int i = 0; i < w.size(); i++) {
        if(max((ll)l, s[i]) <= min((ll)u, p[i])) {
            ans.resize(i+1);
            for(int j = 0; j <= i; j++) ans[j] = j;
            for(int j = 0; j <= i; j++) x += (ll)w[j];
            g = i;
            while(x < l) {
                x -= w[ans[g]];
                ans[g] = (g - i) + w.size() - 1;
                x += w[ans[g]];
                g--;
            }
            for(int j = 0; j <= i; j++) ans[j] = ps[ans[j]].second;
            return ans;
        }
    }
    return vector<int>(0);
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:15:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i = 0; i < w.size(); i++)  {
      |                    ~~^~~~~~~~~~
molecules.cpp:19:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i = 0; i < w.size(); i++) {
      |                    ~~^~~~~~~~~~
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++) {
      |                    ~~^~~~~~~~~~
molecules.cpp:29:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         if(i == w.size() - 1) p[w.size() - 1 - i] = w[i];
      |            ~~^~~~~~~~~~~~~~~
molecules.cpp:32:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(int i = 0; i < w.size(); i++) {
      |                    ~~^~~~~~~~~~

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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 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 0 ms 204 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 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 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 0 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 204 KB OK (n = 12, answer = YES)
7 Correct 0 ms 204 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 0 ms 204 KB OK (n = 12, answer = YES)
11 Correct 0 ms 204 KB OK (n = 100, answer = NO)
12 Correct 0 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 204 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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 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 0 ms 204 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 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 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 0 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 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 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 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 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 204 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 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 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 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 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 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 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 0 ms 204 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 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 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 0 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 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 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 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 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 204 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 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 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 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 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 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 588 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 588 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 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 0 ms 204 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 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 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 0 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 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 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 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 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 204 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 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 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 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 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 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 588 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 588 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 1 ms 460 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 520 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 588 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 588 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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 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 0 ms 204 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 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 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 0 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 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 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 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 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 204 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 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 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 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 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 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 588 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 588 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 1 ms 460 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 520 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 588 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 588 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 204 KB OK (n = 1, answer = YES)
95 Correct 1 ms 204 KB OK (n = 3, answer = YES)
96 Correct 0 ms 204 KB OK (n = 3, answer = NO)
97 Correct 0 ms 204 KB OK (n = 3, answer = YES)
98 Correct 29 ms 4952 KB OK (n = 150000, answer = NO)
99 Correct 50 ms 6468 KB OK (n = 200000, answer = YES)
100 Correct 44 ms 6584 KB OK (n = 200000, answer = NO)
101 Correct 45 ms 6684 KB OK (n = 200000, answer = YES)
102 Correct 43 ms 6452 KB OK (n = 200000, answer = YES)
103 Correct 40 ms 6460 KB OK (n = 200000, answer = YES)
104 Correct 38 ms 6540 KB OK (n = 200000, answer = YES)
105 Correct 38 ms 6504 KB OK (n = 200000, answer = NO)
106 Correct 45 ms 6716 KB OK (n = 200000, answer = YES)
107 Correct 41 ms 6452 KB OK (n = 200000, answer = NO)
108 Correct 47 ms 6448 KB OK (n = 200000, answer = NO)
109 Correct 36 ms 6508 KB OK (n = 200000, answer = NO)
110 Correct 31 ms 6476 KB OK (n = 200000, answer = YES)
111 Correct 25 ms 6568 KB OK (n = 200000, answer = YES)
112 Correct 24 ms 6512 KB OK (n = 200000, answer = YES)
113 Correct 28 ms 6640 KB OK (n = 200000, answer = YES)
114 Correct 26 ms 6584 KB OK (n = 200000, answer = YES)
115 Correct 25 ms 6604 KB OK (n = 200000, answer = YES)
116 Correct 32 ms 6500 KB OK (n = 200000, answer = YES)
117 Correct 36 ms 6468 KB OK (n = 200000, answer = YES)