oj.uz

답안 #186979

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
186979 2020-01-12T11:54:20 Z PedroBigMan Detecting Molecules (IOI16_molecules) C++14
69 / 100
 51 ms 10020 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include "molecules.h"
using namespace std;
typedef int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF 100000000000000000LL
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

vector<ll> find_subset(ll l,ll u, vector<ll> wee)
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll N=wee.size(); vector<pl> we; 
    ll curin;
    REP(i,0,N) {we.pb(mp(wee[i],i));}
    sort(we.begin(),we.end()); vector<ll> w; REP(i,0,N) {w.pb(we[i].ff);}
    vector<bool> cur; REP(i,0,N) {cur.pb(false);}
    vector<pl> sums; ll losum=0; ll hisum=0;
    REP(i,0,N)
    {
        losum+=w[i]; hisum+=w[N-i-1];
        sums.pb(mp(losum,hisum));
    }
    vector<ll> ans;
    REP(k,1,N+1)
    {
        if(sums[k-1].ff<=u && sums[k-1].ss>=l)
        {
            ll curs=0;
            REP(i,0,k) {cur[i]=true; curs+=w[i];}
            ll ind=0;
            while(curs<l)
            {
                cur[ind]=false; cur[N-1-ind]=true;
                curs-=w[ind]; curs+=w[N-1-ind];
                ind++;
            }
            REP(i,0,N) {if(cur[i]) {ans.pb(we[i].ss);}}
            return ans;
        }
    }
    return ans;
}

Compilation message

molecules.cpp: In function 'void Out(std::vector<int>)':
molecules.cpp:15:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
molecules.cpp:24:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
molecules.cpp:24:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~
molecules.cpp: In function 'std::vector<int> find_subset(ll, ll, std::vector<int>)':
molecules.cpp:31:8: warning: unused variable 'curin' [-Wunused-variable]
     ll curin;
        ^~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 9 ms 504 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 348 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 1 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 0 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 1 ms 376 KB OK (n = 12, answer = YES)
2 Correct 2 ms 376 KB OK (n = 12, answer = YES)
3 Correct 2 ms 348 KB OK (n = 12, answer = NO)
4 Correct 2 ms 376 KB OK (n = 12, answer = NO)
5 Correct 9 ms 380 KB OK (n = 12, answer = YES)
6 Correct 3 ms 376 KB OK (n = 12, answer = YES)
7 Correct 2 ms 348 KB OK (n = 12, answer = YES)
8 Correct 0 ms 376 KB OK (n = 12, answer = YES)
9 Correct 2 ms 376 KB OK (n = 6, answer = YES)
10 Correct 2 ms 376 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 376 KB OK (n = 100, answer = NO)
14 Correct 2 ms 376 KB OK (n = 100, answer = YES)
15 Correct 4 ms 352 KB OK (n = 100, answer = YES)
16 Correct 2 ms 348 KB OK (n = 100, answer = YES)
17 Correct 2 ms 376 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 9 ms 504 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 348 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 1 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 0 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 376 KB OK (n = 100, answer = YES)
20 Correct 1 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 348 KB OK (n = 12, answer = NO)
23 Correct 2 ms 376 KB OK (n = 12, answer = NO)
24 Correct 9 ms 380 KB OK (n = 12, answer = YES)
25 Correct 3 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 348 KB OK (n = 12, answer = YES)
27 Correct 0 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 376 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 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 376 KB OK (n = 100, answer = NO)
33 Correct 2 ms 376 KB OK (n = 100, answer = YES)
34 Correct 4 ms 352 KB OK (n = 100, answer = YES)
35 Correct 2 ms 348 KB OK (n = 100, answer = YES)
36 Correct 2 ms 376 KB OK (n = 100, answer = YES)
37 Correct 2 ms 376 KB OK (n = 28, answer = YES)
38 Correct 2 ms 376 KB OK (n = 27, answer = YES)
39 Correct 2 ms 376 KB OK (n = 90, answer = YES)
40 Correct 2 ms 376 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 6 ms 376 KB OK (n = 100, answer = YES)
44 Correct 2 ms 248 KB OK (n = 100, answer = YES)
45 Correct 0 ms 248 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 3 ms 376 KB OK (n = 100, answer = NO)
49 Correct 0 ms 376 KB OK (n = 100, answer = NO)
50 Correct 2 ms 360 KB OK (n = 100, answer = YES)
51 Correct 2 ms 376 KB OK (n = 100, answer = YES)
52 Correct 2 ms 376 KB OK (n = 100, answer = YES)
53 Correct 2 ms 376 KB OK (n = 100, answer = YES)
54 Correct 2 ms 376 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 9 ms 504 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 348 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 1 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 0 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 376 KB OK (n = 100, answer = YES)
20 Correct 1 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 348 KB OK (n = 12, answer = NO)
23 Correct 2 ms 376 KB OK (n = 12, answer = NO)
24 Correct 9 ms 380 KB OK (n = 12, answer = YES)
25 Correct 3 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 348 KB OK (n = 12, answer = YES)
27 Correct 0 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 376 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 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 376 KB OK (n = 100, answer = NO)
33 Correct 2 ms 376 KB OK (n = 100, answer = YES)
34 Correct 4 ms 352 KB OK (n = 100, answer = YES)
35 Correct 2 ms 348 KB OK (n = 100, answer = YES)
36 Correct 2 ms 376 KB OK (n = 100, answer = YES)
37 Correct 2 ms 376 KB OK (n = 28, answer = YES)
38 Correct 2 ms 376 KB OK (n = 27, answer = YES)
39 Correct 2 ms 376 KB OK (n = 90, answer = YES)
40 Correct 2 ms 376 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 6 ms 376 KB OK (n = 100, answer = YES)
44 Correct 2 ms 248 KB OK (n = 100, answer = YES)
45 Correct 0 ms 248 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 3 ms 376 KB OK (n = 100, answer = NO)
49 Correct 0 ms 376 KB OK (n = 100, answer = NO)
50 Correct 2 ms 360 KB OK (n = 100, answer = YES)
51 Correct 2 ms 376 KB OK (n = 100, answer = YES)
52 Correct 2 ms 376 KB OK (n = 100, answer = YES)
53 Correct 2 ms 376 KB OK (n = 100, answer = YES)
54 Correct 2 ms 376 KB OK (n = 100, answer = YES)
55 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
58 Correct 11 ms 1016 KB OK (n = 10000, answer = YES)
59 Correct 5 ms 764 KB OK (n = 10000, answer = YES)
60 Correct 6 ms 888 KB OK (n = 10000, answer = YES)
61 Correct 6 ms 888 KB OK (n = 10000, answer = NO)
62 Correct 6 ms 888 KB OK (n = 10000, answer = YES)
63 Correct 6 ms 888 KB OK (n = 10000, answer = NO)
64 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 920 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 888 KB OK (n = 10000, answer = YES)
67 Correct 5 ms 852 KB OK (n = 10000, answer = YES)
68 Correct 4 ms 920 KB OK (n = 10000, answer = YES)
69 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
70 Correct 0 ms 888 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 380 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 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 9 ms 504 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 348 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 1 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 0 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 376 KB OK (n = 100, answer = YES)
20 Correct 1 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 348 KB OK (n = 12, answer = NO)
23 Correct 2 ms 376 KB OK (n = 12, answer = NO)
24 Correct 9 ms 380 KB OK (n = 12, answer = YES)
25 Correct 3 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 348 KB OK (n = 12, answer = YES)
27 Correct 0 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 376 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 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 376 KB OK (n = 100, answer = NO)
33 Correct 2 ms 376 KB OK (n = 100, answer = YES)
34 Correct 4 ms 352 KB OK (n = 100, answer = YES)
35 Correct 2 ms 348 KB OK (n = 100, answer = YES)
36 Correct 2 ms 376 KB OK (n = 100, answer = YES)
37 Correct 2 ms 376 KB OK (n = 28, answer = YES)
38 Correct 2 ms 376 KB OK (n = 27, answer = YES)
39 Correct 2 ms 376 KB OK (n = 90, answer = YES)
40 Correct 2 ms 376 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 6 ms 376 KB OK (n = 100, answer = YES)
44 Correct 2 ms 248 KB OK (n = 100, answer = YES)
45 Correct 0 ms 248 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 3 ms 376 KB OK (n = 100, answer = NO)
49 Correct 0 ms 376 KB OK (n = 100, answer = NO)
50 Correct 2 ms 360 KB OK (n = 100, answer = YES)
51 Correct 2 ms 376 KB OK (n = 100, answer = YES)
52 Correct 2 ms 376 KB OK (n = 100, answer = YES)
53 Correct 2 ms 376 KB OK (n = 100, answer = YES)
54 Correct 2 ms 376 KB OK (n = 100, answer = YES)
55 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
58 Correct 11 ms 1016 KB OK (n = 10000, answer = YES)
59 Correct 5 ms 764 KB OK (n = 10000, answer = YES)
60 Correct 6 ms 888 KB OK (n = 10000, answer = YES)
61 Correct 6 ms 888 KB OK (n = 10000, answer = NO)
62 Correct 6 ms 888 KB OK (n = 10000, answer = YES)
63 Correct 6 ms 888 KB OK (n = 10000, answer = NO)
64 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 920 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 888 KB OK (n = 10000, answer = YES)
67 Correct 5 ms 852 KB OK (n = 10000, answer = YES)
68 Correct 4 ms 920 KB OK (n = 10000, answer = YES)
69 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
70 Correct 0 ms 888 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 380 KB OK (n = 865, answer = YES)
73 Correct 2 ms 376 KB OK (n = 820, answer = YES)
74 Correct 2 ms 664 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 884 KB OK (n = 10000, answer = NO)
76 Correct 6 ms 888 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 760 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 920 KB OK (n = 10000, answer = NO)
79 Correct 5 ms 844 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 6 ms 888 KB OK (n = 10000, answer = YES)
83 Correct 5 ms 888 KB OK (n = 10000, answer = NO)
84 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
85 Correct 5 ms 860 KB OK (n = 10000, answer = NO)
86 Correct 6 ms 804 KB OK (n = 10000, answer = YES)
87 Correct 5 ms 892 KB OK (n = 10000, answer = YES)
88 Correct 5 ms 884 KB OK (n = 10000, answer = YES)
89 Correct 4 ms 860 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 5 ms 888 KB OK (n = 10000, answer = YES)

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 9 ms 504 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 348 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 1 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 0 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 376 KB OK (n = 100, answer = YES)
20 Correct 1 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 348 KB OK (n = 12, answer = NO)
23 Correct 2 ms 376 KB OK (n = 12, answer = NO)
24 Correct 9 ms 380 KB OK (n = 12, answer = YES)
25 Correct 3 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 348 KB OK (n = 12, answer = YES)
27 Correct 0 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 376 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 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 376 KB OK (n = 100, answer = NO)
33 Correct 2 ms 376 KB OK (n = 100, answer = YES)
34 Correct 4 ms 352 KB OK (n = 100, answer = YES)
35 Correct 2 ms 348 KB OK (n = 100, answer = YES)
36 Correct 2 ms 376 KB OK (n = 100, answer = YES)
37 Correct 2 ms 376 KB OK (n = 28, answer = YES)
38 Correct 2 ms 376 KB OK (n = 27, answer = YES)
39 Correct 2 ms 376 KB OK (n = 90, answer = YES)
40 Correct 2 ms 376 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 6 ms 376 KB OK (n = 100, answer = YES)
44 Correct 2 ms 248 KB OK (n = 100, answer = YES)
45 Correct 0 ms 248 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 3 ms 376 KB OK (n = 100, answer = NO)
49 Correct 0 ms 376 KB OK (n = 100, answer = NO)
50 Correct 2 ms 360 KB OK (n = 100, answer = YES)
51 Correct 2 ms 376 KB OK (n = 100, answer = YES)
52 Correct 2 ms 376 KB OK (n = 100, answer = YES)
53 Correct 2 ms 376 KB OK (n = 100, answer = YES)
54 Correct 2 ms 376 KB OK (n = 100, answer = YES)
55 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
58 Correct 11 ms 1016 KB OK (n = 10000, answer = YES)
59 Correct 5 ms 764 KB OK (n = 10000, answer = YES)
60 Correct 6 ms 888 KB OK (n = 10000, answer = YES)
61 Correct 6 ms 888 KB OK (n = 10000, answer = NO)
62 Correct 6 ms 888 KB OK (n = 10000, answer = YES)
63 Correct 6 ms 888 KB OK (n = 10000, answer = NO)
64 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 920 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 888 KB OK (n = 10000, answer = YES)
67 Correct 5 ms 852 KB OK (n = 10000, answer = YES)
68 Correct 4 ms 920 KB OK (n = 10000, answer = YES)
69 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
70 Correct 0 ms 888 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 888 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 380 KB OK (n = 865, answer = YES)
73 Correct 2 ms 376 KB OK (n = 820, answer = YES)
74 Correct 2 ms 664 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 884 KB OK (n = 10000, answer = NO)
76 Correct 6 ms 888 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 760 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 920 KB OK (n = 10000, answer = NO)
79 Correct 5 ms 844 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 6 ms 888 KB OK (n = 10000, answer = YES)
83 Correct 5 ms 888 KB OK (n = 10000, answer = NO)
84 Correct 5 ms 888 KB OK (n = 10000, answer = YES)
85 Correct 5 ms 860 KB OK (n = 10000, answer = NO)
86 Correct 6 ms 804 KB OK (n = 10000, answer = YES)
87 Correct 5 ms 892 KB OK (n = 10000, answer = YES)
88 Correct 5 ms 884 KB OK (n = 10000, answer = YES)
89 Correct 4 ms 860 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 5 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 376 KB OK (n = 3, answer = YES)
98 Correct 45 ms 7804 KB OK (n = 150000, answer = NO)
99 Incorrect 51 ms 10020 KB Contestant can not find answer, jury can
100 Halted 0 ms 0 KB -