oj.uz

답안 #787044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787044 2023-07-18T17:00:40 Z hariaakas646 Detecting Molecules (IOI16_molecules) C++17
100 / 100
 39 ms 5576 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long int li;
typedef unsigned long int uli;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

vi find_subset(int l, int u, vi w)
{
    int n = w.size();

    vii w2(n);
    frange(i, n)
    {
        w2[i] = {w[i], i};
    }
    sort(all(w2));
    vi out = {};
    int id = 0;
    lli v = 0;
    while (id < n && v <= u)
    {
        v += w2[id].f;
        out.pb(w2[id].s);
        id++;
    }
    // cout << v << "\n";
    if (v < l)
    {
        out = {};
        // cout << "a\n";
        return out;
    }
    else
    {
        if (v <= u)
        {
            // cout << "b\n";
            return out;
        }
        id--;
        v -= w2[id].f;

        out.pop_back();
        int k = 0;
        for (int i = n - 1; i >= id; i--)
        {
            if (v >= l)
                break;
            if (k >= out.size())
                break;
            v += w2[i].f - w2[k].f;
            out[k] = w2[i].s;
            k++;
        }
        if (v >= l && v <= u)
        {
            return out;
        }
        else
        {
            // cout << "c\n";
            out = {};
            return out;
        }
    }
}

// int main()
// {
//     int n, a, b;
//     cin >> n >> a >> b;
//     vi vec(n);
//     frange(i, n) cin >> vec[i];
//     vi out = find_subset(a, b, vec);

//     for (auto e : out)
//         cout << e << " ";
// }

Compilation message

molecules.cpp: In function 'vi find_subset(int, int, vi)':
molecules.cpp:77:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |             if (k >= out.size())
      |                 ~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 296 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 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 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 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 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB OK (n = 12, answer = YES)
2 Correct 1 ms 212 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 0 ms 304 KB OK (n = 12, answer = YES)
6 Correct 1 ms 212 KB OK (n = 12, answer = YES)
7 Correct 1 ms 300 KB OK (n = 12, answer = YES)
8 Correct 1 ms 296 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 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 1 ms 296 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 1 ms 292 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 296 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 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 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 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 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 300 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 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 0 ms 304 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 296 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 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 1 ms 296 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 1 ms 292 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 340 KB OK (n = 27, answer = YES)
39 Correct 0 ms 300 KB OK (n = 90, answer = YES)
40 Correct 1 ms 292 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 0 ms 296 KB OK (n = 100, answer = YES)
44 Correct 0 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 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 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 296 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 296 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 296 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 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 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 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 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 300 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 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 0 ms 304 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 296 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 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 1 ms 296 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 1 ms 292 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 340 KB OK (n = 27, answer = YES)
39 Correct 0 ms 300 KB OK (n = 90, answer = YES)
40 Correct 1 ms 292 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 0 ms 296 KB OK (n = 100, answer = YES)
44 Correct 0 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 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 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 296 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 296 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 388 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 440 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 376 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 296 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 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 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 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 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 300 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 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 0 ms 304 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 296 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 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 1 ms 296 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 1 ms 292 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 340 KB OK (n = 27, answer = YES)
39 Correct 0 ms 300 KB OK (n = 90, answer = YES)
40 Correct 1 ms 292 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 0 ms 296 KB OK (n = 100, answer = YES)
44 Correct 0 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 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 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 296 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 296 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 388 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 440 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 376 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 1 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 564 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 384 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 444 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 296 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 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 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 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 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 300 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 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 0 ms 304 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 296 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 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 1 ms 296 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 1 ms 292 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 340 KB OK (n = 27, answer = YES)
39 Correct 0 ms 300 KB OK (n = 90, answer = YES)
40 Correct 1 ms 292 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 0 ms 296 KB OK (n = 100, answer = YES)
44 Correct 0 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 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 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 296 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 296 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 388 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 440 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 376 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 1 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 564 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 384 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 444 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 300 KB OK (n = 1, answer = YES)
95 Correct 0 ms 212 KB OK (n = 3, answer = YES)
96 Correct 0 ms 212 KB OK (n = 3, answer = NO)
97 Correct 0 ms 212 KB OK (n = 3, answer = YES)
98 Correct 23 ms 4604 KB OK (n = 150000, answer = NO)
99 Correct 39 ms 4944 KB OK (n = 200000, answer = YES)
100 Correct 38 ms 5576 KB OK (n = 200000, answer = NO)
101 Correct 35 ms 4912 KB OK (n = 200000, answer = YES)
102 Correct 34 ms 5420 KB OK (n = 200000, answer = YES)
103 Correct 33 ms 4892 KB OK (n = 200000, answer = YES)
104 Correct 33 ms 4836 KB OK (n = 200000, answer = YES)
105 Correct 32 ms 5332 KB OK (n = 200000, answer = NO)
106 Correct 35 ms 4908 KB OK (n = 200000, answer = YES)
107 Correct 33 ms 5552 KB OK (n = 200000, answer = NO)
108 Correct 32 ms 5368 KB OK (n = 200000, answer = NO)
109 Correct 31 ms 5316 KB OK (n = 200000, answer = NO)
110 Correct 27 ms 4284 KB OK (n = 200000, answer = YES)
111 Correct 21 ms 4556 KB OK (n = 200000, answer = YES)
112 Correct 20 ms 4508 KB OK (n = 200000, answer = YES)
113 Correct 20 ms 4664 KB OK (n = 200000, answer = YES)
114 Correct 21 ms 4616 KB OK (n = 200000, answer = YES)
115 Correct 21 ms 4664 KB OK (n = 200000, answer = YES)
116 Correct 31 ms 4436 KB OK (n = 200000, answer = YES)
117 Correct 30 ms 4308 KB OK (n = 200000, answer = YES)