oj.uz

답안 #730218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
730218 2023-04-25T12:10:20 Z ktkerem Detecting Molecules (IOI16_molecules) C++17
100 / 100
 48 ms 8252 KB 
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef __int128 vll;
typedef long long ftyp;
typedef std::complex<ftyp> vec;
#define llll std::pair<ll , ll>
#define pb push_back
#define fi first
#define sec second
#define cx real
#define cy imag
#define all(a) a.begin() , a.end()
#define debug std::cout << "!!ALERT ALERT!!" << std::endl;  
const ll limit = 1e12+7;
const ll sus = 1e5+5;
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
std::vector<int> find_subset(int l , int u , std::vector<int> ww){
  ll n = ww.size();
  std::vector<int> ans;
  ll ps = 0 , ss = 0;
  ll lf = n - 1;
  std::vector<llll> w;
  for(ll i = 0;n>i;i++){
    w.pb({ww[i] , i});
  }
  std::sort(all(w));
  while(l > ss && lf >= 0){
    ss += w[lf].fi;
    lf--;
  }
  lf++;
  ll rg = 0;
  if(lf == 0 && l > ss){
    return ans;
  }
  if(ss <= u && ss >= l){
    for(ll i = n-1;lf <= i;i--){
      ans.pb(w[i].sec);
    }
    return ans;
  }
  for(ll i = 1;n>=i;i++){
    if(i != 0){
      ps += w[i-1].fi;
    }
    while(lf < i && n > lf){
      ss -= w[lf].fi;
      lf++;
    }
    while(ps + ss > u && lf < n){
      ss -= w[lf].fi;
      lf++;
    }
    if(ps + ss >= l && ps + ss <= u){
      for(ll j = n-1;lf <= j;j--){
        ans.pb(w[j].sec);
      }
      for(ll j = 0;i>j;j++){
        ans.pb(w[j].sec);
      }
      std::sort(all(ans));
      return ans;
    }
  }
  return ans;
}
/*void solve(){
  std::vector<int> ar = {50 , 50 , 50 , 50 , 50 , 50 , 51 , 51 , 51 , 51 , 51 , 51};
  std::vector<int> ans = find_subset(302 , 304 , ar);
  std::cout << ans.size() << "\n";
  for(ll i = 0;ans.size()>i;i++){
    std::cout << ans[i] << " ";
  }
  return;
}
int main(){
  std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);
  #ifndef ONLINE_JUDGE
    freopen("in.txt" , "r" , stdin);
    freopen("out.txt" , "w" , stdout);
  #endif
  ll t = 1;
  //std::cin >> t;
  while(t--){
    solve();
  }
}*/

Compilation message

molecules.cpp:5:78: warning: "/*" within comment [-Wcomment]
    5 | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
      |                                                                               
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:38:6: warning: unused variable 'rg' [-Wunused-variable]
   38 |   ll rg = 0;
      |      ^~

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 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 224 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 0 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 1 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 0 ms 212 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 12, answer = YES)
2 Correct 1 ms 212 KB OK (n = 12, answer = YES)
3 Correct 0 ms 212 KB OK (n = 12, answer = NO)
4 Correct 0 ms 212 KB OK (n = 12, answer = NO)
5 Correct 1 ms 212 KB OK (n = 12, answer = YES)
6 Correct 0 ms 212 KB OK (n = 12, answer = YES)
7 Correct 0 ms 212 KB OK (n = 12, answer = YES)
8 Correct 1 ms 212 KB OK (n = 12, answer = YES)
9 Correct 0 ms 212 KB OK (n = 6, answer = YES)
10 Correct 0 ms 212 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 300 KB OK (n = 100, answer = NO)
14 Correct 1 ms 300 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 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 224 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 0 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 1 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 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 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 300 KB OK (n = 100, answer = NO)
33 Correct 1 ms 300 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 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 1 ms 308 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 300 KB OK (n = 100, answer = NO)
50 Correct 1 ms 300 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 300 KB OK (n = 100, answer = YES)
54 Correct 1 ms 300 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 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 224 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 0 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 1 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 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 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 300 KB OK (n = 100, answer = NO)
33 Correct 1 ms 300 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 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 1 ms 308 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 300 KB OK (n = 100, answer = NO)
50 Correct 1 ms 300 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 300 KB OK (n = 100, answer = YES)
54 Correct 1 ms 300 KB OK (n = 100, answer = YES)
55 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 828 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 772 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 832 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 756 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 692 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 304 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 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 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 224 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 0 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 1 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 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 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 300 KB OK (n = 100, answer = NO)
33 Correct 1 ms 300 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 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 1 ms 308 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 300 KB OK (n = 100, answer = NO)
50 Correct 1 ms 300 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 300 KB OK (n = 100, answer = YES)
54 Correct 1 ms 300 KB OK (n = 100, answer = YES)
55 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 828 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 772 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 832 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 756 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 692 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 304 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)
74 Correct 2 ms 596 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 724 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 700 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 700 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 696 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 760 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 852 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 700 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 824 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 704 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 700 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 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 224 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 0 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 1 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 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 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 300 KB OK (n = 100, answer = NO)
33 Correct 1 ms 300 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 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 1 ms 308 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 300 KB OK (n = 100, answer = NO)
50 Correct 1 ms 300 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 300 KB OK (n = 100, answer = YES)
54 Correct 1 ms 300 KB OK (n = 100, answer = YES)
55 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 828 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 772 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 832 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 756 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 692 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 304 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)
74 Correct 2 ms 596 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 724 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 700 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 700 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 696 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 760 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 852 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 700 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 824 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 704 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 212 KB OK (n = 1, answer = YES)
95 Correct 1 ms 304 KB OK (n = 3, answer = YES)
96 Correct 1 ms 212 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 29 ms 6508 KB OK (n = 150000, answer = NO)
99 Correct 42 ms 7620 KB OK (n = 200000, answer = YES)
100 Correct 48 ms 8252 KB OK (n = 200000, answer = NO)
101 Correct 45 ms 7464 KB OK (n = 200000, answer = YES)
102 Correct 45 ms 8092 KB OK (n = 200000, answer = YES)
103 Correct 42 ms 7612 KB OK (n = 200000, answer = YES)
104 Correct 40 ms 7484 KB OK (n = 200000, answer = YES)
105 Correct 39 ms 6828 KB OK (n = 200000, answer = NO)
106 Correct 45 ms 7328 KB OK (n = 200000, answer = YES)
107 Correct 43 ms 8224 KB OK (n = 200000, answer = NO)
108 Correct 39 ms 6820 KB OK (n = 200000, answer = NO)
109 Correct 38 ms 6828 KB OK (n = 200000, answer = NO)
110 Correct 33 ms 7076 KB OK (n = 200000, answer = YES)
111 Correct 27 ms 7148 KB OK (n = 200000, answer = YES)
112 Correct 27 ms 7112 KB OK (n = 200000, answer = YES)
113 Correct 28 ms 7228 KB OK (n = 200000, answer = YES)
114 Correct 28 ms 7212 KB OK (n = 200000, answer = YES)
115 Correct 28 ms 7208 KB OK (n = 200000, answer = YES)
116 Correct 35 ms 7052 KB OK (n = 200000, answer = YES)
117 Correct 37 ms 7072 KB OK (n = 200000, answer = YES)