oj.uz

답안 #524285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524285 2022-02-09T01:59:38 Z cqtshadow Detecting Molecules (IOI16_molecules) C++14
100 / 100
 44 ms 4604 KB 
#include <bits/stdc++.h>
#define MASK(x) (1LL << x)
#define GETBIT(mask, x) ((mask >> (x))&1)
#define ONBIT(mask, x) (mask | (1LL << (x)))
#define Each(type, i, a, b) for(type i = (a) ; i <= (b) ; ++i)
#define REach(type, i, a, b) for(type i = (a) ; i >= (b) ; --i)
using namespace std;

typedef long long ll;

const int N = 2e5 + 7;
const int MOD = 1e9 + 7;
const int INF = 2e9;
const double eps = 1e-9;
const ll oo = 4e18;

template<class X> bool maximize(X &x, X y) {return (x + eps < y ? x = y, true : false);}
template<class X> bool minimize(X &x, X y) {return (x > y + eps ? x = y, true : false);}

void add(int &x, int y) {x += y; if(x >= MOD) x -= MOD;}
void sub(int &x, int y) {x -= y; if(x < 0) x += MOD;}
int radd(int x, int y) {add(x, y); return x;}
int rsub(int x, int y) {sub(x, y); return x;}

string to2(int val) {bitset<10> temp(val); return temp.to_string();}

int n;

namespace SUB1 {
    vector<int> solve(int l, int u, vector<int> w) {
        vector<int> result(0);
        int sum = 0;
        while(result.size() < n && sum < l) {
            result.push_back(result.size());
            sum += w[0];
        }
        if(sum > u || sum < l) return vector<int>(0);
        return result;
    }
}

namespace SUB4 {
    bool f[10003];
    int id[10003];

    vector<int> solve(int l, int u, vector<int> w) {
        vector<int> result;
        f[0] = 1;
        Each(int, i, 0, n - 1) {
            REach(int, wei, u, w[i])
                if(f[wei - w[i]] && !f[wei]) {
                    f[wei] = 1;
                    id[wei] = i;
                    if(l <= wei && wei <= u) {
                        int cur = wei;
                        while(cur > 0) {
                            result.push_back(id[cur]);
                            cur -= w[id[cur]];
                        }
                        return result;
                    }
                }
        }
        return vector<int>(0);
    }
}

namespace SUB6 {
    vector<int> solve(int l, int u, vector<int> w) {
        vector<int> result;
        vector<pair<int, int>> a(n, pair<int, int>());

        Each(int, i, 0, n - 1) a[i] = {w[i], i};
        sort(a.begin(), a.end());

        int tl = 0, ansl = 0, ansr = 0;
        bool ok = false;
        ll sum = 0;
        Each(int, tr, 0, n - 1) {
            sum += a[tr].first;
            while(sum > u && tl < tr) {
                sum -= a[tl].first;
                tl++;
            }
            if(l <= sum && sum <= u) {
                ansl = tl;
                ansr = tr;
                ok = true;
                break;
            }
        }
        if(!ok) return vector<int>(0);
        Each(int, i, ansl, ansr) {
            result.push_back(a[i].second);
        }
        return result;
    }
}

vector<int> find_subset(int l, int u, vector<int> w) {
    n = w.size();
    int wmax = -1;
    bool isequal = true; int ele = w[0];

    for(int x : w) {
        maximize(wmax, x);
        isequal &= (ele == x);
    }

    if(n <= 100 && wmax <= 100 && l <= 1000 && isequal)
        return SUB1::solve(l, u, w);

    if(n <= 10000 && l <= 10000)
        return SUB4::solve(l, u, w);

    return SUB6::solve(l, u, w);
}

Compilation message

molecules.cpp: In function 'std::vector<int> SUB1::solve(int, int, std::vector<int>)':
molecules.cpp:33:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |         while(result.size() < n && sum < l) {
      |               ~~~~~~~~~~~~~~^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 296 KB OK (n = 1, answer = NO)
2 Correct 0 ms 292 KB OK (n = 1, answer = NO)
3 Correct 0 ms 208 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 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 296 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 292 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 292 KB OK (n = 12, answer = NO)
5 Correct 0 ms 204 KB OK (n = 12, answer = YES)
6 Correct 1 ms 296 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 1 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 1 ms 292 KB OK (n = 100, answer = NO)
14 Correct 0 ms 204 KB OK (n = 100, answer = YES)
15 Correct 1 ms 204 KB OK (n = 100, answer = YES)
16 Correct 1 ms 296 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 296 KB OK (n = 1, answer = NO)
2 Correct 0 ms 292 KB OK (n = 1, answer = NO)
3 Correct 0 ms 208 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 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 296 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 292 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 292 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 296 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 1 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 1 ms 292 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 296 KB OK (n = 100, answer = YES)
36 Correct 0 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 304 KB OK (n = 28, answer = YES)
38 Correct 1 ms 292 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 296 KB OK (n = 100, answer = YES)
41 Correct 1 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 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 296 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 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 1 ms 288 KB OK (n = 100, answer = YES)
52 Correct 0 ms 292 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 296 KB OK (n = 1, answer = NO)
2 Correct 0 ms 292 KB OK (n = 1, answer = NO)
3 Correct 0 ms 208 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 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 296 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 292 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 292 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 296 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 1 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 1 ms 292 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 296 KB OK (n = 100, answer = YES)
36 Correct 0 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 304 KB OK (n = 28, answer = YES)
38 Correct 1 ms 292 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 296 KB OK (n = 100, answer = YES)
41 Correct 1 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 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 296 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 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 1 ms 288 KB OK (n = 100, answer = YES)
52 Correct 0 ms 292 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 6 ms 464 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 388 KB OK (n = 10000, answer = YES)
58 Correct 1 ms 376 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
60 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
61 Correct 34 ms 460 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 460 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 432 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
70 Correct 31 ms 460 KB OK (n = 10000, answer = YES)
71 Correct 30 ms 460 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 332 KB OK (n = 865, answer = YES)
73 Correct 5 ms 296 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 296 KB OK (n = 1, answer = NO)
2 Correct 0 ms 292 KB OK (n = 1, answer = NO)
3 Correct 0 ms 208 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 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 296 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 292 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 292 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 296 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 1 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 1 ms 292 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 296 KB OK (n = 100, answer = YES)
36 Correct 0 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 304 KB OK (n = 28, answer = YES)
38 Correct 1 ms 292 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 296 KB OK (n = 100, answer = YES)
41 Correct 1 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 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 296 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 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 1 ms 288 KB OK (n = 100, answer = YES)
52 Correct 0 ms 292 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 6 ms 464 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 388 KB OK (n = 10000, answer = YES)
58 Correct 1 ms 376 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
60 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
61 Correct 34 ms 460 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 460 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 432 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
70 Correct 31 ms 460 KB OK (n = 10000, answer = YES)
71 Correct 30 ms 460 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 332 KB OK (n = 865, answer = YES)
73 Correct 5 ms 296 KB OK (n = 820, answer = YES)
74 Correct 2 ms 460 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 424 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 460 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 460 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
85 Correct 1 ms 440 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 560 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 496 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 432 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 460 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 296 KB OK (n = 1, answer = NO)
2 Correct 0 ms 292 KB OK (n = 1, answer = NO)
3 Correct 0 ms 208 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 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 296 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 292 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 292 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 296 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 1 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 1 ms 292 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 296 KB OK (n = 100, answer = YES)
36 Correct 0 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 304 KB OK (n = 28, answer = YES)
38 Correct 1 ms 292 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 296 KB OK (n = 100, answer = YES)
41 Correct 1 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 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 296 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 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 1 ms 288 KB OK (n = 100, answer = YES)
52 Correct 0 ms 292 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 6 ms 464 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 388 KB OK (n = 10000, answer = YES)
58 Correct 1 ms 376 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
60 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
61 Correct 34 ms 460 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 460 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 432 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
70 Correct 31 ms 460 KB OK (n = 10000, answer = YES)
71 Correct 30 ms 460 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 332 KB OK (n = 865, answer = YES)
73 Correct 5 ms 296 KB OK (n = 820, answer = YES)
74 Correct 2 ms 460 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 424 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 460 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 460 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
85 Correct 1 ms 440 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 560 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 496 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 432 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 204 KB OK (n = 1, answer = YES)
95 Correct 0 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 28 ms 3392 KB OK (n = 150000, answer = NO)
99 Correct 38 ms 4456 KB OK (n = 200000, answer = YES)
100 Correct 42 ms 4420 KB OK (n = 200000, answer = NO)
101 Correct 43 ms 4580 KB OK (n = 200000, answer = YES)
102 Correct 42 ms 4420 KB OK (n = 200000, answer = YES)
103 Correct 41 ms 4464 KB OK (n = 200000, answer = YES)
104 Correct 44 ms 4372 KB OK (n = 200000, answer = YES)
105 Correct 37 ms 4300 KB OK (n = 200000, answer = NO)
106 Correct 41 ms 4604 KB OK (n = 200000, answer = YES)
107 Correct 41 ms 4452 KB OK (n = 200000, answer = NO)
108 Correct 36 ms 4276 KB OK (n = 200000, answer = NO)
109 Correct 38 ms 4404 KB OK (n = 200000, answer = NO)
110 Correct 31 ms 4324 KB OK (n = 200000, answer = YES)
111 Correct 25 ms 4340 KB OK (n = 200000, answer = YES)
112 Correct 23 ms 4340 KB OK (n = 200000, answer = YES)
113 Correct 25 ms 4512 KB OK (n = 200000, answer = YES)
114 Correct 25 ms 4520 KB OK (n = 200000, answer = YES)
115 Correct 26 ms 4472 KB OK (n = 200000, answer = YES)
116 Correct 32 ms 4348 KB OK (n = 200000, answer = YES)
117 Correct 33 ms 4328 KB OK (n = 200000, answer = YES)