oj.uz

답안 #955677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955677 2024-03-31T10:09:11 Z lbm364dl Detecting Molecules (IOI16_molecules) C++14
100 / 100
 98 ms 9024 KB 
#include "molecules.h"
//#include <bits/stdc++.h>
#include <iostream>
#include <cassert>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <queue>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;

#ifdef LOCAL
#define show(x) cerr << #x" = " << (x) << "\n"
#else
#define show(x) 0
#endif

#define pb push_back
#define pp pop_back
#define mp make_pair
#define fst first
#define snd second
#define FOR(var, from, to) for(int var = from; var < int(to); ++var)
#define all(x) x.begin(), x.end()
#define rev(x) x.rbegin(), x.rend()
#define sz(x) int(x.size())
#define vec(x) vector<x>
#define INF 2000000000

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
// use unique second element of pair to work as multiset
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
const ll mod = 1000000007, mod2 = 998244353;

template<typename T, typename U> ostream &operator<<(ostream &os, pair<T,U> p){os << "(" << p.fst << "," << p.snd << ")"; return os;}
template<typename T, typename U> istream &operator>>(istream &is, pair<T,U> &p){is >> p.fst >> p.snd; return is;}
template<typename T> istream &operator>>(istream &is, vector<T> &v){FOR(i, 0, v.size()) is >> v[i]; return is;}
template<typename T> ostream &operator<<(ostream &os, vector<T> v){for(T x : v) os << x << " "; return os;}
template<typename T> ostream &operator<<(ostream &os, set<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T> ostream &operator<<(ostream &os, multiset<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T, typename U> ostream &operator<<(ostream &os, map<T,U> m){for(auto x : m) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_set s){for(int x : s) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_multiset s){for(pii x : s) os << x.fst << " "; return os;} 
ll mod_pow(ll a, ll b, ll m){ ll sol = 1; while(b){ if(b&1){ sol = (sol*a)%m; b--; }else{ a = (a*a)%m; b/=2; } } return sol;}
ll rem(ll a, ll b){ ll res = a%b; return res < 0 ? res+b : res; }

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
  int n = sz(w);
  vector<pii> v(n);
  FOR(i, 0, n){
    v[i] = {w[i], i};
  }
  sort(all(v));
  vector<ll> pref(n), suf(n);
  pref[0] = v[0].fst;
  suf[n-1] = v[n-1].fst;
  FOR(i, 1, n) pref[i] += pref[i-1] + v[i].fst;
  FOR(i, 1, n) suf[n-1-i] += suf[n-1-i+1] + v[n-1-i].fst;
  FOR(k, 1, n+1){
    if(pref[k-1] <= u && suf[n-k] >= l){
      set<int> s;
      ll tot = pref[k-1];
      FOR(i, 0, k) s.insert(v[i].snd);
      int i = 0;
      while(tot < l){
        s.erase(v[i].snd);
        tot -= v[i].fst;
        s.insert(v[i+k].snd);
        tot += v[i+k].fst;
        i++;
      }
      return vec(int)(all(s));
    }
  }
  return vec(int){};
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 1 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 1 ms 348 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 0 ms 348 KB OK (n = 3, answer = YES)
13 Correct 1 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 348 KB OK (n = 3, answer = NO)
17 Correct 0 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Correct 0 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 348 KB OK (n = 12, answer = YES)
22 Correct 0 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 348 KB OK (n = 12, answer = NO)
24 Correct 0 ms 344 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 348 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 1 ms 348 KB OK (n = 6, answer = YES)
29 Correct 0 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 348 KB OK (n = 100, answer = NO)
31 Correct 0 ms 348 KB OK (n = 100, answer = YES)
32 Correct 0 ms 344 KB OK (n = 100, answer = NO)
33 Correct 0 ms 348 KB OK (n = 100, answer = YES)
34 Correct 0 ms 348 KB OK (n = 100, answer = YES)
35 Correct 0 ms 348 KB OK (n = 100, answer = YES)
36 Correct 0 ms 348 KB OK (n = 100, answer = YES)
37 Correct 0 ms 344 KB OK (n = 28, answer = YES)
38 Correct 1 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 0 ms 348 KB OK (n = 100, answer = YES)
42 Correct 1 ms 344 KB OK (n = 10, answer = YES)
43 Correct 0 ms 348 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 1 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 1 ms 344 KB OK (n = 100, answer = NO)
48 Correct 0 ms 344 KB OK (n = 100, answer = NO)
49 Correct 0 ms 348 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 0 ms 348 KB OK (n = 100, answer = YES)
52 Correct 0 ms 348 KB OK (n = 100, answer = YES)
53 Correct 0 ms 436 KB OK (n = 100, answer = YES)
54 Correct 0 ms 348 KB OK (n = 100, answer = YES)
55 Correct 3 ms 604 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 856 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 600 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 780 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 600 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 708 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 600 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 704 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 348 KB OK (n = 865, answer = YES)
73 Correct 0 ms 348 KB OK (n = 820, answer = YES)
74 Correct 1 ms 600 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 604 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 604 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 1000 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 604 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 604 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 600 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 600 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 600 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 856 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 1112 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 860 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 604 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 704 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 856 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 348 KB OK (n = 1, answer = YES)
95 Correct 0 ms 348 KB OK (n = 3, answer = YES)
96 Correct 0 ms 348 KB OK (n = 3, answer = NO)
97 Correct 1 ms 348 KB OK (n = 3, answer = YES)
98 Correct 25 ms 5908 KB OK (n = 150000, answer = NO)
99 Correct 61 ms 8276 KB OK (n = 200000, answer = YES)
100 Correct 40 ms 8784 KB OK (n = 200000, answer = NO)
101 Correct 98 ms 9024 KB OK (n = 200000, answer = YES)
102 Correct 36 ms 8680 KB OK (n = 200000, answer = YES)
103 Correct 36 ms 8276 KB OK (n = 200000, answer = YES)
104 Correct 51 ms 8032 KB OK (n = 200000, answer = YES)
105 Correct 34 ms 7504 KB OK (n = 200000, answer = NO)
106 Correct 90 ms 8788 KB OK (n = 200000, answer = YES)
107 Correct 36 ms 8784 KB OK (n = 200000, answer = NO)
108 Correct 34 ms 7424 KB OK (n = 200000, answer = NO)
109 Correct 34 ms 7248 KB OK (n = 200000, answer = NO)
110 Correct 47 ms 7512 KB OK (n = 200000, answer = YES)
111 Correct 25 ms 7868 KB OK (n = 200000, answer = YES)
112 Correct 38 ms 7760 KB OK (n = 200000, answer = YES)
113 Correct 27 ms 8528 KB OK (n = 200000, answer = YES)
114 Correct 40 ms 8468 KB OK (n = 200000, answer = YES)
115 Correct 43 ms 8752 KB OK (n = 200000, answer = YES)
116 Correct 65 ms 7560 KB OK (n = 200000, answer = YES)
117 Correct 31 ms 7628 KB OK (n = 200000, answer = YES)