oj.uz

답안 #928950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928950 2024-02-17T08:47:39 Z Foolestboy Detecting Molecules (IOI16_molecules) C++14
100 / 100
 42 ms 7276 KB 
#ifndef GNORT
#include "molecules.h"
#endif
#include <bits/stdc++.h>

#define SQR(x)    (1LL * ((x) * (x)))
#define MASK(i)   (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi        first
#define se        second
#define pb        push_back
#define all(x)    x.begin(), x.end()
#define rall(x)   x.rbegin(), x.rend()
#define sz(s)     (int)s.size()
#define prev      __prev
#define next      __next
#define left      __left
#define right     __right

#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;

using namespace std;

const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);

const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

template<class BUI, class TRONG>
    bool minimize(BUI &x, const TRONG y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class BUI, class TRONG>
    bool maximize(BUI &x, const TRONG y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }

/* Author : Bui Nguyen Duc Trong, Luong Van Chanh High School for the gifted*/
/* Template is copied by Trong */

                           /** Losing in Provincial Contests **/
                                    /** TRYING HARDER**/
                                   /**      ORZ     **/

/* -----------------[ MAIN CODE GOES HERE ]----------------- */

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vector<int> find_subset(int l, int u, vector<int> w){
    vector<int> ans;
    int n = sz(w);
    vector<pair<ll, int>> val(n);
    for(int i = 0; i < n; i++) val[i] = mp(w[i], i);
    sort(all(val));
    for(int i = 1; i < n; i++) val[i].fi += val[i - 1].fi;
    auto getRange = [&](int l, int r) -> ll{
        if(l == 0) return val[r].fi;
        return val[r].fi - val[l - 1].fi;
    };
    for(int i = 0; i < n; i++){
        int lo = 0, hi = i, p = -1;
        while(lo <= hi){
            int mid = (lo + hi) >> 1;
            if(getRange(mid, i) >= l){
                p = mid;
                lo = mid + 1;
            } else hi = mid - 1;
        }
        if(p != -1 && getRange(p, i) <= u){
            for(int j = p; j <= i; j++) ans.push_back(val[j].se);
            break;
        }
    }
    return ans;
}
/*
4 15 17
6 8 8 7
*/

#ifdef GNORT

void solve(){
    int n, l, u; cin >> n >> l >> u;
    vector<int> w(n);
    for(int i = 0; i < n; i++) cin >> w[i];
    vector<int> ans = find_subset(l, u, w);
    cout << sz(ans) << ": ";
    for(int x : ans) cout << x << ' '; cout << '\n';
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    const bool multitest = 0;
    int tt = 1; if(multitest) cin >> tt;

    while( tt-- ){

        solve();

    }

    return 0;
}
 #endif

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 1 ms 344 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Correct 0 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 1 ms 552 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 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 0 ms 344 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 424 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 344 KB OK (n = 12, answer = NO)
5 Correct 0 ms 344 KB OK (n = 12, answer = YES)
6 Correct 0 ms 348 KB OK (n = 12, answer = YES)
7 Correct 0 ms 440 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 0 ms 348 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 0 ms 348 KB OK (n = 100, answer = NO)
14 Correct 0 ms 440 KB OK (n = 100, answer = YES)
15 Correct 0 ms 440 KB OK (n = 100, answer = YES)
16 Correct 0 ms 436 KB OK (n = 100, answer = YES)
17 Correct 1 ms 344 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 348 KB OK (n = 1, answer = NO)
3 Correct 1 ms 344 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Correct 0 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 1 ms 552 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 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 0 ms 344 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 424 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 344 KB OK (n = 12, answer = NO)
24 Correct 0 ms 344 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 440 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 0 ms 348 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 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 440 KB OK (n = 100, answer = YES)
34 Correct 0 ms 440 KB OK (n = 100, answer = YES)
35 Correct 0 ms 436 KB OK (n = 100, answer = YES)
36 Correct 1 ms 344 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 1 ms 344 KB OK (n = 10, answer = YES)
43 Correct 0 ms 344 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 1 ms 348 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 348 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 440 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 348 KB OK (n = 1, answer = NO)
3 Correct 1 ms 344 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Correct 0 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 1 ms 552 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 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 0 ms 344 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 424 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 344 KB OK (n = 12, answer = NO)
24 Correct 0 ms 344 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 440 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 0 ms 348 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 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 440 KB OK (n = 100, answer = YES)
34 Correct 0 ms 440 KB OK (n = 100, answer = YES)
35 Correct 0 ms 436 KB OK (n = 100, answer = YES)
36 Correct 1 ms 344 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 1 ms 344 KB OK (n = 10, answer = YES)
43 Correct 0 ms 344 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 1 ms 348 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 348 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 440 KB OK (n = 100, answer = YES)
55 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 704 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 708 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 508 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 348 KB OK (n = 865, answer = YES)
73 Correct 1 ms 600 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 348 KB OK (n = 1, answer = NO)
3 Correct 1 ms 344 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Correct 0 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 1 ms 552 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 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 0 ms 344 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 424 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 344 KB OK (n = 12, answer = NO)
24 Correct 0 ms 344 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 440 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 0 ms 348 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 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 440 KB OK (n = 100, answer = YES)
34 Correct 0 ms 440 KB OK (n = 100, answer = YES)
35 Correct 0 ms 436 KB OK (n = 100, answer = YES)
36 Correct 1 ms 344 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 1 ms 344 KB OK (n = 10, answer = YES)
43 Correct 0 ms 344 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 1 ms 348 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 348 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 440 KB OK (n = 100, answer = YES)
55 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 704 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 708 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 508 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 348 KB OK (n = 865, answer = YES)
73 Correct 1 ms 600 KB OK (n = 820, answer = YES)
74 Correct 1 ms 600 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 600 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
81 Correct 2 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 604 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 516 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 608 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 348 KB OK (n = 1, answer = NO)
3 Correct 1 ms 344 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Correct 0 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 1 ms 552 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 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 0 ms 344 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 424 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 344 KB OK (n = 12, answer = NO)
24 Correct 0 ms 344 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 440 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 0 ms 348 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 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 440 KB OK (n = 100, answer = YES)
34 Correct 0 ms 440 KB OK (n = 100, answer = YES)
35 Correct 0 ms 436 KB OK (n = 100, answer = YES)
36 Correct 1 ms 344 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 1 ms 344 KB OK (n = 10, answer = YES)
43 Correct 0 ms 344 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 1 ms 348 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 348 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 440 KB OK (n = 100, answer = YES)
55 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 704 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 708 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 508 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 348 KB OK (n = 865, answer = YES)
73 Correct 1 ms 600 KB OK (n = 820, answer = YES)
74 Correct 1 ms 600 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 600 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
81 Correct 2 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 604 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 516 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 608 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 348 KB OK (n = 3, answer = YES)
96 Correct 0 ms 348 KB OK (n = 3, answer = NO)
97 Correct 0 ms 352 KB OK (n = 3, answer = YES)
98 Correct 27 ms 4788 KB OK (n = 150000, answer = NO)
99 Correct 35 ms 6488 KB OK (n = 200000, answer = YES)
100 Correct 41 ms 7276 KB OK (n = 200000, answer = NO)
101 Correct 35 ms 6492 KB OK (n = 200000, answer = YES)
102 Correct 34 ms 7008 KB OK (n = 200000, answer = YES)
103 Correct 34 ms 6488 KB OK (n = 200000, answer = YES)
104 Correct 36 ms 6560 KB OK (n = 200000, answer = YES)
105 Correct 35 ms 5700 KB OK (n = 200000, answer = NO)
106 Correct 42 ms 6480 KB OK (n = 200000, answer = YES)
107 Correct 38 ms 7260 KB OK (n = 200000, answer = NO)
108 Correct 37 ms 5724 KB OK (n = 200000, answer = NO)
109 Correct 35 ms 5724 KB OK (n = 200000, answer = NO)
110 Correct 27 ms 5980 KB OK (n = 200000, answer = YES)
111 Correct 21 ms 6232 KB OK (n = 200000, answer = YES)
112 Correct 24 ms 5980 KB OK (n = 200000, answer = YES)
113 Correct 21 ms 6320 KB OK (n = 200000, answer = YES)
114 Correct 25 ms 6212 KB OK (n = 200000, answer = YES)
115 Correct 26 ms 6232 KB OK (n = 200000, answer = YES)
116 Correct 33 ms 5976 KB OK (n = 200000, answer = YES)
117 Correct 29 ms 5976 KB OK (n = 200000, answer = YES)