oj.uz

답안 #307756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
307756 2020-09-29T09:26:49 Z lohacho Detecting Molecules (IOI16_molecules) C++14
69 / 100
 48 ms 10216 KB 
#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

using LL = long long;
const LL INF = (LL)1e9 + 7;
const LL NS = (LL)1e5 + 4;
LL lsum[NS], rsum[NS];
vector <int> ans;
vector <pair<LL, LL>>srt;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    for(LL i = 0; i < (LL)w.size(); ++i){
        srt.push_back(make_pair(w[i], i));
    }
    LL N = (LL)srt.size();
    sort(srt.begin(), srt.end());
    for(LL i = 0; i < N; ++i){
        lsum[i] = srt[i].first;
        if(i){
            lsum[i] += lsum[i - 1];
        }
    }
    for(LL i = N - 1; i >= 0; --i){
        rsum[i] = srt[i].first + rsum[i + 1];
    }
    LL choose = -1;
    for(LL i = 0; i < N; ++i){
        LL low = lsum[i], high = rsum[N - i - 1];
        if(low > high){
            swap(low, high);
        }
        if(!(low > u || high < l)){
            choose = i + 1;
        }
    }
    if(choose == -1){
        vector < int > emp;
        return emp;
    }
    LL sum = 0;
    ans.resize(choose);
    for(LL i = N - 1; i >= N - choose; --i){
        sum += srt[i].first;
        ans[choose - (N - i)] = i;
    }
    int nxt = 0;
    for(int i = 0; i < N; ++i){
        if(i >= N - (choose - nxt) || nxt >= choose){
            break;
        }
        if(sum - srt[ans[nxt]].first + srt[i].first < l){
            continue;
        }
        sum += srt[i].first - srt[ans[nxt]].first;
        ans[nxt] = i;
        ++nxt;
    }
    for(LL i = 0; i < choose; ++i){
        ans[i] = srt[ans[i]].second;
    }
    sort(ans.begin(), ans.end());
    return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
0 / 31.0

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