oj.uz

답안 #240327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240327 2020-06-19T10:13:24 Z Dremix10 Detecting Molecules (IOI16_molecules) C++17
46 / 100
 1000 ms 4228 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define F first
#define S second
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define maxp 22
#define EPS (ld)(1e-18)
#define mod (int)(1e9+7)
#define N (int)(1e5+1)

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

int low[500001];

vector<int> find_subset(int l, int r, vector<int> w) {
    int n=w.size();
    int i,j;

    pair<int,int> arr[n];
    ll sum=0;
    for(i=0;i<n;i++){
        sum+=w[i];
        arr[i]={w[i],i};
    }
    if(sum<l)
        return vector<int>(0);

    sort(arr,arr+n,greater<pair<int,int> >());

    vector<int> s;
    s.push_back(0);
    int k;

    //gp_hash_table<int,int> low;

    low[0]=0;

    for(i=1;i<=n;i++){
        int len=s.size();
        for(k=0;k<len;k++){
            int num=s[k]+arr[i-1].F;
            if(num<l){
                if(low[num]!=0)
                    continue;
                s.push_back(num);
                low[num]=i;
            }
            else if(num<=r){
                vector<int> ans;
                ans.push_back(arr[i-1].S);
                num=s[k];
                int row=i-1;
                //cout<<num<<" "<<row<<endl;
                while(num>0){
                    //cout<<row<<" "<<num<<endl;
                    for(j=row;j>0;j--){
                        if(num<arr[j-1].F)
                            continue;
                        int temp=num-arr[j-1].F;
                        int nr=low[temp];
                        if(temp==0 || nr<j && nr!=0){
                            num-=arr[j-1].F;
                            row=j-1;
                            ans.push_back(arr[j-1].S);
                            break;
                        }
                    }

                }
                return ans;
            }
        }

    }
    return vector<int>(0);


}

/// g++ grader.cpp molecules_full.cpp

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:66:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
                         if(temp==0 || nr<j && nr!=0){
                                       ~~~~~^~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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