답안 #764293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764293 2023-06-23T10:13:27 Z marvinthang Detecting Molecules (IOI16_molecules) C++17
100 / 100
52 ms 5368 KB
/*************************************
*    author: marvinthang             *
*    created: 23.06.2023 17:11:58    *
*************************************/

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

vector <int> find_subset(int l, int u, vector <int> w) {
    int n = w.size();
    vector <pair <int, int>> v;
    REP(i, n) v.emplace_back(w[i], i);
    sort(ALL(v));
    long long pref = 0, suff = 0;
    REP(i, n) {
        pref += v[i].fi;
        suff += v[n - i - 1].fi;
        if (pref <= u && suff >= l) {
            vector <int> res;
            FORE(j, i + 1, n) {
                if (pref >= l) {
                    FOR(k, j - i - 1, j) res.push_back(v[k].se);
                    break;
                }
                pref += v[j].fi - v[j - i - 1].fi;
            }
            return res;
        }
    }
    return vector<int>();
}

#ifdef LOCAL
#include <cstdio>
#include <vector>
#include <cassert>

#include "molecules.h"

int main() {
    file("molecules");
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);
    
    
    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}
#endif
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 340 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 296 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 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 232 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 12, answer = YES)
2 Correct 1 ms 212 KB OK (n = 12, answer = YES)
3 Correct 0 ms 212 KB OK (n = 12, answer = NO)
4 Correct 1 ms 296 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 0 ms 296 KB OK (n = 12, answer = YES)
8 Correct 1 ms 212 KB OK (n = 12, answer = YES)
9 Correct 1 ms 304 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 1 ms 212 KB OK (n = 100, answer = YES)
13 Correct 1 ms 296 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 212 KB OK (n = 100, answer = YES)
17 Correct 0 ms 212 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 340 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 296 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 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 232 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 296 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 0 ms 296 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 304 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 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 296 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 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 300 KB OK (n = 28, answer = YES)
38 Correct 0 ms 296 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 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 340 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 296 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 340 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 296 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 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 232 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 296 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 0 ms 296 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 304 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 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 296 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 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 300 KB OK (n = 28, answer = YES)
38 Correct 0 ms 296 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 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 340 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 296 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 556 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 596 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 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 636 KB OK (n = 10000, answer = YES)
71 Correct 2 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)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 340 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 296 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 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 232 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 296 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 0 ms 296 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 304 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 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 296 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 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 300 KB OK (n = 28, answer = YES)
38 Correct 0 ms 296 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 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 340 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 296 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 556 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 596 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 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 636 KB OK (n = 10000, answer = YES)
71 Correct 2 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 468 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 572 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 568 KB OK (n = 10000, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 340 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 296 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 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 232 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 296 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 0 ms 296 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 304 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 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 296 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 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 300 KB OK (n = 28, answer = YES)
38 Correct 0 ms 296 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 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 340 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 296 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 556 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 596 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 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 636 KB OK (n = 10000, answer = YES)
71 Correct 2 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 468 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 572 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 568 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 212 KB OK (n = 1, answer = YES)
95 Correct 1 ms 300 KB OK (n = 3, answer = YES)
96 Correct 1 ms 296 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 29 ms 4456 KB OK (n = 150000, answer = NO)
99 Correct 36 ms 5240 KB OK (n = 200000, answer = YES)
100 Correct 40 ms 5368 KB OK (n = 200000, answer = NO)
101 Correct 37 ms 5200 KB OK (n = 200000, answer = YES)
102 Correct 35 ms 5260 KB OK (n = 200000, answer = YES)
103 Correct 47 ms 5240 KB OK (n = 200000, answer = YES)
104 Correct 34 ms 5264 KB OK (n = 200000, answer = YES)
105 Correct 32 ms 4780 KB OK (n = 200000, answer = NO)
106 Correct 36 ms 5280 KB OK (n = 200000, answer = YES)
107 Correct 52 ms 5308 KB OK (n = 200000, answer = NO)
108 Correct 35 ms 4780 KB OK (n = 200000, answer = NO)
109 Correct 32 ms 4800 KB OK (n = 200000, answer = NO)
110 Correct 42 ms 4936 KB OK (n = 200000, answer = YES)
111 Correct 22 ms 5192 KB OK (n = 200000, answer = YES)
112 Correct 35 ms 5080 KB OK (n = 200000, answer = YES)
113 Correct 21 ms 5156 KB OK (n = 200000, answer = YES)
114 Correct 22 ms 5192 KB OK (n = 200000, answer = YES)
115 Correct 27 ms 5160 KB OK (n = 200000, answer = YES)
116 Correct 30 ms 5016 KB OK (n = 200000, answer = YES)
117 Correct 41 ms 4936 KB OK (n = 200000, answer = YES)