oj.uz

Submission #955799

# Submission time Handle Problem Language Result Execution time Memory
955799 2024-03-31T12:30:09 Z lbm364dl Detecting Molecules (IOI16_molecules) C++14
46 / 100
 10 ms 860 KB 
#include "molecules.h"
//#include <bits/stdc++.h>
#include <iostream>
#include <bitset>
#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);
  const int lim = 10005;
  bitset<lim> dp;
  vec(int) p(lim);
  dp[0] = true;
  FOR(j, 0, n){
    bitset<lim> last = dp;
    dp |= dp << w[j];
    bitset<lim> aux = ~last & dp;
    int i = aux._Find_first();
    while(i < lim){
      p[i] = j;
      i = aux._Find_next(i);
    }
  }

  FOR(i, l, u+1){
    if(dp[i]){
      vec(int) ans;
      int cur = i;
      while(cur){
        ans.pb(p[cur]);
        cur -= w[p[cur]];
      }
      return ans;
    }
  }
  return vec(int){};
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 344 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 1 ms 348 KB OK (n = 3, answer = YES)
12 Correct 1 ms 344 KB OK (n = 3, answer = YES)
13 Correct 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 1 ms 348 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 1 ms 344 KB OK (n = 100, answer = NO)
19 Correct 1 ms 344 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB OK (n = 12, answer = YES)
2 Correct 1 ms 344 KB OK (n = 12, answer = YES)
3 Correct 1 ms 348 KB OK (n = 12, answer = NO)
4 Correct 0 ms 348 KB OK (n = 12, answer = NO)
5 Correct 1 ms 348 KB OK (n = 12, answer = YES)
6 Correct 0 ms 348 KB OK (n = 12, answer = YES)
7 Correct 1 ms 344 KB OK (n = 12, answer = YES)
8 Correct 0 ms 348 KB OK (n = 12, answer = YES)
9 Correct 0 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 1 ms 348 KB OK (n = 100, answer = NO)
14 Correct 0 ms 348 KB OK (n = 100, answer = YES)
15 Correct 1 ms 348 KB OK (n = 100, answer = YES)
16 Correct 1 ms 348 KB OK (n = 100, answer = YES)
17 Correct 1 ms 348 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 344 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 1 ms 348 KB OK (n = 3, answer = YES)
12 Correct 1 ms 344 KB OK (n = 3, answer = YES)
13 Correct 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 1 ms 348 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 1 ms 344 KB OK (n = 100, answer = NO)
19 Correct 1 ms 344 KB OK (n = 100, answer = YES)
20 Correct 1 ms 344 KB OK (n = 12, answer = YES)
21 Correct 1 ms 344 KB OK (n = 12, answer = YES)
22 Correct 1 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 348 KB OK (n = 12, answer = NO)
24 Correct 1 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 1 ms 344 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 0 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 1 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 348 KB OK (n = 100, answer = YES)
34 Correct 1 ms 348 KB OK (n = 100, answer = YES)
35 Correct 1 ms 348 KB OK (n = 100, answer = YES)
36 Correct 1 ms 348 KB OK (n = 100, answer = YES)
37 Correct 1 ms 348 KB OK (n = 28, answer = YES)
38 Correct 0 ms 344 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 1 ms 348 KB OK (n = 100, answer = YES)
42 Correct 1 ms 348 KB OK (n = 10, answer = YES)
43 Correct 0 ms 432 KB OK (n = 100, answer = YES)
44 Correct 1 ms 388 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 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 1 ms 344 KB OK (n = 100, answer = NO)
49 Correct 1 ms 788 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 1 ms 348 KB OK (n = 100, answer = YES)
52 Correct 0 ms 348 KB OK (n = 100, answer = YES)
53 Correct 0 ms 348 KB OK (n = 100, answer = YES)
54 Correct 1 ms 348 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 344 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 1 ms 348 KB OK (n = 3, answer = YES)
12 Correct 1 ms 344 KB OK (n = 3, answer = YES)
13 Correct 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 1 ms 348 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 1 ms 344 KB OK (n = 100, answer = NO)
19 Correct 1 ms 344 KB OK (n = 100, answer = YES)
20 Correct 1 ms 344 KB OK (n = 12, answer = YES)
21 Correct 1 ms 344 KB OK (n = 12, answer = YES)
22 Correct 1 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 348 KB OK (n = 12, answer = NO)
24 Correct 1 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 1 ms 344 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 0 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 1 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 348 KB OK (n = 100, answer = YES)
34 Correct 1 ms 348 KB OK (n = 100, answer = YES)
35 Correct 1 ms 348 KB OK (n = 100, answer = YES)
36 Correct 1 ms 348 KB OK (n = 100, answer = YES)
37 Correct 1 ms 348 KB OK (n = 28, answer = YES)
38 Correct 0 ms 344 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 1 ms 348 KB OK (n = 100, answer = YES)
42 Correct 1 ms 348 KB OK (n = 10, answer = YES)
43 Correct 0 ms 432 KB OK (n = 100, answer = YES)
44 Correct 1 ms 388 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 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 1 ms 344 KB OK (n = 100, answer = NO)
49 Correct 1 ms 788 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 1 ms 348 KB OK (n = 100, answer = YES)
52 Correct 0 ms 348 KB OK (n = 100, answer = YES)
53 Correct 0 ms 348 KB OK (n = 100, answer = YES)
54 Correct 1 ms 348 KB OK (n = 100, answer = YES)
55 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
56 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
59 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
60 Correct 7 ms 600 KB OK (n = 10000, answer = YES)
61 Correct 8 ms 680 KB OK (n = 10000, answer = NO)
62 Correct 8 ms 516 KB OK (n = 10000, answer = YES)
63 Correct 8 ms 600 KB OK (n = 10000, answer = NO)
64 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
65 Correct 10 ms 600 KB OK (n = 10000, answer = YES)
66 Correct 7 ms 668 KB OK (n = 10000, answer = YES)
67 Correct 7 ms 856 KB OK (n = 10000, answer = YES)
68 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 348 KB OK (n = 865, answer = YES)
73 Correct 1 ms 348 KB OK (n = 820, answer = YES)

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 344 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 1 ms 348 KB OK (n = 3, answer = YES)
12 Correct 1 ms 344 KB OK (n = 3, answer = YES)
13 Correct 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 1 ms 348 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 1 ms 344 KB OK (n = 100, answer = NO)
19 Correct 1 ms 344 KB OK (n = 100, answer = YES)
20 Correct 1 ms 344 KB OK (n = 12, answer = YES)
21 Correct 1 ms 344 KB OK (n = 12, answer = YES)
22 Correct 1 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 348 KB OK (n = 12, answer = NO)
24 Correct 1 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 1 ms 344 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 0 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 1 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 348 KB OK (n = 100, answer = YES)
34 Correct 1 ms 348 KB OK (n = 100, answer = YES)
35 Correct 1 ms 348 KB OK (n = 100, answer = YES)
36 Correct 1 ms 348 KB OK (n = 100, answer = YES)
37 Correct 1 ms 348 KB OK (n = 28, answer = YES)
38 Correct 0 ms 344 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 1 ms 348 KB OK (n = 100, answer = YES)
42 Correct 1 ms 348 KB OK (n = 10, answer = YES)
43 Correct 0 ms 432 KB OK (n = 100, answer = YES)
44 Correct 1 ms 388 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 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 1 ms 344 KB OK (n = 100, answer = NO)
49 Correct 1 ms 788 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 1 ms 348 KB OK (n = 100, answer = YES)
52 Correct 0 ms 348 KB OK (n = 100, answer = YES)
53 Correct 0 ms 348 KB OK (n = 100, answer = YES)
54 Correct 1 ms 348 KB OK (n = 100, answer = YES)
55 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
56 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
59 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
60 Correct 7 ms 600 KB OK (n = 10000, answer = YES)
61 Correct 8 ms 680 KB OK (n = 10000, answer = NO)
62 Correct 8 ms 516 KB OK (n = 10000, answer = YES)
63 Correct 8 ms 600 KB OK (n = 10000, answer = NO)
64 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
65 Correct 10 ms 600 KB OK (n = 10000, answer = YES)
66 Correct 7 ms 668 KB OK (n = 10000, answer = YES)
67 Correct 7 ms 856 KB OK (n = 10000, answer = YES)
68 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 348 KB OK (n = 865, answer = YES)
73 Correct 1 ms 348 KB OK (n = 820, answer = YES)
74 Runtime error 6 ms 860 KB Execution killed with signal 11
75 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 344 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 1 ms 348 KB OK (n = 3, answer = YES)
12 Correct 1 ms 344 KB OK (n = 3, answer = YES)
13 Correct 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 1 ms 348 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 1 ms 344 KB OK (n = 100, answer = NO)
19 Correct 1 ms 344 KB OK (n = 100, answer = YES)
20 Correct 1 ms 344 KB OK (n = 12, answer = YES)
21 Correct 1 ms 344 KB OK (n = 12, answer = YES)
22 Correct 1 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 348 KB OK (n = 12, answer = NO)
24 Correct 1 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 1 ms 344 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 0 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 1 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 348 KB OK (n = 100, answer = YES)
34 Correct 1 ms 348 KB OK (n = 100, answer = YES)
35 Correct 1 ms 348 KB OK (n = 100, answer = YES)
36 Correct 1 ms 348 KB OK (n = 100, answer = YES)
37 Correct 1 ms 348 KB OK (n = 28, answer = YES)
38 Correct 0 ms 344 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 1 ms 348 KB OK (n = 100, answer = YES)
42 Correct 1 ms 348 KB OK (n = 10, answer = YES)
43 Correct 0 ms 432 KB OK (n = 100, answer = YES)
44 Correct 1 ms 388 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 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 1 ms 344 KB OK (n = 100, answer = NO)
49 Correct 1 ms 788 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 1 ms 348 KB OK (n = 100, answer = YES)
52 Correct 0 ms 348 KB OK (n = 100, answer = YES)
53 Correct 0 ms 348 KB OK (n = 100, answer = YES)
54 Correct 1 ms 348 KB OK (n = 100, answer = YES)
55 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
56 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
59 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
60 Correct 7 ms 600 KB OK (n = 10000, answer = YES)
61 Correct 8 ms 680 KB OK (n = 10000, answer = NO)
62 Correct 8 ms 516 KB OK (n = 10000, answer = YES)
63 Correct 8 ms 600 KB OK (n = 10000, answer = NO)
64 Correct 8 ms 600 KB OK (n = 10000, answer = YES)
65 Correct 10 ms 600 KB OK (n = 10000, answer = YES)
66 Correct 7 ms 668 KB OK (n = 10000, answer = YES)
67 Correct 7 ms 856 KB OK (n = 10000, answer = YES)
68 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 8 ms 604 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 348 KB OK (n = 865, answer = YES)
73 Correct 1 ms 348 KB OK (n = 820, answer = YES)
74 Runtime error 6 ms 860 KB Execution killed with signal 11
75 Halted 0 ms 0 KB -