oj.uz

답안 #524751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524751 2022-02-09T23:53:55 Z vijay Detecting Molecules (IOI16_molecules) C++
100 / 100
 50 ms 5540 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <bitset>
using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;

#define trav(a, x) for (auto& a: x)
#define all(x) begin(x), end(x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define NUM(a) (sizeof(a)/sizeof(*a))

vector<int> find_subset(int l, int u, vector<int> w){

  vector<int> result;
  int n = w.size();
  vector<pair<int, int> > a(n, pair<int, int>());
  for(int i = 0; i < n; i++){
    a[i] = mp(w[i], i);
  }
  sort(a.begin(), a.end());

  int right = 0;
  int left = 0;
  ll sum = 0;
  while(left < n){
    while(right < n && sum < l){
      sum += a[right].f;
      right++;
    }

    if(sum >= l && sum <= u){
      vector<int> result;
      for(int i = left; i < right; i++){
        result.pb(a[i].s);
      }
      return result;
    }

    sum -= a[left].f;
    left++;
  }

  //
  // for(int i = 0; i < n; i++){
  //   cout << a[i].f << " " << a[i].s << "\n";
  // }

  // vector<int> minSum(n + 1, 0);
  // vector<int> maxSum(n + 1, 0);
  // for(int k = 1; k <= n; k++){
  //   minSum[k] = minSum[k - 1] + a[k - 1].f;
  //   maxSum[k] = maxSum[k - 1] + a[n - k].f;
  // }
  //
  // for(int k = 1; k <= n; k++){
  //   if(minSum[k] <= u && maxSum[k] >= l){
  //     // this could fit within the range!
  //     // System.out.println("this could fit within the range! " + k);
  //     int currSum = minSum[k];
  //     int idx = k;
  //     while(idx <= n){
  //       if(currSum >= l && currSum <= u){
  //         // System.out.println(k);
  //         for(int i = idx - k; i < idx; i++){
  //           result.pb(a[i].s);
  //         }
  //         return result;
  //       }
  //
  //       if(idx == n){
  //         break;
  //       }
  //
  //       currSum += a[idx].f;
  //       currSum -= a[idx - k].f;
  //       idx++;
  //     }
  //   }
  // }

  result.resize(0);
  return result;
}

// int main(){
//   ios_base::sync_with_stdio(0);
//   cin.tie(0);
//
//   vector<int> tc;
//   tc.pb(6);tc.pb(8);tc.pb(8);tc.pb(7);
//   vector<int> v = find_subset(15, 17, tc);
//   for(auto& a: v){
//     cout << a << "\n";
//   }
// }

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 216 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 0 ms 204 KB OK (n = 100, answer = YES)
35 Correct 0 ms 204 KB OK (n = 100, answer = YES)
36 Correct 0 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 0 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 332 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 332 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 332 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 440 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 2 ms 332 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 324 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 332 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 332 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 332 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 332 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 332 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 332 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 204 KB OK (n = 1, answer = YES)
95 Correct 0 ms 204 KB OK (n = 3, answer = YES)
96 Correct 0 ms 204 KB OK (n = 3, answer = NO)
97 Correct 0 ms 204 KB OK (n = 3, answer = YES)
98 Correct 26 ms 2548 KB OK (n = 150000, answer = NO)
99 Correct 50 ms 3420 KB OK (n = 200000, answer = YES)
100 Correct 42 ms 5444 KB OK (n = 200000, answer = NO)
101 Correct 40 ms 4908 KB OK (n = 200000, answer = YES)
102 Correct 40 ms 5400 KB OK (n = 200000, answer = YES)
103 Correct 38 ms 4932 KB OK (n = 200000, answer = YES)
104 Correct 49 ms 4760 KB OK (n = 200000, answer = YES)
105 Correct 35 ms 4124 KB OK (n = 200000, answer = NO)
106 Correct 42 ms 4816 KB OK (n = 200000, answer = YES)
107 Correct 40 ms 5540 KB OK (n = 200000, answer = NO)
108 Correct 35 ms 4136 KB OK (n = 200000, answer = NO)
109 Correct 34 ms 4156 KB OK (n = 200000, answer = NO)
110 Correct 33 ms 4300 KB OK (n = 200000, answer = YES)
111 Correct 29 ms 4556 KB OK (n = 200000, answer = YES)
112 Correct 22 ms 4420 KB OK (n = 200000, answer = YES)
113 Correct 23 ms 4628 KB OK (n = 200000, answer = YES)
114 Correct 36 ms 4648 KB OK (n = 200000, answer = YES)
115 Correct 30 ms 4648 KB OK (n = 200000, answer = YES)
116 Correct 35 ms 4388 KB OK (n = 200000, answer = YES)
117 Correct 31 ms 4364 KB OK (n = 200000, answer = YES)