답안 #299385

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
299385 2020-09-14T20:05:28 Z oscarsierra12 Detecting Molecules (IOI16_molecules) C++14
100 / 100
85 ms 6252 KB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std ;

vector <pair<int,int>> wr ;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector <int> ans, ot ;
    if ( *min_element (w.begin(), w.end()) > u ) return std::vector<int>(0) ;
    for ( int i = 0 ; i < w.size() ; ++i ) {
        wr.push_back ( {w[i], i} ) ;
        if ( w[i] >= l && w[i] <= u ) {
            ans.push_back ( i ) ;
            return ans ;
        }
    }
    long long s = 0, so = 0 ;
    int sz = w.size() ;
    sort ( wr.begin(), wr.end() ) ;
    for ( int i = 0 ; i < sz ; ++i ) {
        s += wr[i].first ;
        so += wr[i].first ;
        if ( s >= l ) {
            if ( s <= u ) {
                ans.push_back ( wr[i].second ) ;
                sort ( ans.begin(), ans.end() ) ;
                return ans ;
            }
            s -= wr[i].first ;
            long long s2 = 0 ;
            for ( int j = sz - 1 ; j >= sz - i ; --j ) s2 += wr[j].first ;
            if ( s2 < l ) return std::vector <int> (0) ;
            for ( int j = sz - 1 ; j >= sz - i ; --j ) {
                s -= wr[ans.size()-1].first ;
                s += wr[j].first ;
                ans.pop_back() ;
                ot.push_back (wr[j].second) ;
                if ( s >= l && s <= u ) {
                    for ( auto k:ot ) ans.push_back ( k ) ;
                    sort ( ans.begin(), ans.end() ) ;
                    return ans ;
                }
            }
            break ;
        }
        ans.push_back ( wr[i].second ) ;
    }
    if ( so < l ) return std::vector<int>(0) ;
    return std::vector <int>(1) ;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for ( int i = 0 ; i < w.size() ; ++i ) {
      |                       ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 12, answer = YES)
2 Correct 0 ms 256 KB OK (n = 12, answer = YES)
3 Correct 0 ms 256 KB OK (n = 12, answer = NO)
4 Correct 0 ms 256 KB OK (n = 12, answer = NO)
5 Correct 0 ms 256 KB OK (n = 12, answer = YES)
6 Correct 0 ms 256 KB OK (n = 12, answer = YES)
7 Correct 0 ms 256 KB OK (n = 12, answer = YES)
8 Correct 0 ms 256 KB OK (n = 12, answer = YES)
9 Correct 0 ms 256 KB OK (n = 6, answer = YES)
10 Correct 1 ms 256 KB OK (n = 12, answer = YES)
11 Correct 0 ms 256 KB OK (n = 100, answer = NO)
12 Correct 0 ms 256 KB OK (n = 100, answer = YES)
13 Correct 0 ms 256 KB OK (n = 100, answer = NO)
14 Correct 0 ms 256 KB OK (n = 100, answer = YES)
15 Correct 0 ms 256 KB OK (n = 100, answer = YES)
16 Correct 1 ms 256 KB OK (n = 100, answer = YES)
17 Correct 1 ms 256 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 256 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 1 ms 256 KB OK (n = 100, answer = YES)
36 Correct 1 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 0 ms 384 KB OK (n = 100, answer = YES)
46 Correct 0 ms 384 KB OK (n = 100, answer = YES)
47 Correct 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 256 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 1 ms 256 KB OK (n = 100, answer = YES)
36 Correct 1 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 0 ms 384 KB OK (n = 100, answer = YES)
46 Correct 0 ms 384 KB OK (n = 100, answer = YES)
47 Correct 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 384 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 384 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 256 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 1 ms 256 KB OK (n = 100, answer = YES)
36 Correct 1 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 0 ms 384 KB OK (n = 100, answer = YES)
46 Correct 0 ms 384 KB OK (n = 100, answer = YES)
47 Correct 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 384 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 384 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
74 Correct 2 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
85 Correct 4 ms 512 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 256 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 1 ms 256 KB OK (n = 100, answer = YES)
36 Correct 1 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 0 ms 384 KB OK (n = 100, answer = YES)
46 Correct 0 ms 384 KB OK (n = 100, answer = YES)
47 Correct 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 384 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 384 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
74 Correct 2 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
85 Correct 4 ms 512 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 256 KB OK (n = 1, answer = YES)
95 Correct 1 ms 256 KB OK (n = 3, answer = YES)
96 Correct 1 ms 256 KB OK (n = 3, answer = NO)
97 Correct 1 ms 256 KB OK (n = 3, answer = YES)
98 Correct 40 ms 4328 KB OK (n = 150000, answer = NO)
99 Correct 63 ms 5612 KB OK (n = 200000, answer = YES)
100 Correct 65 ms 6252 KB OK (n = 200000, answer = NO)
101 Correct 85 ms 5484 KB OK (n = 200000, answer = YES)
102 Correct 44 ms 3960 KB OK (n = 200000, answer = YES)
103 Correct 53 ms 5612 KB OK (n = 200000, answer = YES)
104 Correct 59 ms 5484 KB OK (n = 200000, answer = YES)
105 Correct 54 ms 5992 KB OK (n = 200000, answer = NO)
106 Correct 63 ms 5356 KB OK (n = 200000, answer = YES)
107 Correct 43 ms 4088 KB OK (n = 200000, answer = NO)
108 Correct 51 ms 6024 KB OK (n = 200000, answer = NO)
109 Correct 56 ms 5996 KB OK (n = 200000, answer = NO)
110 Correct 45 ms 5100 KB OK (n = 200000, answer = YES)
111 Correct 34 ms 5228 KB OK (n = 200000, answer = YES)
112 Correct 36 ms 5228 KB OK (n = 200000, answer = YES)
113 Correct 36 ms 5236 KB OK (n = 200000, answer = YES)
114 Correct 46 ms 5228 KB OK (n = 200000, answer = YES)
115 Correct 39 ms 5228 KB OK (n = 200000, answer = YES)
116 Correct 45 ms 5236 KB OK (n = 200000, answer = YES)
117 Correct 44 ms 5100 KB OK (n = 200000, answer = YES)