oj.uz

답안 #539357

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
539357 2022-03-18T18:34:11 Z beaconmc Detecting Molecules (IOI16_molecules) C++14
100 / 100
 587 ms 5384 KB 
/*
              .'.................',.              
            ............'''',,'''',,'..           
           ......''';:cloodxxxxdolc;,''..         
         ......',;,:lddxkkOO000Okkxdc,....        
        .....';;;;:ldddxkkOO0K0Okkkxdc,...        
        ....';::;:ldddxxkkkO000Okkkxdo:....       
        ...';;;:codddddxxxkkOO00Okkxxo:'...       ██████╗ ███████╗ █████╗  ██████╗ ██████╗ ███╗   ██╗                            
        ...';,,:cloooooddddddxxxddddddc'...       ██╔══██╗██╔════╝██╔══██╗██╔════╝██╔═══██╗████╗  ██║                            
         ..',,,'',;;:cclollcc;,''',;coo;..        ██████╔╝█████╗  ███████║██║     ██║   ██║██╔██╗ ██║                            
         ..,,,''....',:oddl:,'..',,,:od:.'.       ██╔══██╗██╔══╝  ██╔══██║██║     ██║   ██║██║╚██╗██║                            
        ..';;'','....'cdkOx:'',,;clclodc,:,       ██████╔╝███████╗██║  ██║╚██████╗╚██████╔╝██║ ╚████║                            
        ..';;,,,,',,',cdkkxolccccloddooc;:;       ╚═════╝ ╚══════╝╚═╝  ╚═╝ ╚═════╝ ╚═════╝ ╚═╝  ╚═══╝                            
         .';::cllc::,,cdxxdooollloddxxdlcoc.                                                                                       ________  ___
         .';:clc:;;;,;codddooolc::cclooodkc.      ███████╗██╗   ██╗███████╗███████╗██╗   ██╗     ██████╗ ██████╗ ██████╗ ███████╗ /_  __/  |/  /
         .';;;,,,,,,,;cooollloolc;,',:cc:,.       ██╔════╝██║   ██║██╔════╝██╔════╝╚██╗ ██╔╝    ██╔════╝██╔═══██╗██╔══██╗██╔════╝  / / / /|_/ / 
          .,,,'..',,,,,::::cccc:;''..;:,.         ███████╗██║   ██║███████╗███████╗ ╚████╔╝     ██║     ██║   ██║██║  ██║█████╗   /_/ /_/  /_/  
           ';:;,..,;;;,;:ccllool;';;;::.          ╚════██║██║   ██║╚════██║╚════██║  ╚██╔╝      ██║     ██║   ██║██║  ██║██╔══╝  
           .,:::,';oxxxxkkO00KOocclcc:.           ███████║╚██████╔╝███████║███████║   ██║       ╚██████╗╚██████╔╝██████╔╝███████╗
            .';::,',coxxkkkkxxo:cool;.            ╚══════╝ ╚═════╝ ╚══════╝╚══════╝   ╚═╝        ╚═════╝ ╚═════╝ ╚═════╝ ╚══════╝
              .,:;,'',:cccllodolodo:.             
           ..''',;;;;::cllooooodddocc:;,..        
     ....'',;;'''',;::cclllloddddlclolcdxdl:,..   
..'',,'',;,,;;,,''';:ccloloodddol:::llldkkkkxxdl;.
:,,,;,',;;,,;,'',,,,,:clooooool::clc:coxxxkkkkkkkx
''',,,',;;,,,'.',,,,'';:cccc:;,;cloollodxxkkkkkkkk
*/




#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "molecules.h"


typedef long long lll;
using namespace std;
using namespace __gnu_pbds;

#define FOR(i, x, y) for(int i=x; i<y; i++)
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)


vector<int> find_subset(int l, int u, vector<int> k){
    vector<int> w;
    w = k;
    sort(w.begin(), w.end());

    lll n = k.size();
    lll ll = 0; lll rr = 0;
    lll cur = 0;
    while (ll<=rr){
        if (cur<l){
            if (rr>n) break;
            cur += w[rr];
            rr++;
        }else if (cur>u){
            cur -= w[ll];
            ll ++; 
        }else{
            break;
        }
    }
    vector<int> ans;
    unordered_multiset<int> realsus;
    if (l<=cur && cur<=u){
        FOR(i,ll,rr){
            realsus.insert(w[i]);
        }
    }
    FOR(i,0,n){
        if (realsus.count(k[i])){
            ans.push_back(i);
            realsus.erase(realsus.find(k[i]));
        }
    }

    return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 212 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 0 ms 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 0 ms 212 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 0 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 4 ms 340 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
61 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
66 Correct 1 ms 340 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 340 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 340 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 340 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 340 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 1 ms 340 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
79 Correct 14 ms 636 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
86 Correct 7 ms 596 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 1 ms 340 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 340 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 212 KB OK (n = 1, answer = YES)
95 Correct 0 ms 212 KB OK (n = 3, answer = YES)
96 Correct 0 ms 212 KB OK (n = 3, answer = NO)
97 Correct 0 ms 212 KB OK (n = 3, answer = YES)
98 Correct 19 ms 2048 KB OK (n = 150000, answer = NO)
99 Correct 34 ms 2644 KB OK (n = 200000, answer = YES)
100 Correct 43 ms 4796 KB OK (n = 200000, answer = NO)
101 Correct 49 ms 5152 KB OK (n = 200000, answer = YES)
102 Correct 44 ms 4640 KB OK (n = 200000, answer = YES)
103 Correct 33 ms 4128 KB OK (n = 200000, answer = YES)
104 Correct 35 ms 4040 KB OK (n = 200000, answer = YES)
105 Correct 32 ms 3412 KB OK (n = 200000, answer = NO)
106 Correct 49 ms 5384 KB OK (n = 200000, answer = YES)
107 Correct 42 ms 4768 KB OK (n = 200000, answer = NO)
108 Correct 27 ms 3412 KB OK (n = 200000, answer = NO)
109 Correct 27 ms 3388 KB OK (n = 200000, answer = NO)
110 Correct 25 ms 3636 KB OK (n = 200000, answer = YES)
111 Correct 27 ms 3884 KB OK (n = 200000, answer = YES)
112 Correct 26 ms 3772 KB OK (n = 200000, answer = YES)
113 Correct 587 ms 4428 KB OK (n = 200000, answer = YES)
114 Correct 583 ms 4472 KB OK (n = 200000, answer = YES)
115 Correct 310 ms 4464 KB OK (n = 200000, answer = YES)
116 Correct 23 ms 3500 KB OK (n = 200000, answer = YES)
117 Correct 22 ms 3500 KB OK (n = 200000, answer = YES)