oj.uz

Submission #869901

# Submission time Handle Problem Language Result Execution time Memory
869901 2023-11-06T07:57:45 Z Matjaz Detecting Molecules (IOI16_molecules) C++14
100 / 100
 37 ms 8028 KB 
#include "molecules.h"
#include <vector>
#include <algorithm>
 
using namespace std;
 
vector<long long> s;
long long total;
int N;
vector<pair<int,int> > tmp;
int l,u;
vector<int> w;
 
long long sum(int small, int big){
    return s[small] + total - s[N - big];
}
 
vector<int> output_vector(int small, int big, int position){
    vector<int> v;
    
    for (int i=0;i<small;i++) v.push_back(tmp[i].second);
    
    if (position != -1) v.push_back(tmp[position].second);
    
    for (int i=N-big;i<N;i++) v.push_back(tmp[i].second);
    
    return v;
}
 
bool works(int small, int big, int position){
    
    long long weight = sum(small, big) + (position != -1 ? w[position] : 0);
    
    //printf("%d %d %d: %lld\n", small, big, position, weight);
    
    if (l <= weight && weight <= u) return true;
    
    return false;
}
 
 
 
std::vector<int> find_subset(int _l, int _u, std::vector<int> _w) {
    l = _l;
    u = _u;
    w = _w;
    total = 0;
    N = w.size();
    for (int i=0;i<N;i++) total += w[i];
    
    tmp.assign(N, make_pair(-1,-1));
    for (int i=0;i<N;i++){
        tmp[i].first = w[i];
        tmp[i].second = i;
    }
    sort(tmp.begin(), tmp.end());
    for (int i=0;i<N;i++) w[i] = tmp[i].first;
    
    s.assign(N + 1, 0);
    s[0] = 0;
    for(int i=0;i<N;i++) s[i + 1] = s[i] + w[i];
    
    int l_count = 1;
    int u_count = N;
 
    while (l_count <= u_count){
        
        int count = l_count + (u_count - l_count) / 2;
        //printf("%d\n", count);
        if (sum(0, count) < l) {
            l_count = count + 1;
            continue;
        }
        if (u < sum(count, 0)) {
            u_count = count - 1;
            continue;
        }
        for (int left=count; left>0;left--){
            
            int l_traveler = left - 1;
            int u_traveler = N - count + left - 1;
            
            while (l_traveler <= u_traveler){
                int traveler = l_traveler + (u_traveler - l_traveler) / 2;
                if (works(left - 1, count - left, traveler)) return output_vector(left - 1, count - left, traveler);
                
                if (sum(left - 1 , count - left) + w[traveler] < l){
                    l_traveler = traveler + 1;
                } else u_traveler = traveler - 1;
            }
        }
    }
    
    return std::vector<int>(0);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 ms 348 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 0 ms 348 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 348 KB OK (n = 3, answer = NO)
17 Correct 0 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB OK (n = 12, answer = YES)
2 Correct 0 ms 348 KB OK (n = 12, answer = YES)
3 Correct 0 ms 348 KB OK (n = 12, answer = NO)
4 Correct 0 ms 348 KB OK (n = 12, answer = NO)
5 Correct 0 ms 348 KB OK (n = 12, answer = YES)
6 Correct 0 ms 344 KB OK (n = 12, answer = YES)
7 Correct 0 ms 344 KB OK (n = 12, answer = YES)
8 Correct 0 ms 348 KB OK (n = 12, answer = YES)
9 Correct 0 ms 348 KB OK (n = 6, answer = YES)
10 Correct 0 ms 348 KB OK (n = 12, answer = YES)
11 Correct 0 ms 348 KB OK (n = 100, answer = NO)
12 Correct 0 ms 348 KB OK (n = 100, answer = YES)
13 Correct 0 ms 344 KB OK (n = 100, answer = NO)
14 Correct 0 ms 600 KB OK (n = 100, answer = YES)
15 Correct 0 ms 348 KB OK (n = 100, answer = YES)
16 Correct 0 ms 348 KB OK (n = 100, answer = YES)
17 Correct 0 ms 344 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 ms 348 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 0 ms 348 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 348 KB OK (n = 3, answer = NO)
17 Correct 0 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Correct 0 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 348 KB OK (n = 12, answer = YES)
22 Correct 0 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 348 KB OK (n = 12, answer = NO)
24 Correct 0 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 344 KB OK (n = 12, answer = YES)
26 Correct 0 ms 344 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 0 ms 348 KB OK (n = 6, answer = YES)
29 Correct 0 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 348 KB OK (n = 100, answer = NO)
31 Correct 0 ms 348 KB OK (n = 100, answer = YES)
32 Correct 0 ms 344 KB OK (n = 100, answer = NO)
33 Correct 0 ms 600 KB OK (n = 100, answer = YES)
34 Correct 0 ms 348 KB OK (n = 100, answer = YES)
35 Correct 0 ms 348 KB OK (n = 100, answer = YES)
36 Correct 0 ms 344 KB OK (n = 100, answer = YES)
37 Correct 0 ms 348 KB OK (n = 28, answer = YES)
38 Correct 0 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 0 ms 348 KB OK (n = 100, answer = YES)
42 Correct 0 ms 348 KB OK (n = 10, answer = YES)
43 Correct 0 ms 500 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 0 ms 348 KB OK (n = 100, answer = NO)
49 Correct 0 ms 348 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 0 ms 344 KB OK (n = 100, answer = YES)
52 Correct 0 ms 344 KB OK (n = 100, answer = YES)
53 Correct 0 ms 348 KB OK (n = 100, answer = YES)
54 Correct 0 ms 348 KB OK (n = 100, answer = YES)
55 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 608 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 360 KB OK (n = 865, answer = YES)
73 Correct 0 ms 360 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 ms 348 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 0 ms 348 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 348 KB OK (n = 3, answer = NO)
17 Correct 0 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Correct 0 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 348 KB OK (n = 12, answer = YES)
22 Correct 0 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 348 KB OK (n = 12, answer = NO)
24 Correct 0 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 344 KB OK (n = 12, answer = YES)
26 Correct 0 ms 344 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 0 ms 348 KB OK (n = 6, answer = YES)
29 Correct 0 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 348 KB OK (n = 100, answer = NO)
31 Correct 0 ms 348 KB OK (n = 100, answer = YES)
32 Correct 0 ms 344 KB OK (n = 100, answer = NO)
33 Correct 0 ms 600 KB OK (n = 100, answer = YES)
34 Correct 0 ms 348 KB OK (n = 100, answer = YES)
35 Correct 0 ms 348 KB OK (n = 100, answer = YES)
36 Correct 0 ms 344 KB OK (n = 100, answer = YES)
37 Correct 0 ms 348 KB OK (n = 28, answer = YES)
38 Correct 0 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 0 ms 348 KB OK (n = 100, answer = YES)
42 Correct 0 ms 348 KB OK (n = 10, answer = YES)
43 Correct 0 ms 500 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 0 ms 348 KB OK (n = 100, answer = NO)
49 Correct 0 ms 348 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 0 ms 344 KB OK (n = 100, answer = YES)
52 Correct 0 ms 344 KB OK (n = 100, answer = YES)
53 Correct 0 ms 348 KB OK (n = 100, answer = YES)
54 Correct 0 ms 348 KB OK (n = 100, answer = YES)
55 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 608 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 360 KB OK (n = 865, answer = YES)
73 Correct 0 ms 360 KB OK (n = 820, answer = YES)
74 Correct 1 ms 616 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 616 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 856 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 344 KB OK (n = 1, answer = YES)
95 Correct 0 ms 348 KB OK (n = 3, answer = YES)
96 Correct 0 ms 348 KB OK (n = 3, answer = NO)
97 Correct 0 ms 348 KB OK (n = 3, answer = YES)
98 Correct 23 ms 4396 KB OK (n = 150000, answer = NO)
99 Correct 34 ms 5864 KB OK (n = 200000, answer = YES)
100 Correct 37 ms 5716 KB OK (n = 200000, answer = NO)
101 Correct 36 ms 5968 KB OK (n = 200000, answer = YES)
102 Correct 35 ms 7764 KB OK (n = 200000, answer = YES)
103 Correct 35 ms 7252 KB OK (n = 200000, answer = YES)
104 Correct 34 ms 7260 KB OK (n = 200000, answer = YES)
105 Correct 33 ms 6648 KB OK (n = 200000, answer = NO)
106 Correct 36 ms 7248 KB OK (n = 200000, answer = YES)
107 Correct 34 ms 8028 KB OK (n = 200000, answer = NO)
108 Correct 33 ms 6484 KB OK (n = 200000, answer = NO)
109 Correct 33 ms 6492 KB OK (n = 200000, answer = NO)
110 Correct 28 ms 6748 KB OK (n = 200000, answer = YES)
111 Correct 22 ms 7044 KB OK (n = 200000, answer = YES)
112 Correct 21 ms 6960 KB OK (n = 200000, answer = YES)
113 Correct 24 ms 6992 KB OK (n = 200000, answer = YES)
114 Correct 23 ms 6984 KB OK (n = 200000, answer = YES)
115 Correct 23 ms 7008 KB OK (n = 200000, answer = YES)
116 Correct 30 ms 6736 KB OK (n = 200000, answer = YES)
117 Correct 31 ms 6740 KB OK (n = 200000, answer = YES)