oj.uz

답안 #547151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547151 2022-04-09T17:29:15 Z beedle Detecting Molecules (IOI16_molecules) C++17
100 / 100
 50 ms 8084 KB 
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <set>
#include <iterator>
#include <stack>
#include <map>
#include <math.h>
#include <bitset>
#include <deque>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <unordered_set>
#include <unordered_map>
#define pi 3.141592653589793238
#define ll long long
#define ld long double
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define mod 1000000007ll
#define INF 1000000000000000000
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define all(x) (x).begin (), (x).end ()
#define sz(x) (ll) (x).size ()
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define rank rnk
#define log lg
#define fast                                                                  \
    ios_base::sync_with_stdio (false);                                        \
    cin.tie (NULL);                                                           \
    cout.tie (NULL)
 
using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    ll n=sz(w);
    vector <pair<ll,ll>> arr(n);
    rep(i,0,n-1)
    arr[i]={w[i],i};

    sort(all(arr));

    ll curr=0;
    
    vector <int> idx;
    bool done=false;
    ll lidx=-1;
    rep(i,0,n-1)
    {
        curr+=arr[i].ff;
        idx.pb(arr[i].ss);
        lidx=i;
        if(curr>=l && curr<=u)
        {
            done=true;
            break;
        }
        else if(curr>u)
        {
            curr-=arr[i].ff;
            idx.pop_back();
            lidx--;
            break;
        }
    }

    if(done)
    return idx;

    // cout<<curr<<endl;

    ll fidx=0;
    for(ll i=n-1;i>=lidx+1;i--)
    {
        curr+=arr[i].ff-arr[fidx].ff;
        idx.pb(arr[i].ss);
        fidx++;

        if(curr>=l && curr<=u)
        break;
        if(fidx==lidx+1)
        break;
    }
    
    ll s=sz(idx);
    vector <int> ret;
    rep(i,fidx,s-1)
    ret.pb(idx[i]);

    // cout<<curr<<endl;

    if(curr>=l && curr<=u)
    return ret;
    else
    return vector <int> ();
}

// signed main()
// {
//     fast;

    // freopen("milkorder.in","r",stdin);
    // freopen("milkorder.out","w",stdout);

//     auto v=find_subset(15,17, {6,8,8,7});
//     for(auto x:v)
//     cout<<x<<" ";
//     return 0;
// }

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 1 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 0 ms 212 KB OK (n = 12, answer = YES)
9 Correct 0 ms 212 KB OK (n = 6, answer = YES)
10 Correct 0 ms 212 KB OK (n = 12, answer = YES)
11 Correct 1 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 0 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 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 1 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 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 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 0 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 0 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 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 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 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 1 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 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 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 0 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 0 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 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 548 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 464 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 0 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 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 1 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 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 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 0 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 0 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 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 548 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 464 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 0 ms 212 KB OK (n = 820, answer = YES)
74 Correct 2 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 468 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 2 ms 596 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 468 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 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 1 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 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 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 0 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 0 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 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 548 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 464 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 0 ms 212 KB OK (n = 820, answer = YES)
74 Correct 2 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 468 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 2 ms 596 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 468 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 32 ms 5864 KB OK (n = 150000, answer = NO)
99 Correct 44 ms 4992 KB OK (n = 200000, answer = YES)
100 Correct 50 ms 6220 KB OK (n = 200000, answer = NO)
101 Correct 44 ms 6452 KB OK (n = 200000, answer = YES)
102 Correct 46 ms 6228 KB OK (n = 200000, answer = YES)
103 Correct 48 ms 6128 KB OK (n = 200000, answer = YES)
104 Correct 40 ms 6204 KB OK (n = 200000, answer = YES)
105 Correct 39 ms 8028 KB OK (n = 200000, answer = NO)
106 Correct 47 ms 6476 KB OK (n = 200000, answer = YES)
107 Correct 45 ms 6148 KB OK (n = 200000, answer = NO)
108 Correct 41 ms 8084 KB OK (n = 200000, answer = NO)
109 Correct 41 ms 7996 KB OK (n = 200000, answer = NO)
110 Correct 35 ms 5936 KB OK (n = 200000, answer = YES)
111 Correct 26 ms 6040 KB OK (n = 200000, answer = YES)
112 Correct 26 ms 6048 KB OK (n = 200000, answer = YES)
113 Correct 28 ms 6276 KB OK (n = 200000, answer = YES)
114 Correct 29 ms 6308 KB OK (n = 200000, answer = YES)
115 Correct 27 ms 6356 KB OK (n = 200000, answer = YES)
116 Correct 36 ms 5916 KB OK (n = 200000, answer = YES)
117 Correct 36 ms 5892 KB OK (n = 200000, answer = YES)