oj.uz

답안 #990393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
990393 2024-05-30T11:02:36 Z hashim Detecting Molecules (IOI16_molecules) C++14
69 / 100
 32 ms 5716 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define pf push_front
#define ep emplace_back
#define ef emplace_front
// #define int long long
// #define ld long double
// #define stoi stoll
#define all(ls) ls.begin(),ls.end()
#define allr(ls) ls.rbegin(),ls.rend()
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
 
using namespace std; 

using namespace __gnu_pbds;
 
template<typename type>using ordered_set=tree<type,null_type,less<type>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename type>using ordered_multiset=tree<type,null_type,less_equal<type>,rb_tree_tag,tree_order_statistics_node_update>;
 
int sum(int ls[],int n){int sum=0;for(int i=0;i<n;i++)sum+=ls[i];return sum;}
 
int count(string str,string word){regex regex_word(word);sregex_iterator it(all(str),regex_word);sregex_iterator end;int count=0;while(it!=end){count++;it++;}return count;}

vector<int>find_subset(int l,int u,vector<int>w){
  pair<int,int> ls[w.size()];
  for(int i=0;i<w.size();i++){
    ls[i]={w[i],i};
  }
  sort(ls,ls+w.size());
  deque<int>ans;
  int i=0,j=0,sum=0;
  while(i<w.size() and j<w.size()){
    if(sum<u){
      sum+=ls[i].first;
      ans.pb(ls[i].second);
      i++;
    }
    if(sum>u){
      sum-=ls[j].first;
      ans.pop_front();
      j++;
    }
    if(l<=sum and sum<=u){
      vector<int>arr;
      reverse(all(ans));
      for(auto i:ans)
        arr.pb(i);
      return arr;
    }
  }
  return {};
}

// void solve(){
//   for(aut
// }

// signed main(){
//   ios_base::sync_with_stdio(0);
//   cin.tie(nullptr); 
//   cout.tie(nullptr);
//   int t=1;
//   // cin>>t;
//   while(t--)
//     solve();
// }

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:31:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |   for(int i=0;i<w.size();i++){
      |               ~^~~~~~~~~
molecules.cpp:37:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |   while(i<w.size() and j<w.size()){
      |         ~^~~~~~~~~
molecules.cpp:37:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |   while(i<w.size() and j<w.size()){
      |                        ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 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 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 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 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 436 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 1 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 1 ms 348 KB OK (n = 12, answer = YES)
2 Correct 0 ms 344 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 348 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 432 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 348 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 348 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 1 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 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 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 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 436 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 1 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 1 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 344 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 348 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 432 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 348 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 348 KB OK (n = 28, answer = YES)
38 Correct 0 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 0 ms 348 KB OK (n = 10, answer = YES)
43 Correct 1 ms 348 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 344 KB OK (n = 100, answer = YES)
47 Correct 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 1 ms 344 KB OK (n = 100, answer = NO)
49 Correct 1 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 1 ms 348 KB OK (n = 100, answer = YES)
53 Correct 1 ms 348 KB OK (n = 100, answer = YES)
54 Correct 0 ms 344 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 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 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 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 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 436 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 1 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 1 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 344 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 348 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 432 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 348 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 348 KB OK (n = 28, answer = YES)
38 Correct 0 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 0 ms 348 KB OK (n = 10, answer = YES)
43 Correct 1 ms 348 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 344 KB OK (n = 100, answer = YES)
47 Correct 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 1 ms 344 KB OK (n = 100, answer = NO)
49 Correct 1 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 1 ms 348 KB OK (n = 100, answer = YES)
53 Correct 1 ms 348 KB OK (n = 100, answer = YES)
54 Correct 0 ms 344 KB OK (n = 100, answer = YES)
55 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
56 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
61 Correct 1 ms 604 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 636 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
64 Correct 1 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
72 Correct 0 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 348 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 1 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 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 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 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 436 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 1 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 1 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 344 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 348 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 432 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 348 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 348 KB OK (n = 28, answer = YES)
38 Correct 0 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 0 ms 348 KB OK (n = 10, answer = YES)
43 Correct 1 ms 348 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 344 KB OK (n = 100, answer = YES)
47 Correct 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 1 ms 344 KB OK (n = 100, answer = NO)
49 Correct 1 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 1 ms 348 KB OK (n = 100, answer = YES)
53 Correct 1 ms 348 KB OK (n = 100, answer = YES)
54 Correct 0 ms 344 KB OK (n = 100, answer = YES)
55 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
56 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
61 Correct 1 ms 604 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 636 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
64 Correct 1 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 348 KB OK (n = 865, answer = YES)
73 Correct 0 ms 348 KB OK (n = 820, answer = YES)
74 Correct 1 ms 604 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 616 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 516 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 668 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
85 Correct 1 ms 604 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 528 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 604 KB OK (n = 10000, answer = YES)

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 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 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 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 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 436 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 1 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 1 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 344 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 348 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 432 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 348 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 348 KB OK (n = 28, answer = YES)
38 Correct 0 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 0 ms 348 KB OK (n = 10, answer = YES)
43 Correct 1 ms 348 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 344 KB OK (n = 100, answer = YES)
47 Correct 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 1 ms 344 KB OK (n = 100, answer = NO)
49 Correct 1 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 1 ms 348 KB OK (n = 100, answer = YES)
53 Correct 1 ms 348 KB OK (n = 100, answer = YES)
54 Correct 0 ms 344 KB OK (n = 100, answer = YES)
55 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
56 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
61 Correct 1 ms 604 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 636 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
64 Correct 1 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 348 KB OK (n = 865, answer = YES)
73 Correct 0 ms 348 KB OK (n = 820, answer = YES)
74 Correct 1 ms 604 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 616 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 516 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 668 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
85 Correct 1 ms 604 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 528 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
94 Correct 1 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 0 ms 348 KB OK (n = 3, answer = YES)
98 Correct 21 ms 4120 KB OK (n = 150000, answer = NO)
99 Incorrect 32 ms 5716 KB Contestant can not find answer, jury can
100 Halted 0 ms 0 KB -