oj.uz

답안 #165051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165051 2019-11-24T18:50:03 Z Sparky_09 Detecting Molecules (IOI16_molecules) C++17
100 / 100
 78 ms 8296 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#define int long long
using namespace std;
vector<int32_t> find_subset(int32_t l, int32_t u, vector<int32_t> arr){
    vector<pair<int, int32_t>> arr1;
    for(int i = 0;i<arr.size();i++){
        arr1.push_back(make_pair(arr[i], i));
    }
    sort(arr1.begin(), arr1.end());
    vector<int32_t> answer;
    int first = 0, last = 0;
    int sum = 0;
    while(last<=arr1.size() && first<arr.size()){
        if(sum>=l && sum<=u){
            for(int i = first;i<last;i++){
                answer.push_back(arr1[i].second);
            }
            goto returnanswer;
        }
        else if(sum<l){
            if(last<arr1.size()) sum+=arr1[last].first;
            last++;
        }
        else{
            sum-=arr1[first].first;
            first++;
        }
    }
    returnanswer:
    return answer;
}























/*
#include<bits/stdc++.h>
#ifdef LOCAL_DEFINE
#include<conio.h>
#endif
using namespace std;
void io();
void end();

vector<int> find_subset(int l, int u, vector<int> v){
    int n = v.size();
    vector<pair<int, int>> p(n);
    vector<int> ans(0), pref(n+1, 0);

    for(int i = 0; i < n; i++){
        p[i] = {v[i], i};
        pref[i+1]=pref[i]+v[i];
        if(v[i]>=l and v[i]<=u){ ans.push_back(i); return ans; }
    }

    int ll = -1, r = -1;
    sort(p.begin(), p.end());
    for(int i = 0, j = 1; i<n and j<=n;){
        if(l<=(pref[j]-pref[i]) and (pref[j]-pref[i])<=u){ ll = i; r = j-1; break; }
        if((pref[j]-pref[i])>u) i++;
        else if((pref[j]-pref[i])<l) j++;
    }

    if(ll!=-1) for(int i = ll; i <= r; i++) ans.push_back(p[i].second);

    return ans;
}

int main(){
    io();
    int l, u, n;
    cin >> l >> u >> n;
    vector<int> v(n);
    for(int& i: v) cin >> i;
    vector<int> z = find_subset(l, u, v);
    for(auto i: z) cout << i << ' ';
    end();
}


void io(){
#ifdef LOCAL_DEFINE
	ios_base::sync_with_stdio(0); cin.tie(0);
	freopen("input.txt", "rt", stdin);
#endif
}

void end(){	
#ifdef LOCAL_DEFINE
	cerr << "\nTime Elapsed: " << 1.0 * clock()/CLOCKS_PER_SEC << " s.\n";
	getch();
#endif
}
*/
    /*
    if(ll==-1) for(int i = n-1, j = n; i>=0;){
        if((pref[j]-pref[i])>=l and (pref[j]-pref[i])<=u){ ll = i; r = j-1; break; }
        if((pref[j]-pref[i])>u){ j--; if(i==j) i--; }
        else if((pref[j]-pref[i])<l) i--;
        
    }
    */

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int32_t, int32_t, std::vector<int>)':
molecules.cpp:8:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<arr.size();i++){
                   ~^~~~~~~~~~~
molecules.cpp:15:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(last<=arr1.size() && first<arr.size()){
           ~~~~^~~~~~~~~~~~~
molecules.cpp:15:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(last<=arr1.size() && first<arr.size()){
                                ~~~~~^~~~~~~~~~~
molecules.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(last<arr1.size()) sum+=arr1[last].first;
                ~~~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 2 ms 256 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 256 KB OK (n = 3, answer = YES)
13 Correct 2 ms 252 KB OK (n = 3, answer = NO)
14 Correct 2 ms 256 KB OK (n = 3, answer = YES)
15 Correct 2 ms 380 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 2 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 376 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 256 KB OK (n = 12, answer = YES)
22 Correct 2 ms 256 KB OK (n = 12, answer = NO)
23 Correct 2 ms 376 KB OK (n = 12, answer = NO)
24 Correct 2 ms 376 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 308 KB OK (n = 12, answer = YES)
27 Correct 8 ms 376 KB OK (n = 12, answer = YES)
28 Correct 4 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 2 ms 376 KB OK (n = 100, answer = NO)
31 Correct 2 ms 376 KB OK (n = 100, answer = YES)
32 Correct 2 ms 256 KB OK (n = 100, answer = NO)
33 Correct 2 ms 256 KB OK (n = 100, answer = YES)
34 Correct 2 ms 256 KB OK (n = 100, answer = YES)
35 Correct 2 ms 256 KB OK (n = 100, answer = YES)
36 Correct 12 ms 376 KB OK (n = 100, answer = YES)
37 Correct 2 ms 256 KB OK (n = 28, answer = YES)
38 Correct 2 ms 256 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 256 KB OK (n = 100, answer = YES)
41 Correct 2 ms 376 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 376 KB OK (n = 100, answer = YES)
44 Correct 2 ms 376 KB OK (n = 100, answer = YES)
45 Correct 2 ms 376 KB OK (n = 100, answer = YES)
46 Correct 2 ms 376 KB OK (n = 100, answer = YES)
47 Correct 2 ms 376 KB OK (n = 100, answer = NO)
48 Correct 2 ms 380 KB OK (n = 100, answer = NO)
49 Correct 2 ms 256 KB OK (n = 100, answer = NO)
50 Correct 2 ms 256 KB OK (n = 100, answer = YES)
51 Correct 2 ms 256 KB OK (n = 100, answer = YES)
52 Correct 2 ms 376 KB OK (n = 100, answer = YES)
53 Correct 2 ms 256 KB OK (n = 100, answer = YES)
54 Correct 2 ms 256 KB OK (n = 100, answer = YES)
55 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
56 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 760 KB OK (n = 10000, answer = YES)
59 Correct 5 ms 760 KB OK (n = 10000, answer = YES)
60 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 892 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
63 Correct 5 ms 760 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
66 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
67 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
68 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
69 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
70 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 376 KB OK (n = 865, answer = YES)
73 Correct 2 ms 376 KB OK (n = 820, answer = YES)
74 Correct 4 ms 632 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 888 KB OK (n = 10000, answer = NO)
76 Correct 4 ms 892 KB OK (n = 10000, answer = NO)
77 Correct 5 ms 888 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 888 KB OK (n = 10000, answer = NO)
79 Correct 5 ms 760 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
81 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
82 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
83 Correct 5 ms 888 KB OK (n = 10000, answer = NO)
84 Correct 5 ms 808 KB OK (n = 10000, answer = YES)
85 Correct 5 ms 888 KB OK (n = 10000, answer = NO)
86 Correct 5 ms 760 KB OK (n = 10000, answer = YES)
87 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
88 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
89 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
90 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
91 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
92 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
93 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
94 Correct 2 ms 376 KB OK (n = 1, answer = YES)
95 Correct 2 ms 376 KB OK (n = 3, answer = YES)
96 Correct 2 ms 376 KB OK (n = 3, answer = NO)
97 Correct 2 ms 256 KB OK (n = 3, answer = YES)
98 Correct 78 ms 6492 KB OK (n = 150000, answer = NO)
99 Correct 62 ms 7656 KB OK (n = 200000, answer = YES)
100 Correct 66 ms 8296 KB OK (n = 200000, answer = NO)
101 Correct 62 ms 7496 KB OK (n = 200000, answer = YES)
102 Correct 68 ms 8176 KB OK (n = 200000, answer = YES)
103 Correct 60 ms 7784 KB OK (n = 200000, answer = YES)
104 Correct 58 ms 7528 KB OK (n = 200000, answer = YES)
105 Correct 59 ms 6888 KB OK (n = 200000, answer = NO)
106 Correct 65 ms 7400 KB OK (n = 200000, answer = YES)
107 Correct 70 ms 8296 KB OK (n = 200000, answer = NO)
108 Correct 55 ms 6880 KB OK (n = 200000, answer = NO)
109 Correct 55 ms 6760 KB OK (n = 200000, answer = NO)
110 Correct 49 ms 7144 KB OK (n = 200000, answer = YES)
111 Correct 38 ms 7272 KB OK (n = 200000, answer = YES)
112 Correct 38 ms 7176 KB OK (n = 200000, answer = YES)
113 Correct 39 ms 7272 KB OK (n = 200000, answer = YES)
114 Correct 39 ms 7272 KB OK (n = 200000, answer = YES)
115 Correct 40 ms 7276 KB OK (n = 200000, answer = YES)
116 Correct 49 ms 7144 KB OK (n = 200000, answer = YES)
117 Correct 50 ms 7144 KB OK (n = 200000, answer = YES)