oj.uz

답안 #380750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
380750 2021-03-22T22:32:39 Z madlogic Detecting Molecules (IOI16_molecules) C++17
100 / 100
 170 ms 18388 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
  int n = (int) w.size();
  int xx = u, yy = l;
  l = min(xx, yy);
  u = max(xx, yy);
  const int mxxx = 10000;
  if (n <= mxxx && u <= mxxx) {
    vector<bool> dp(u + 1);
    dp[0] = true;
    vector<int> par(u + 1);
    vector<int> idx(u + 1);
    for (int i = 0; i < n; i++) {
      auto ndp = dp;
      for (int j = w[i]; j <= u; j++) {
        if (!dp[j] && dp[j - w[i]]) {
          ndp[j] = true;
          idx[j] = i;
          par[j] = j - w[i];
        }
      }
      dp = ndp;
    }
    vector<int> res;
    for (int i = l; i <= u; i++) {
      if (dp[i]) {
        while (par[i]) {
          res.push_back(idx[i]);
          i = par[i];
        }
        res.push_back(idx[i]);
        break;
      }
    }
    return res;
  } else {
    vector<pair<long long, int>> nums;
    for (int i = 0; i < n; i++) {
      if (w[i] <= u) {
        nums.emplace_back(w[i], i);
      }
    }
    sort(begin(nums), end(nums));
    long long cur = 0;
    multiset<pair<long long, int>> ms;
    for (auto& [x, y] : nums) {
      cur += x;
      ms.insert({x, y});
      while (!ms.empty() && cur > (long long) u) {
        long long remove = cur - (long long) u;
        pair<long long, int> lb;
        if (ms.lower_bound({remove, -1}) == ms.end())
          lb = *ms.rbegin();
        else
          lb = *(ms.lower_bound({remove, -1}));
        cur -= lb.first;
        ms.erase(ms.lower_bound({lb.first, lb.second}));
      }
      if (cur >= l) {
        vector<int> res;
        for (auto s : ms) {
          res.push_back(s.second);
        }
        return res;
      }
    }
  }
  return {};
}

// int main() {
//   int n, l, r;
//   cin >> n >> l >> r;
//   vector<int> a(n);
//   for (int i = 0; i < n; i++) {
//     cin >> a[i];
//   }
//   for (int p : find_subset(l, r, a)) {
//     cout << p << ' ';
//   }
// }

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 1 ms 364 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 12, answer = YES)
2 Correct 1 ms 364 KB OK (n = 12, answer = YES)
3 Correct 0 ms 364 KB OK (n = 12, answer = NO)
4 Correct 0 ms 364 KB OK (n = 12, answer = NO)
5 Correct 0 ms 364 KB OK (n = 12, answer = YES)
6 Correct 0 ms 364 KB OK (n = 12, answer = YES)
7 Correct 0 ms 364 KB OK (n = 12, answer = YES)
8 Correct 1 ms 364 KB OK (n = 12, answer = YES)
9 Correct 1 ms 364 KB OK (n = 6, answer = YES)
10 Correct 1 ms 364 KB OK (n = 12, answer = YES)
11 Correct 1 ms 364 KB OK (n = 100, answer = NO)
12 Correct 0 ms 364 KB OK (n = 100, answer = YES)
13 Correct 1 ms 364 KB OK (n = 100, answer = NO)
14 Correct 1 ms 364 KB OK (n = 100, answer = YES)
15 Correct 1 ms 364 KB OK (n = 100, answer = YES)
16 Correct 1 ms 364 KB OK (n = 100, answer = YES)
17 Correct 1 ms 364 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 1 ms 364 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 ms 364 KB OK (n = 12, answer = NO)
24 Correct 0 ms 364 KB OK (n = 12, answer = YES)
25 Correct 0 ms 364 KB OK (n = 12, answer = YES)
26 Correct 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 364 KB OK (n = 6, answer = YES)
29 Correct 1 ms 364 KB OK (n = 12, answer = YES)
30 Correct 1 ms 364 KB OK (n = 100, answer = NO)
31 Correct 0 ms 364 KB OK (n = 100, answer = YES)
32 Correct 1 ms 364 KB OK (n = 100, answer = NO)
33 Correct 1 ms 364 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 1 ms 364 KB OK (n = 28, answer = YES)
38 Correct 1 ms 364 KB OK (n = 27, answer = YES)
39 Correct 1 ms 364 KB OK (n = 90, answer = YES)
40 Correct 1 ms 364 KB OK (n = 100, answer = YES)
41 Correct 1 ms 364 KB OK (n = 100, answer = YES)
42 Correct 1 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 1 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 1 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 364 KB OK (n = 100, answer = NO)
49 Correct 1 ms 364 KB OK (n = 100, answer = NO)
50 Correct 1 ms 364 KB OK (n = 100, answer = YES)
51 Correct 1 ms 364 KB OK (n = 100, answer = YES)
52 Correct 1 ms 364 KB OK (n = 100, answer = YES)
53 Correct 1 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 156 ms 532 KB OK (n = 10000, answer = YES)
56 Correct 170 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 159 ms 500 KB OK (n = 10000, answer = YES)
58 Correct 148 ms 492 KB OK (n = 10000, answer = YES)
59 Correct 154 ms 492 KB OK (n = 10000, answer = YES)
60 Correct 66 ms 364 KB OK (n = 10000, answer = YES)
61 Correct 71 ms 364 KB OK (n = 10000, answer = NO)
62 Correct 122 ms 492 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 364 KB OK (n = 10000, answer = NO)
64 Correct 157 ms 492 KB OK (n = 10000, answer = YES)
65 Correct 154 ms 492 KB OK (n = 10000, answer = YES)
66 Correct 147 ms 620 KB OK (n = 10000, answer = YES)
67 Correct 16 ms 364 KB OK (n = 10000, answer = YES)
68 Correct 19 ms 364 KB OK (n = 10000, answer = YES)
69 Correct 124 ms 492 KB OK (n = 10000, answer = YES)
70 Correct 130 ms 492 KB OK (n = 10000, answer = YES)
71 Correct 128 ms 620 KB OK (n = 10000, answer = YES)
72 Correct 13 ms 364 KB OK (n = 865, answer = YES)
73 Correct 12 ms 364 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 1 ms 364 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 ms 364 KB OK (n = 12, answer = NO)
24 Correct 0 ms 364 KB OK (n = 12, answer = YES)
25 Correct 0 ms 364 KB OK (n = 12, answer = YES)
26 Correct 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 364 KB OK (n = 6, answer = YES)
29 Correct 1 ms 364 KB OK (n = 12, answer = YES)
30 Correct 1 ms 364 KB OK (n = 100, answer = NO)
31 Correct 0 ms 364 KB OK (n = 100, answer = YES)
32 Correct 1 ms 364 KB OK (n = 100, answer = NO)
33 Correct 1 ms 364 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 1 ms 364 KB OK (n = 28, answer = YES)
38 Correct 1 ms 364 KB OK (n = 27, answer = YES)
39 Correct 1 ms 364 KB OK (n = 90, answer = YES)
40 Correct 1 ms 364 KB OK (n = 100, answer = YES)
41 Correct 1 ms 364 KB OK (n = 100, answer = YES)
42 Correct 1 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 1 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 1 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 364 KB OK (n = 100, answer = NO)
49 Correct 1 ms 364 KB OK (n = 100, answer = NO)
50 Correct 1 ms 364 KB OK (n = 100, answer = YES)
51 Correct 1 ms 364 KB OK (n = 100, answer = YES)
52 Correct 1 ms 364 KB OK (n = 100, answer = YES)
53 Correct 1 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 156 ms 532 KB OK (n = 10000, answer = YES)
56 Correct 170 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 159 ms 500 KB OK (n = 10000, answer = YES)
58 Correct 148 ms 492 KB OK (n = 10000, answer = YES)
59 Correct 154 ms 492 KB OK (n = 10000, answer = YES)
60 Correct 66 ms 364 KB OK (n = 10000, answer = YES)
61 Correct 71 ms 364 KB OK (n = 10000, answer = NO)
62 Correct 122 ms 492 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 364 KB OK (n = 10000, answer = NO)
64 Correct 157 ms 492 KB OK (n = 10000, answer = YES)
65 Correct 154 ms 492 KB OK (n = 10000, answer = YES)
66 Correct 147 ms 620 KB OK (n = 10000, answer = YES)
67 Correct 16 ms 364 KB OK (n = 10000, answer = YES)
68 Correct 19 ms 364 KB OK (n = 10000, answer = YES)
69 Correct 124 ms 492 KB OK (n = 10000, answer = YES)
70 Correct 130 ms 492 KB OK (n = 10000, answer = YES)
71 Correct 128 ms 620 KB OK (n = 10000, answer = YES)
72 Correct 13 ms 364 KB OK (n = 865, answer = YES)
73 Correct 12 ms 364 KB OK (n = 820, answer = YES)
74 Correct 4 ms 1004 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 1128 KB OK (n = 10000, answer = NO)
76 Correct 5 ms 1128 KB OK (n = 10000, answer = NO)
77 Correct 5 ms 1128 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 1128 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 872 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 748 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 748 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 364 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 872 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 748 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 748 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 1 ms 364 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 ms 364 KB OK (n = 12, answer = NO)
24 Correct 0 ms 364 KB OK (n = 12, answer = YES)
25 Correct 0 ms 364 KB OK (n = 12, answer = YES)
26 Correct 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 364 KB OK (n = 6, answer = YES)
29 Correct 1 ms 364 KB OK (n = 12, answer = YES)
30 Correct 1 ms 364 KB OK (n = 100, answer = NO)
31 Correct 0 ms 364 KB OK (n = 100, answer = YES)
32 Correct 1 ms 364 KB OK (n = 100, answer = NO)
33 Correct 1 ms 364 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 1 ms 364 KB OK (n = 28, answer = YES)
38 Correct 1 ms 364 KB OK (n = 27, answer = YES)
39 Correct 1 ms 364 KB OK (n = 90, answer = YES)
40 Correct 1 ms 364 KB OK (n = 100, answer = YES)
41 Correct 1 ms 364 KB OK (n = 100, answer = YES)
42 Correct 1 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 1 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 1 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 364 KB OK (n = 100, answer = NO)
49 Correct 1 ms 364 KB OK (n = 100, answer = NO)
50 Correct 1 ms 364 KB OK (n = 100, answer = YES)
51 Correct 1 ms 364 KB OK (n = 100, answer = YES)
52 Correct 1 ms 364 KB OK (n = 100, answer = YES)
53 Correct 1 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 156 ms 532 KB OK (n = 10000, answer = YES)
56 Correct 170 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 159 ms 500 KB OK (n = 10000, answer = YES)
58 Correct 148 ms 492 KB OK (n = 10000, answer = YES)
59 Correct 154 ms 492 KB OK (n = 10000, answer = YES)
60 Correct 66 ms 364 KB OK (n = 10000, answer = YES)
61 Correct 71 ms 364 KB OK (n = 10000, answer = NO)
62 Correct 122 ms 492 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 364 KB OK (n = 10000, answer = NO)
64 Correct 157 ms 492 KB OK (n = 10000, answer = YES)
65 Correct 154 ms 492 KB OK (n = 10000, answer = YES)
66 Correct 147 ms 620 KB OK (n = 10000, answer = YES)
67 Correct 16 ms 364 KB OK (n = 10000, answer = YES)
68 Correct 19 ms 364 KB OK (n = 10000, answer = YES)
69 Correct 124 ms 492 KB OK (n = 10000, answer = YES)
70 Correct 130 ms 492 KB OK (n = 10000, answer = YES)
71 Correct 128 ms 620 KB OK (n = 10000, answer = YES)
72 Correct 13 ms 364 KB OK (n = 865, answer = YES)
73 Correct 12 ms 364 KB OK (n = 820, answer = YES)
74 Correct 4 ms 1004 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 1128 KB OK (n = 10000, answer = NO)
76 Correct 5 ms 1128 KB OK (n = 10000, answer = NO)
77 Correct 5 ms 1128 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 1128 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 872 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 748 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 748 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 364 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 872 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 748 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 364 KB OK (n = 1, answer = YES)
95 Correct 1 ms 364 KB OK (n = 3, answer = YES)
96 Correct 1 ms 364 KB OK (n = 3, answer = NO)
97 Correct 1 ms 364 KB OK (n = 3, answer = YES)
98 Correct 77 ms 14036 KB OK (n = 150000, answer = NO)
99 Correct 65 ms 7644 KB OK (n = 200000, answer = YES)
100 Correct 72 ms 8288 KB OK (n = 200000, answer = NO)
101 Correct 61 ms 7892 KB OK (n = 200000, answer = YES)
102 Correct 56 ms 8176 KB OK (n = 200000, answer = YES)
103 Correct 57 ms 7644 KB OK (n = 200000, answer = YES)
104 Correct 89 ms 7516 KB OK (n = 200000, answer = YES)
105 Correct 104 ms 18260 KB OK (n = 200000, answer = NO)
106 Correct 65 ms 8404 KB OK (n = 200000, answer = YES)
107 Correct 33 ms 4076 KB OK (n = 200000, answer = NO)
108 Correct 105 ms 18388 KB OK (n = 200000, answer = NO)
109 Correct 101 ms 18388 KB OK (n = 200000, answer = NO)
110 Correct 48 ms 7132 KB OK (n = 200000, answer = YES)
111 Correct 43 ms 7260 KB OK (n = 200000, answer = YES)
112 Correct 76 ms 7260 KB OK (n = 200000, answer = YES)
113 Correct 43 ms 7260 KB OK (n = 200000, answer = YES)
114 Correct 74 ms 7432 KB OK (n = 200000, answer = YES)
115 Correct 74 ms 7260 KB OK (n = 200000, answer = YES)
116 Correct 88 ms 7132 KB OK (n = 200000, answer = YES)
117 Correct 47 ms 7132 KB OK (n = 200000, answer = YES)