oj.uz

답안 #111107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111107 2019-05-13T16:39:48 Z CodeKracker Detecting Molecules (IOI16_molecules) C++14
46 / 100
 7 ms 640 KB 
/*input
14 14
2
13 15
*/
/**
    Author: Kristopher Paul
    Date Created: 13-05-2019
    Contest Name:
                _/    _/   _/_/_/_/   _/   _/_/_/_/
               _/  _/     _/    _/   _/   _/
              _/_/       _/_/_/_/   _/   _/_/_/_/
             _/  _/     _/  _/     _/         _/
            _/    _/   _/    _/   _/   _/_/_/_/
**/
#include<bits/stdc++.h>
#define pb push_back
#define INF 0x3f3f3f3f //0x3f3f3f3f = 63
#define MOD 1000000007
#define mp make_pair
const double PI=3.141592653589793238462643383279502884197169399375105820974944;
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define umap unordered_map
#define pii pair<int,int>
#define F first
#define S second
#define mii map<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define itr :: iterator it
#define all(v) v.begin(),v.end()
#define WL(t) while(t--)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
#define out(x) cout << #x << " is " << x << endl
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;

vector<int> find_subset(int l,int u,vector<int> w){
    int al,ar,len;
    al = ar = -1;
    len = -1;
    vector<pii> vec;
    int tot = 0;
    vector<int> ans;
    ans.clear();
    vec.clear();
    FOR(i,0,w.size()){
        vec.pb({w[i],i});
        tot += w[i];
    }
    if(tot < l){
        return ans;
    }
    sort(vec.begin(),vec.end());
    int i = 0,j = 0;
    int csum = 0;
    if(vec[0].first > u){
        return ans;
    }
    while(i <= w.size() && j <= w.size() && (csum > u || csum < l)){
        if(csum < l){
            csum += vec[j].first;
            j++;
        }else if(csum > u){
            csum -= vec[i].first;
            i++;
        }
    }
    if(csum > u || csum < l){
        return ans;
    }
    FOR(k,i,j){
        ans.pb(vec[k].second);
    }
    return ans;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:23:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i,a,b) for (int i = a; i < b; i++)
molecules.cpp:53:9:
     FOR(i,0,w.size()){
         ~~~~~~~~~~~~                  
molecules.cpp:53:5: note: in expansion of macro 'FOR'
     FOR(i,0,w.size()){
     ^~~
molecules.cpp:66:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(i <= w.size() && j <= w.size() && (csum > u || csum < l)){
           ~~^~~~~~~~~~~
molecules.cpp:66:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(i <= w.size() && j <= w.size() && (csum > u || csum < l)){
                            ~~^~~~~~~~~~~
molecules.cpp:45:9: warning: variable 'al' set but not used [-Wunused-but-set-variable]
     int al,ar,len;
         ^~
molecules.cpp:45:15: warning: variable 'len' set but not used [-Wunused-but-set-variable]
     int al,ar,len;
               ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Correct 2 ms 384 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 3 ms 384 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 3 ms 384 KB OK (n = 3, answer = YES)
9 Correct 2 ms 412 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 256 KB OK (n = 3, answer = YES)
13 Correct 2 ms 432 KB OK (n = 3, answer = NO)
14 Correct 3 ms 256 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 384 KB OK (n = 3, answer = NO)
17 Correct 3 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 384 KB OK (n = 100, answer = NO)
19 Correct 3 ms 512 KB OK (n = 100, answer = YES)
20 Correct 2 ms 356 KB OK (n = 12, answer = YES)
21 Correct 2 ms 384 KB OK (n = 12, answer = YES)
22 Correct 2 ms 384 KB OK (n = 12, answer = NO)
23 Correct 2 ms 384 KB OK (n = 12, answer = NO)
24 Correct 2 ms 384 KB OK (n = 12, answer = YES)
25 Correct 3 ms 384 KB OK (n = 12, answer = YES)
26 Correct 2 ms 384 KB OK (n = 12, answer = YES)
27 Correct 2 ms 384 KB OK (n = 12, answer = YES)
28 Correct 3 ms 384 KB OK (n = 6, answer = YES)
29 Correct 2 ms 384 KB OK (n = 12, answer = YES)
30 Correct 2 ms 256 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 3 ms 256 KB OK (n = 100, answer = NO)
33 Correct 2 ms 384 KB OK (n = 100, answer = YES)
34 Correct 2 ms 384 KB OK (n = 100, answer = YES)
35 Correct 2 ms 384 KB OK (n = 100, answer = YES)
36 Correct 2 ms 384 KB OK (n = 100, answer = YES)
37 Correct 2 ms 384 KB OK (n = 28, answer = YES)
38 Correct 3 ms 384 KB OK (n = 27, answer = YES)
39 Correct 3 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 384 KB OK (n = 100, answer = YES)
41 Correct 2 ms 384 KB OK (n = 100, answer = YES)
42 Correct 3 ms 384 KB OK (n = 10, answer = YES)
43 Correct 3 ms 384 KB OK (n = 100, answer = YES)
44 Correct 2 ms 384 KB OK (n = 100, answer = YES)
45 Correct 2 ms 384 KB OK (n = 100, answer = YES)
46 Correct 2 ms 256 KB OK (n = 100, answer = YES)
47 Correct 2 ms 256 KB OK (n = 100, answer = NO)
48 Correct 2 ms 256 KB OK (n = 100, answer = NO)
49 Correct 3 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 384 KB OK (n = 100, answer = YES)
53 Correct 2 ms 256 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
63 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
64 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
67 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 612 KB OK (n = 10000, answer = YES)
69 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 384 KB OK (n = 865, answer = YES)
73 Correct 2 ms 384 KB OK (n = 820, answer = YES)
74 Correct 3 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
81 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
82 Incorrect 4 ms 640 KB Contestant can not find answer, jury can
83 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Correct 2 ms 384 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 3 ms 384 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 3 ms 384 KB OK (n = 3, answer = YES)
9 Correct 2 ms 412 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 256 KB OK (n = 3, answer = YES)
13 Correct 2 ms 432 KB OK (n = 3, answer = NO)
14 Correct 3 ms 256 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 384 KB OK (n = 3, answer = NO)
17 Correct 3 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 384 KB OK (n = 100, answer = NO)
19 Correct 3 ms 512 KB OK (n = 100, answer = YES)
20 Correct 2 ms 356 KB OK (n = 12, answer = YES)
21 Correct 2 ms 384 KB OK (n = 12, answer = YES)
22 Correct 2 ms 384 KB OK (n = 12, answer = NO)
23 Correct 2 ms 384 KB OK (n = 12, answer = NO)
24 Correct 2 ms 384 KB OK (n = 12, answer = YES)
25 Correct 3 ms 384 KB OK (n = 12, answer = YES)
26 Correct 2 ms 384 KB OK (n = 12, answer = YES)
27 Correct 2 ms 384 KB OK (n = 12, answer = YES)
28 Correct 3 ms 384 KB OK (n = 6, answer = YES)
29 Correct 2 ms 384 KB OK (n = 12, answer = YES)
30 Correct 2 ms 256 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 3 ms 256 KB OK (n = 100, answer = NO)
33 Correct 2 ms 384 KB OK (n = 100, answer = YES)
34 Correct 2 ms 384 KB OK (n = 100, answer = YES)
35 Correct 2 ms 384 KB OK (n = 100, answer = YES)
36 Correct 2 ms 384 KB OK (n = 100, answer = YES)
37 Correct 2 ms 384 KB OK (n = 28, answer = YES)
38 Correct 3 ms 384 KB OK (n = 27, answer = YES)
39 Correct 3 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 384 KB OK (n = 100, answer = YES)
41 Correct 2 ms 384 KB OK (n = 100, answer = YES)
42 Correct 3 ms 384 KB OK (n = 10, answer = YES)
43 Correct 3 ms 384 KB OK (n = 100, answer = YES)
44 Correct 2 ms 384 KB OK (n = 100, answer = YES)
45 Correct 2 ms 384 KB OK (n = 100, answer = YES)
46 Correct 2 ms 256 KB OK (n = 100, answer = YES)
47 Correct 2 ms 256 KB OK (n = 100, answer = NO)
48 Correct 2 ms 256 KB OK (n = 100, answer = NO)
49 Correct 3 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 384 KB OK (n = 100, answer = YES)
53 Correct 2 ms 256 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
63 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
64 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
67 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 612 KB OK (n = 10000, answer = YES)
69 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 384 KB OK (n = 865, answer = YES)
73 Correct 2 ms 384 KB OK (n = 820, answer = YES)
74 Correct 3 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
81 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
82 Incorrect 4 ms 640 KB Contestant can not find answer, jury can
83 Halted 0 ms 0 KB -