oj.uz

Submission #798925

# Submission time Handle Problem Language Result Execution time Memory
798925 2023-07-31T07:29:15 Z IsaL Detecting Molecules (IOI16_molecules) C++17
100 / 100
 43 ms 6236 KB 
#include "molecules.h" 
#include<bits/stdc++.h>

using namespace std;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long, long long>
// jangan kebiasa kalah
// kalo OI, sampah aja dulu, tapi jangan menutup kemungkinan buat AC

vector<int> find_subset(int l, int u, std::vector<int> w) 
{
    int i, j, batas = 0;
    vector<long long> pref((int)w.size(), 0);
    vector<pair<int, int>> vec;
    for(i=0;i<(int)w.size();i++)
    {
        vec.push_back({w[i], i});
    }
    sort(vec.begin(), vec.end());
    for(i=0;i<(int)w.size();i++)
    {
        pref[i] = (long long)vec[i].fi;
        if(i)
        {
            pref[i] += pref[i-1];
        }
    }
    for(i=0;i<(int)w.size();i++)
    {
        if(pref[i] < (long long)l) continue;
        if((long long)l <= pref[i] and pref[i] <= (long long)u)
        {
            vector<int> res;
            for(j=0;j<=i;j++)
            {
                res.push_back(vec[j].se);
            }
            return res;
        }
        else
        {
            int lo = 1, hi = i, mid, sum = 0;
            for(mid=(lo+hi)/2;lo<=hi;mid=(lo+hi)/2)
            {
                long long cur = pref[i] - pref[mid-1];
                if(cur > (long long)u)
                {
                    lo = mid+1;
                }
                else if(cur < (long long)l)
                {
                    hi = mid-1;
                }
                else if((long long)l <= cur and cur <= (long long)u)
                {
                    vector<int> res;
                    for(j=mid;j<=i;j++)
                    {
                        res.push_back(vec[j].se);
                    }
                    return res;
                }
            }
        }
    }
    return vector<int>(0);
}

// int main()
// {
//     ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//     vector<int> res = find_subset(10, 20, {15, 17, 16, 18});
//     for(auto x : res)
//     {
//         cout<<x<<endl;
//     }
// }

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:45:38: warning: unused variable 'sum' [-Wunused-variable]
   45 |             int lo = 1, hi = i, mid, sum = 0;
      |                                      ^~~
molecules.cpp:15:15: warning: unused variable 'batas' [-Wunused-variable]
   15 |     int i, j, batas = 0;
      |               ^~~~~

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 304 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 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 256 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 300 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 1 ms 212 KB OK (n = 12, answer = YES)
2 Correct 0 ms 296 KB OK (n = 12, answer = YES)
3 Correct 1 ms 212 KB OK (n = 12, answer = NO)
4 Correct 0 ms 212 KB OK (n = 12, answer = NO)
5 Correct 1 ms 212 KB OK (n = 12, answer = YES)
6 Correct 0 ms 212 KB OK (n = 12, answer = YES)
7 Correct 1 ms 296 KB OK (n = 12, answer = YES)
8 Correct 1 ms 212 KB OK (n = 12, answer = YES)
9 Correct 1 ms 212 KB OK (n = 6, answer = YES)
10 Correct 1 ms 212 KB OK (n = 12, answer = YES)
11 Correct 1 ms 304 KB OK (n = 100, answer = NO)
12 Correct 0 ms 212 KB OK (n = 100, answer = YES)
13 Correct 0 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 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 304 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 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 256 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 300 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 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 296 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 296 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 304 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 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 300 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 296 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 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 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 304 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 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 256 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 300 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 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 296 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 296 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 304 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 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 300 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 296 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 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 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 696 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 644 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 648 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 628 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 300 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 304 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 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 256 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 300 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 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 296 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 296 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 304 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 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 300 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 296 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 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 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 696 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 644 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 648 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 628 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 300 KB OK (n = 820, answer = YES)
74 Correct 2 ms 596 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 696 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 2 ms 632 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 596 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 692 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 696 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 636 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 596 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 304 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 296 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 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 256 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 300 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 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 296 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 296 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 304 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 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 300 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 296 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 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 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 696 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 644 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 648 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 628 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 300 KB OK (n = 820, answer = YES)
74 Correct 2 ms 596 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 696 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 2 ms 632 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 596 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 692 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 696 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 644 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 696 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 636 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 212 KB OK (n = 1, answer = YES)
95 Correct 1 ms 212 KB OK (n = 3, answer = YES)
96 Correct 0 ms 220 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 24 ms 5320 KB OK (n = 150000, answer = NO)
99 Correct 36 ms 6236 KB OK (n = 200000, answer = YES)
100 Correct 43 ms 5956 KB OK (n = 200000, answer = NO)
101 Correct 37 ms 5824 KB OK (n = 200000, answer = YES)
102 Correct 40 ms 6084 KB OK (n = 200000, answer = YES)
103 Correct 36 ms 5840 KB OK (n = 200000, answer = YES)
104 Correct 38 ms 5756 KB OK (n = 200000, answer = YES)
105 Correct 33 ms 5804 KB OK (n = 200000, answer = NO)
106 Correct 40 ms 5828 KB OK (n = 200000, answer = YES)
107 Correct 39 ms 5852 KB OK (n = 200000, answer = NO)
108 Correct 34 ms 5736 KB OK (n = 200000, answer = NO)
109 Correct 33 ms 5704 KB OK (n = 200000, answer = NO)
110 Correct 31 ms 5708 KB OK (n = 200000, answer = YES)
111 Correct 23 ms 5720 KB OK (n = 200000, answer = YES)
112 Correct 26 ms 5784 KB OK (n = 200000, answer = YES)
113 Correct 24 ms 5824 KB OK (n = 200000, answer = YES)
114 Correct 28 ms 5732 KB OK (n = 200000, answer = YES)
115 Correct 27 ms 5740 KB OK (n = 200000, answer = YES)
116 Correct 33 ms 5740 KB OK (n = 200000, answer = YES)
117 Correct 31 ms 5568 KB OK (n = 200000, answer = YES)