oj.uz

답안 #366198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366198 2021-02-13T13:28:42 Z iliccmarko Detecting Molecules (IOI16_molecules) C++14
100 / 100
 209 ms 13036 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 1000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define input(n, v) {for(int i = 0;i<n;i++) cin>>v[i];}
#define output(n, v) {for(int i = 0;i<n;i++) cout<<v[i]<<" "; cout<<endl;}
#define single_case solve();
#define line cout<<"------------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); }
const int N = 2e5 + 5;
pair<int, int> a[N];
set<pair<int, int> > s;

vector<int> find_subset(int l, int u, vector<int> w)
{
    priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq;
    vector<int> res;
    int n = len(w);
    for(int i = 0;i<n;i++)
    {
        a[i].first = w[i];
        a[i].second = i;
    }
    sort(a, a+n);
    ll sum = 0;
    for(int i = 0;i<n;i++)
    {
        sum += (ll)a[i].first;
        if(sum>(ll)u)
        {
            sum -= (ll)a[i].first;
            break;
        }
        pq.push(a[i]);
        if(sum<=u&&sum>=l)
        {
            while(len(pq))
            {
                auto x = pq.top();
                res.pb(x.second);
                pq.pop();
            }
            return res;
        }
    }
    int vel = len(pq);
    if(vel==n||!vel) return res;
    for(int i = vel;i<n;i++)
    {
        s.insert(a[i]);
    }
    for(int i = vel;i<n;i++)
    {
        int ind = pq.top().second;
        sum -= pq.top().first;
        s.insert(pq.top());
        pq.pop();
        sum += (ll)(a[i].first);
        pq.push(a[i]);
        s.erase(a[i]);
            ll raz = (ll)u - sum;
            auto x = make_pair((int)raz, -1);
            auto xx = s.upper_bound(x);
            if(xx!=s.begin())
            {
                xx--;
                pq.push(make_pair(xx->first, xx->second));
                sum += xx->first;
                s.erase(xx);
            }
        if(sum<=u&&sum>=l)
        {
            while(len(pq))
            {
                res.pb(pq.top().second);
                pq.pop();
            }
            return res;
        }
    }
    vector<int> ans;
    return ans;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:60:13: warning: unused variable 'ind' [-Wunused-variable]
   60 |         int ind = pq.top().second;
      |             ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 384 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 0 ms 364 KB OK (n = 3, answer = YES)
9 Correct 0 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 1 ms 364 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 0 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 384 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 364 KB OK (n = 12, answer = YES)
21 Correct 0 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 ms 364 KB OK (n = 12, answer = NO)
24 Correct 1 ms 364 KB OK (n = 12, answer = YES)
25 Correct 1 ms 364 KB OK (n = 12, answer = YES)
26 Correct 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 0 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 364 KB OK (n = 6, answer = YES)
29 Correct 1 ms 364 KB OK (n = 12, answer = YES)
30 Correct 0 ms 364 KB OK (n = 100, answer = NO)
31 Correct 1 ms 364 KB OK (n = 100, answer = YES)
32 Correct 1 ms 384 KB OK (n = 100, answer = NO)
33 Correct 1 ms 364 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 364 KB OK (n = 100, answer = YES)
36 Correct 0 ms 364 KB OK (n = 100, answer = YES)
37 Correct 1 ms 364 KB OK (n = 28, answer = YES)
38 Correct 1 ms 364 KB OK (n = 27, answer = YES)
39 Correct 1 ms 364 KB OK (n = 90, answer = YES)
40 Correct 1 ms 364 KB OK (n = 100, answer = YES)
41 Correct 1 ms 364 KB OK (n = 100, answer = YES)
42 Correct 0 ms 364 KB OK (n = 10, answer = YES)
43 Correct 0 ms 364 KB OK (n = 100, answer = YES)
44 Correct 1 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 0 ms 364 KB OK (n = 100, answer = YES)
47 Correct 0 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 364 KB OK (n = 100, answer = NO)
49 Correct 1 ms 364 KB OK (n = 100, answer = NO)
50 Correct 1 ms 364 KB OK (n = 100, answer = YES)
51 Correct 1 ms 364 KB OK (n = 100, answer = YES)
52 Correct 1 ms 364 KB OK (n = 100, answer = YES)
53 Correct 0 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 876 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
61 Correct 7 ms 876 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 492 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
67 Correct 4 ms 1004 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
70 Correct 5 ms 1004 KB OK (n = 10000, answer = YES)
71 Correct 5 ms 1004 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 380 KB OK (n = 865, answer = YES)
73 Correct 1 ms 364 KB OK (n = 820, answer = YES)
74 Correct 2 ms 620 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 748 KB OK (n = 10000, answer = NO)
76 Correct 4 ms 748 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 748 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 876 KB OK (n = 10000, answer = NO)
79 Correct 5 ms 876 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
81 Correct 5 ms 1004 KB OK (n = 10000, answer = YES)
82 Correct 6 ms 1004 KB OK (n = 10000, answer = YES)
83 Correct 8 ms 1024 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
86 Correct 5 ms 876 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
89 Correct 4 ms 1004 KB OK (n = 10000, answer = YES)
90 Correct 7 ms 1004 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
92 Correct 5 ms 1004 KB OK (n = 10000, answer = YES)
93 Correct 5 ms 1004 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 364 KB OK (n = 1, answer = YES)
95 Correct 1 ms 364 KB OK (n = 3, answer = YES)
96 Correct 1 ms 364 KB OK (n = 3, answer = NO)
97 Correct 1 ms 364 KB OK (n = 3, answer = YES)
98 Correct 37 ms 4960 KB OK (n = 150000, answer = NO)
99 Correct 120 ms 12908 KB OK (n = 200000, answer = YES)
100 Correct 202 ms 13036 KB OK (n = 200000, answer = NO)
101 Correct 97 ms 12392 KB OK (n = 200000, answer = YES)
102 Correct 54 ms 3564 KB OK (n = 200000, answer = YES)
103 Correct 52 ms 3564 KB OK (n = 200000, answer = YES)
104 Correct 200 ms 13024 KB OK (n = 200000, answer = YES)
105 Correct 50 ms 5728 KB OK (n = 200000, answer = NO)
106 Correct 99 ms 12008 KB OK (n = 200000, answer = YES)
107 Correct 52 ms 3564 KB OK (n = 200000, answer = NO)
108 Correct 50 ms 5728 KB OK (n = 200000, answer = NO)
109 Correct 51 ms 5856 KB OK (n = 200000, answer = NO)
110 Correct 41 ms 3564 KB OK (n = 200000, answer = YES)
111 Correct 87 ms 12908 KB OK (n = 200000, answer = YES)
112 Correct 180 ms 12908 KB OK (n = 200000, answer = YES)
113 Correct 46 ms 3820 KB OK (n = 200000, answer = YES)
114 Correct 140 ms 12524 KB OK (n = 200000, answer = YES)
115 Correct 131 ms 12652 KB OK (n = 200000, answer = YES)
116 Correct 209 ms 13036 KB OK (n = 200000, answer = YES)
117 Correct 46 ms 3564 KB OK (n = 200000, answer = YES)