oj.uz

Submission #716671

# Submission time Handle Problem Language Result Execution time Memory
716671 2023-03-30T18:42:30 Z nihaddhuseynli Detecting Molecules (IOI16_molecules) C++14
100 / 100
 47 ms 8216 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
struct segtree{
    int size;
    vector<ll> values;
     void build(vector<int> &a,int x,int lx,int rx){
        if(rx-lx==1){
            if(lx<(int)a.size()){
                values[x]=a[lx];
            }
            return;
        }
        int m=(lx+rx)/2;
        build(a,2*x+1,lx,m);
        build(a,2*x+2,m,rx);
        values[x]=min(values[2*x+1],values[2*x+2]);
    }
    void build(vector<int> &a){
        build(a,0,0,size);
    }
    void init(int n){
        size=1;
        while(size<n){
            size*=2;
        }
        values.assign(2*size,0LL);
    }
    ll calc(int l,int r,int x,int lx,int rx){
        if(lx>=r || rx<=l){
            return INT_MAX;
        }
        if(lx>=l && rx<=r){
            return values[x];
        }
        ll s1,s2;
        int m=(lx+rx)/2;
        s1=calc(l,r,2*x+1,lx,m);
        s2=calc(l,r,2*x+2,m,rx);
        return min(s1,s2);
    }
    ll calc(int l,int r){
        return calc(l,r,0,0,size);
    }
};
struct segtree1{
    int size;
    vector<ll> values;
     void build(vector<int> &a,int x,int lx,int rx){
        if(rx-lx==1){
            if(lx<(int)a.size()){
                values[x]=a[lx];
            }
            return;
        }
        int m=(lx+rx)/2;
        build(a,2*x+1,lx,m);
        build(a,2*x+2,m,rx);
        values[x]=max(values[2*x+1],values[2*x+2]);
    }
    void build(vector<int> &a){
        build(a,0,0,size);
    }
    void init(int n){
        size=1;
        while(size<n){
            size*=2;
        }
        values.assign(2*size,INT_MIN);
    }
    ll calc(int l,int r,int x,int lx,int rx){
        if(lx>=r || rx<=l){
            return INT_MIN;
        }
        if(lx>=l && rx<=r){
            return values[x];
        }
        ll s1,s2;
        int m=(lx+rx)/2;
        s1=calc(l,r,2*x+1,lx,m);
        s2=calc(l,r,2*x+2,m,rx);
        return max(s1,s2);
    }
    ll calc(int l,int r){
        return calc(l,r,0,0,size);
    }
};
vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<int> ans;
    ll n=w.size();
    ll a[n+5];
    segtree st;
    vector<pair<ll,ll>> v;
    for(int i =0;i<n;i++)
    {
        v.push_back({w[i],i});
    }
    sort(v.begin(),v.end());
    int j =0;
    ll sum=0;
    for(int i =0;i<n;i++)
    {
        sum+=v[i].first;
        while(sum>u)
        {
            sum-=v[j++].first;
        }
        if(sum>=l)
        {
            for(int k =j;k<=i;k++)
            {
                ans.push_back(v[k].second);
            }
            break;
        }

    }
    
    return ans;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:92:8: warning: unused variable 'a' [-Wunused-variable]
   92 |     ll a[n+5];
      |        ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory 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 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 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 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 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

# Verdict Execution time Memory 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 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 0 ms 212 KB OK (n = 100, answer = YES)
15 Correct 1 ms 212 KB OK (n = 100, answer = YES)
16 Correct 1 ms 304 KB OK (n = 100, answer = YES)
17 Correct 1 ms 296 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory 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 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 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 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 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 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 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 0 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 304 KB OK (n = 100, answer = YES)
36 Correct 1 ms 296 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 300 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 304 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 300 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 296 KB OK (n = 100, answer = YES)
52 Correct 1 ms 304 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

# Verdict Execution time Memory 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 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 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 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 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 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 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 0 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 304 KB OK (n = 100, answer = YES)
36 Correct 1 ms 296 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 300 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 304 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 300 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 296 KB OK (n = 100, answer = YES)
52 Correct 1 ms 304 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 2 ms 752 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 692 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 724 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 696 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 252 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory 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 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 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 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 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 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 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 0 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 304 KB OK (n = 100, answer = YES)
36 Correct 1 ms 296 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 300 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 304 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 300 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 296 KB OK (n = 100, answer = YES)
52 Correct 1 ms 304 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 2 ms 752 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 692 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 724 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 696 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 252 KB OK (n = 820, answer = YES)
74 Correct 2 ms 596 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 752 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 772 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 824 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 724 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 724 KB OK (n = 10000, answer = YES)
87 Correct 5 ms 760 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 692 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 772 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 724 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory 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 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 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 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 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 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 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 0 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 304 KB OK (n = 100, answer = YES)
36 Correct 1 ms 296 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 300 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 304 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 300 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 296 KB OK (n = 100, answer = YES)
52 Correct 1 ms 304 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 2 ms 752 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 692 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 724 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 696 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 252 KB OK (n = 820, answer = YES)
74 Correct 2 ms 596 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 752 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 772 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 824 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 724 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 724 KB OK (n = 10000, answer = YES)
87 Correct 5 ms 760 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 692 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 772 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 300 KB OK (n = 1, answer = YES)
95 Correct 1 ms 300 KB OK (n = 3, answer = YES)
96 Correct 1 ms 212 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 31 ms 6488 KB OK (n = 150000, answer = NO)
99 Correct 43 ms 7612 KB OK (n = 200000, answer = YES)
100 Correct 45 ms 8216 KB OK (n = 200000, answer = NO)
101 Correct 43 ms 7468 KB OK (n = 200000, answer = YES)
102 Correct 44 ms 8124 KB OK (n = 200000, answer = YES)
103 Correct 42 ms 7592 KB OK (n = 200000, answer = YES)
104 Correct 41 ms 7448 KB OK (n = 200000, answer = YES)
105 Correct 37 ms 6852 KB OK (n = 200000, answer = NO)
106 Correct 47 ms 7328 KB OK (n = 200000, answer = YES)
107 Correct 43 ms 8196 KB OK (n = 200000, answer = NO)
108 Correct 38 ms 6820 KB OK (n = 200000, answer = NO)
109 Correct 40 ms 6820 KB OK (n = 200000, answer = NO)
110 Correct 34 ms 6988 KB OK (n = 200000, answer = YES)
111 Correct 28 ms 7180 KB OK (n = 200000, answer = YES)
112 Correct 26 ms 7080 KB OK (n = 200000, answer = YES)
113 Correct 28 ms 7208 KB OK (n = 200000, answer = YES)
114 Correct 31 ms 7152 KB OK (n = 200000, answer = YES)
115 Correct 35 ms 7204 KB OK (n = 200000, answer = YES)
116 Correct 36 ms 6972 KB OK (n = 200000, answer = YES)
117 Correct 43 ms 7068 KB OK (n = 200000, answer = YES)