oj.uz

답안 #1109068

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109068 2024-11-06T01:20:35 Z hainam2k9 Detecting Molecules (IOI16_molecules) C++17
69 / 100
 3 ms 760 KB 
#include <bits/stdc++.h>
//#include <molecules.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
using namespace std;
const int MOD = 1e9+7, MAXN = 1e5+5;
const string NAME = "";
vector<int> find_subset(int l, int u, vector<int> w){
    int n=sz(w);
    pair<int,int> p[n];
    for(int i = 0; i<n; ++i)
        p[i].fi=w[i], p[i].se=i;
    sort(p,p+n);
    deque<int> dq;
    vector<int> result;
    int sum=0;
    for(int i = 0; i<n; ++i){
        sum+=p[i].fi, dq.pb(i);
        if(sum<l){
            int pos=lb(p+i+1,p+n,make_pair(l-sum,0))-p;
            if(pos>i&&pos<n&&sum+p[pos].fi<=u){
                dq.pb(pos);
                for(int i = 0; i<sz(dq); ++i)
                    result.pb(p[dq[i]].se);
                return result;
            }
        }
        while(sum>u) sum-=p[dq.front()].fi, dq.pof();
        if(sum>=l&&sum<=u){
            for(int i = 0; i<sz(dq); ++i)
                result.pb(p[dq[i]].se);
            return result;
        }
    }
    return vector<int>(0);
}
//int n,l,u,w[105],result[105];
//int main()
//{
//    tt;
//    if(fopen((NAME + ".INP").c_str(), "r")) fo;
//    cin >> n >> l >> u;
//    for(int i = 0; i<n; ++i)
//        cin >> w[i];
//    cout << find_subset(l,u,w,n,result);
//}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 336 KB OK (n = 1, answer = NO)
3 Correct 1 ms 336 KB OK (n = 1, answer = YES)
4 Correct 1 ms 336 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 336 KB OK (n = 3, answer = YES)
11 Correct 1 ms 336 KB OK (n = 3, answer = YES)
12 Correct 1 ms 336 KB OK (n = 3, answer = YES)
13 Correct 1 ms 508 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Correct 1 ms 336 KB OK (n = 3, answer = NO)
18 Correct 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Correct 1 ms 336 KB OK (n = 12, answer = YES)
21 Correct 1 ms 336 KB OK (n = 12, answer = YES)
22 Correct 1 ms 336 KB OK (n = 12, answer = NO)
23 Correct 1 ms 336 KB OK (n = 12, answer = NO)
24 Correct 1 ms 336 KB OK (n = 12, answer = YES)
25 Correct 1 ms 336 KB OK (n = 12, answer = YES)
26 Correct 1 ms 336 KB OK (n = 12, answer = YES)
27 Correct 1 ms 336 KB OK (n = 12, answer = YES)
28 Correct 1 ms 336 KB OK (n = 6, answer = YES)
29 Correct 1 ms 336 KB OK (n = 12, answer = YES)
30 Correct 1 ms 336 KB OK (n = 100, answer = NO)
31 Correct 1 ms 336 KB OK (n = 100, answer = YES)
32 Correct 1 ms 336 KB OK (n = 100, answer = NO)
33 Correct 1 ms 336 KB OK (n = 100, answer = YES)
34 Correct 1 ms 336 KB OK (n = 100, answer = YES)
35 Correct 1 ms 336 KB OK (n = 100, answer = YES)
36 Correct 1 ms 504 KB OK (n = 100, answer = YES)
37 Correct 1 ms 336 KB OK (n = 28, answer = YES)
38 Correct 1 ms 336 KB OK (n = 27, answer = YES)
39 Correct 1 ms 336 KB OK (n = 90, answer = YES)
40 Correct 1 ms 336 KB OK (n = 100, answer = YES)
41 Correct 1 ms 336 KB OK (n = 100, answer = YES)
42 Correct 1 ms 336 KB OK (n = 10, answer = YES)
43 Correct 1 ms 336 KB OK (n = 100, answer = YES)
44 Correct 1 ms 336 KB OK (n = 100, answer = YES)
45 Correct 1 ms 504 KB OK (n = 100, answer = YES)
46 Correct 1 ms 336 KB OK (n = 100, answer = YES)
47 Correct 1 ms 336 KB OK (n = 100, answer = NO)
48 Correct 1 ms 336 KB OK (n = 100, answer = NO)
49 Correct 1 ms 508 KB OK (n = 100, answer = NO)
50 Correct 1 ms 336 KB OK (n = 100, answer = YES)
51 Correct 1 ms 336 KB OK (n = 100, answer = YES)
52 Correct 1 ms 336 KB OK (n = 100, answer = YES)
53 Correct 1 ms 504 KB OK (n = 100, answer = YES)
54 Correct 1 ms 336 KB OK (n = 100, answer = YES)
55 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 336 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 760 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 336 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 336 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 336 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 336 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 592 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 336 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 336 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 336 KB OK (n = 865, answer = YES)
73 Correct 1 ms 336 KB OK (n = 820, answer = YES)
74 Correct 2 ms 336 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 592 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 368 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 336 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 760 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 336 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 336 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 336 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 352 KB OK (n = 1, answer = YES)
95 Correct 1 ms 336 KB OK (n = 3, answer = YES)
96 Incorrect 1 ms 336 KB sum of weights should be in [2147483647..2147483647] but it is 4294967292
97 Halted 0 ms 0 KB -