oj.uz

답안 #580580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
580580 2022-06-21T13:07:49 Z xynex Detecting Molecules (IOI16_molecules) C++17
100 / 100
 48 ms 6184 KB 
#include <bits/stdc++.h>

#include "molecules.h"

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 3e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vt<pr<int, int> > A;
    int pos = 0;
    ll sum = 0;
    int n = sz(w);
    for(int i = 0; i < n; ++i) {
      A.pb({w[i], i});
    }
    sort(all(A));
    for(int i = 0; i < n; ++i) {
      while(pos < n && sum < l) {
        sum += A[pos++].ff;
      }
      if(sum >= l && sum <= u) {
        vt<int> ans;
        for(int j = i; j < pos; ++j) {
          ans.pb(A[j].ss);
        }
        return ans;
      }
      sum -= A[i].ff;
    }
    return {};
}

Compilation message

molecules.cpp: In function 'void freop(std::string)':
molecules.cpp:56:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
molecules.cpp:57:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 300 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 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 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 296 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 300 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 212 KB OK (n = 12, answer = YES)
2 Correct 1 ms 276 KB OK (n = 12, answer = YES)
3 Correct 0 ms 300 KB OK (n = 12, answer = NO)
4 Correct 1 ms 212 KB OK (n = 12, answer = NO)
5 Correct 1 ms 296 KB OK (n = 12, answer = YES)
6 Correct 1 ms 212 KB OK (n = 12, answer = YES)
7 Correct 1 ms 212 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 328 KB OK (n = 12, answer = YES)
11 Correct 1 ms 212 KB OK (n = 100, answer = NO)
12 Correct 1 ms 212 KB OK (n = 100, answer = YES)
13 Correct 1 ms 212 KB OK (n = 100, answer = NO)
14 Correct 1 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 1 ms 212 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 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 300 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 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 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 296 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 300 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 276 KB OK (n = 12, answer = YES)
22 Correct 0 ms 300 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 296 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 212 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 328 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 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 1 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 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 300 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 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 1 ms 296 KB OK (n = 100, answer = NO)
50 Correct 1 ms 304 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 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)

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 300 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 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 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 296 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 300 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 276 KB OK (n = 12, answer = YES)
22 Correct 0 ms 300 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 296 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 212 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 328 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 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 1 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 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 300 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 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 1 ms 296 KB OK (n = 100, answer = NO)
50 Correct 1 ms 304 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 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 3 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 568 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 3 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 564 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 568 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 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 304 KB OK (n = 865, answer = YES)
73 Correct 1 ms 284 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 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 300 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 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 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 296 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 300 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 276 KB OK (n = 12, answer = YES)
22 Correct 0 ms 300 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 296 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 212 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 328 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 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 1 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 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 300 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 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 1 ms 296 KB OK (n = 100, answer = NO)
50 Correct 1 ms 304 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 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 3 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 568 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 3 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 564 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 568 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 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 304 KB OK (n = 865, answer = YES)
73 Correct 1 ms 284 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 564 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 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 636 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 628 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 568 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 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 300 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 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 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 296 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 300 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 276 KB OK (n = 12, answer = YES)
22 Correct 0 ms 300 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 296 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 212 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 328 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 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 1 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 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 300 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 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 1 ms 296 KB OK (n = 100, answer = NO)
50 Correct 1 ms 304 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 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 3 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 568 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 3 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 564 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 568 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 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 304 KB OK (n = 865, answer = YES)
73 Correct 1 ms 284 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 564 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 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 636 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 628 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 212 KB OK (n = 1, answer = YES)
95 Correct 1 ms 212 KB OK (n = 3, answer = YES)
96 Correct 1 ms 304 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 30 ms 4448 KB OK (n = 150000, answer = NO)
99 Correct 47 ms 5532 KB OK (n = 200000, answer = YES)
100 Correct 48 ms 6184 KB OK (n = 200000, answer = NO)
101 Correct 45 ms 5404 KB OK (n = 200000, answer = YES)
102 Correct 46 ms 6052 KB OK (n = 200000, answer = YES)
103 Correct 45 ms 5540 KB OK (n = 200000, answer = YES)
104 Correct 42 ms 5412 KB OK (n = 200000, answer = YES)
105 Correct 41 ms 4760 KB OK (n = 200000, answer = NO)
106 Correct 47 ms 5288 KB OK (n = 200000, answer = YES)
107 Correct 46 ms 6172 KB OK (n = 200000, answer = NO)
108 Correct 42 ms 4776 KB OK (n = 200000, answer = NO)
109 Correct 41 ms 4772 KB OK (n = 200000, answer = NO)
110 Correct 36 ms 4936 KB OK (n = 200000, answer = YES)
111 Correct 29 ms 5184 KB OK (n = 200000, answer = YES)
112 Correct 36 ms 5032 KB OK (n = 200000, answer = YES)
113 Correct 29 ms 5152 KB OK (n = 200000, answer = YES)
114 Correct 29 ms 5188 KB OK (n = 200000, answer = YES)
115 Correct 32 ms 5152 KB OK (n = 200000, answer = YES)
116 Correct 38 ms 5024 KB OK (n = 200000, answer = YES)
117 Correct 39 ms 5028 KB OK (n = 200000, answer = YES)