oj.uz

답안 #348283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
348283 2021-01-14T13:27:59 Z ACmachine Detecting Molecules (IOI16_molecules) C++17
100 / 100
 68 ms 5740 KB 
#include "molecules.h"

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    vector<array<int, 2>> nw(n);
    REP(i, n)
        nw[i] = {w[i], i};
    sort(all(nw));
    deque<int> ans;
    ll sum = 0;
    REP(i, n){
        if(sum >= l) break;
        if(sum + nw[i][0] <= u){
            sum += nw[i][0];
            ans.push_back(nw[i][1]);
        }
        else{
            if(!ans.empty()){
                sum -= w[ans.front()];
                ans.pop_front();
                sum += nw[i][0];
                ans.push_back(nw[i][1]); 
            }
        }
    }
    if(sum < l){
        return vi(0);
    }
    else{
        vi res;
        for(int x : ans)
            res.pb(x);
        return res;
    }
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 384 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 376 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 1 ms 364 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 256 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 384 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 ms 364 KB OK (n = 12, answer = NO)
24 Correct 1 ms 364 KB OK (n = 12, answer = YES)
25 Correct 1 ms 492 KB OK (n = 12, answer = YES)
26 Correct 1 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 364 KB OK (n = 6, answer = YES)
29 Correct 1 ms 492 KB OK (n = 12, answer = YES)
30 Correct 1 ms 364 KB OK (n = 100, answer = NO)
31 Correct 1 ms 364 KB OK (n = 100, answer = YES)
32 Correct 1 ms 364 KB OK (n = 100, answer = NO)
33 Correct 1 ms 364 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 1 ms 364 KB OK (n = 28, answer = YES)
38 Correct 1 ms 364 KB OK (n = 27, answer = YES)
39 Correct 1 ms 364 KB OK (n = 90, answer = YES)
40 Correct 1 ms 364 KB OK (n = 100, answer = YES)
41 Correct 1 ms 364 KB OK (n = 100, answer = YES)
42 Correct 1 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 1 ms 364 KB OK (n = 100, answer = YES)
45 Correct 0 ms 364 KB OK (n = 100, answer = YES)
46 Correct 1 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 364 KB OK (n = 100, answer = NO)
49 Correct 1 ms 364 KB OK (n = 100, answer = NO)
50 Correct 1 ms 364 KB OK (n = 100, answer = YES)
51 Correct 1 ms 364 KB OK (n = 100, answer = YES)
52 Correct 1 ms 364 KB OK (n = 100, answer = YES)
53 Correct 1 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
59 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 492 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 364 KB OK (n = 865, answer = YES)
73 Correct 1 ms 364 KB OK (n = 820, answer = YES)
74 Correct 2 ms 492 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 620 KB OK (n = 10000, answer = NO)
76 Correct 4 ms 492 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
82 Correct 4 ms 492 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 364 KB OK (n = 1, answer = YES)
95 Correct 1 ms 364 KB OK (n = 3, answer = YES)
96 Correct 1 ms 364 KB OK (n = 3, answer = NO)
97 Correct 1 ms 364 KB OK (n = 3, answer = YES)
98 Correct 42 ms 4076 KB OK (n = 150000, answer = NO)
99 Correct 60 ms 5100 KB OK (n = 200000, answer = YES)
100 Correct 64 ms 5740 KB OK (n = 200000, answer = NO)
101 Correct 60 ms 5100 KB OK (n = 200000, answer = YES)
102 Correct 59 ms 5484 KB OK (n = 200000, answer = YES)
103 Correct 58 ms 4972 KB OK (n = 200000, answer = YES)
104 Correct 68 ms 4844 KB OK (n = 200000, answer = YES)
105 Correct 54 ms 4972 KB OK (n = 200000, answer = NO)
106 Correct 67 ms 5228 KB OK (n = 200000, answer = YES)
107 Correct 56 ms 5612 KB OK (n = 200000, answer = NO)
108 Correct 54 ms 5100 KB OK (n = 200000, answer = NO)
109 Correct 55 ms 5100 KB OK (n = 200000, answer = NO)
110 Correct 49 ms 4460 KB OK (n = 200000, answer = YES)
111 Correct 41 ms 4588 KB OK (n = 200000, answer = YES)
112 Correct 43 ms 4588 KB OK (n = 200000, answer = YES)
113 Correct 44 ms 4844 KB OK (n = 200000, answer = YES)
114 Correct 49 ms 4844 KB OK (n = 200000, answer = YES)
115 Correct 44 ms 4844 KB OK (n = 200000, answer = YES)
116 Correct 54 ms 4460 KB OK (n = 200000, answer = YES)
117 Correct 58 ms 4716 KB OK (n = 200000, answer = YES)