oj.uz

답안 #1008919

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1008919 2024-06-27T05:18:26 Z Ausp3x Detecting Molecules (IOI16_molecules) C++17
100 / 100
 113 ms 4168 KB 
// 人外有人，天外有天
// author: Ausp3x

#pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
typedef long long             lng;
typedef unsigned int          uint;
typedef unsigned long long    ulng;
using namespace std;
using namespace __gnu_pbds;

int const INF32 = 0x3f3f3f3f;
lng const INF64 = 0x3f3f3f3f3f3f3f3f;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();

    if (u <= 10000 && n <= 10000) {
        vector<int> dp(u + 1, -1);
        for (int i = 0; i < n; i++)
            for (int j = u; j >= 0; j--) {
                if (j - w[i] < 0)
                    continue;

                if (j - w[i] == 0) {
                    if (dp[j] == -1)
                        dp[j] = i;
                    continue;
                }

                if (dp[j] != -1 || dp[j - w[i]] == -1)
                    continue;
                
                dp[j] = i;
            }

        // for (int i = 0; i <= u; i++)
        //     cout << dp[i] << ' ';
        // cout << endl;

        vector<int> ans;
        for (int i = l; i <= u; i++) {
            if (dp[i] == -1)
                continue;

            int ii = i;
            while (ii > 0) {
                ans.push_back(dp[ii]);
                ii -= w[dp[ii]];
            }

            break;
        }

        return ans;
    }

    vector<pair<int, int>> w_idxs;
    for (int i = 0; i < n; i++)
        w_idxs.push_back({w[i], i});
    
    sort(w_idxs.begin(), w_idxs.end());

    int lft = 0, rht = n;
    while (lft <= rht) {
        int md = (lft + rht) / 2;

        lng sum = 0;
        for (int i = 0; i < md; i++)
            sum += w_idxs[i].first;

        if (sum > u) {
            rht = md - 1;
            continue;
        }

        int j = n;
        while (sum < l && n - j < md && j > md) {
            j--;
            sum -= w_idxs[n - j - 1].first;
            sum += w_idxs[j].first;
        }

        if (sum < l) 
            lft = md + 1;
        else {
            vector<int> ans;
            for (int i = n - j; i < md; i++)
                ans.push_back(w_idxs[i].second);
            for (int i = j; i < n; i++)
                ans.push_back(w_idxs[i].second);

            return ans;
        }
    }

    return {};
}

/*
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    cin >> t;
    while (t--) {
        int l, u, n;
        cin >> l >> u >> n;
        vector<int> w(n);
        for (int &x : w)
            cin >> x;
        
        vector<int> ans = find_subset(l, u, w);

        cout << ans.size() << endl;
        for (int x : ans)
            cout << x << ' ';
        cout << endl;
    }

    return 0;
}
//*/

Compilation message

molecules.cpp:4:55: warning: bad option '-f O2' to pragma 'optimize' [-Wpragmas]
    4 | #pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
      |                                                       ^
molecules.cpp:4:55: warning: bad option '-f O3' to pragma 'optimize' [-Wpragmas]
molecules.cpp:4:55: warning: bad option '-f Ofast' to pragma 'optimize' [-Wpragmas]
molecules.cpp:4:55: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
molecules.cpp:16:52: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
   16 | vector<int> find_subset(int l, int u, vector<int> w) {
      |                                                    ^
molecules.cpp:16:52: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
molecules.cpp:16:52: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
molecules.cpp:16:52: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

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