oj.uz

답안 #242466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242466 2020-06-27T18:41:23 Z WhaleVomit Detecting Molecules (IOI16_molecules) C++14
100 / 100
 70 ms 5356 KB 
#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()

#define MOO(i, a, b) for(int i=a; i<b; i++)
#define M00(i, a) for(int i=0; i<a; i++)
#define MOOd(i,a,b) for(int i = (b)-1; i >= a; i--)
#define M00d(i,a) for(int i = (a)-1; i>=0; i--)

#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << '\n', 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << "\n";
#define _ << " _ " <<

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;

vi find_subset(int l, int u, vi w) {
    vi ws;
    for(int x: w) ws.pb(x);
    sort(all(ws));
    ll least = 0;
    ll most = 0;
    vi res;
    for(int cnt = 1; cnt <= sz(ws); cnt++) {
        least += ws[cnt-1];
        most += ws[sz(ws)-cnt];
        if(l <= least && least <= u) {
            for(int j = 0; j < cnt; j++) {
                res.pb(ws[j]);
            }
            break;
        } else if(l <= most && most <= u) {
            for(int j = sz(ws)-cnt; j < sz(ws); j++) {
                res.pb(ws[j]);
            }
            break;
        } else if(least < l && u < most) {
            ll tot = least;
            int idx = 0;
            while(tot < l) {
                tot -= ws[cnt-1-idx];
                tot += ws[sz(ws)-1-idx];
                idx++;
            }
            for(int j = 0; j < cnt-idx; j++) {
                res.pb(ws[j]);
            }
            for(int j = sz(ws)-1; j >= sz(ws)-idx; j--) {
                res.pb(ws[j]);
            }
            break;
        }
    }
    if(sz(res) == 0) return res;
    int cnt = 0;
    for(int x: res) cnt += x;
    assert(l <= cnt && cnt <= u);
    multiset<int> inAns;
    for(int x: res) inAns.insert(x);
    vi ans;
    M00(i, sz(w)) {
        if(inAns.count(w[i])) {
            ans.pb(i);
            inAns.erase(inAns.find(w[i]));
        }
    }
    return ans;
}

/*int main() { FAST
    int l, u; cin >> l >> u;
    int n; cin >> n;
    vi v; M00(i, n) {
        int x; cin >> x;
        v.pb(x);
    }
    vi ans = find_subset(l,u,v);
    for(int i: ans) cout << i << " "; cout << "\n";
}*/

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

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