oj.uz

답안 #160104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160104 2019-10-26T02:55:30 Z Nordway Detecting Molecules (IOI16_molecules) C++14
46 / 100
 29 ms 19320 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define all(v) v.begin(),v.end()
#define nl '\n'

#define boost ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef pair<ll,ll> pll;

const ll INF=1e18;
const int inf=1e9;
const ld eps=1e-7;
const ld pi=acos(-1);
const int dx[8]={0,0 ,1,-1,1,1,-1,-1};
const int dy[8]={1,-1,0,0,1,-1,1,-1};
const int mod1=998244353;
const int mod2=1e9+7;
const int N=1e4+1;

pii a[N];

vector<int> find_subset(int l,int u,vector<int>w){
  int n=0;
  for(int i=0;i<sz(w);i++){
    if(w[i]>u)continue;
    n++;
    a[n].x=w[i];
    a[n].y=i;
  }
  bitset<N>dp[n+1];
  dp[0][0]=1;
  for(int i=1;i<=n;i++){
    dp[i]=(dp[i-1]<<a[i].x);
    dp[i]|=(dp[i-1]);
  }
  int val=-1;
  for(int i=l;i<=u;i++){
    if(dp[n][i]){
      val=i;
      break;
    }
  }
  vector<int>ans;
  if(val>0){
    while(val>0){
      if(val>=a[n].x&&dp[n-1][val-a[n].x]){
        ans.pb(a[n].y);
        val-=a[n].x;
        n--;
      }
      else if(dp[n-1][val]){
        n--;
      }
    }
  }
  return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 2 ms 252 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 4 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 256 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 3 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 376 KB OK (n = 100, answer = NO)
19 Correct 5 ms 376 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 256 KB OK (n = 12, answer = NO)
23 Correct 2 ms 348 KB OK (n = 12, answer = NO)
24 Correct 2 ms 252 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 2 ms 376 KB OK (n = 100, answer = NO)
31 Correct 2 ms 504 KB OK (n = 100, answer = YES)
32 Correct 4 ms 504 KB OK (n = 100, answer = NO)
33 Correct 2 ms 376 KB OK (n = 100, answer = YES)
34 Correct 2 ms 504 KB OK (n = 100, answer = YES)
35 Correct 2 ms 504 KB OK (n = 100, answer = YES)
36 Correct 2 ms 504 KB OK (n = 100, answer = YES)
37 Correct 2 ms 504 KB OK (n = 28, answer = YES)
38 Correct 2 ms 376 KB OK (n = 27, answer = YES)
39 Correct 2 ms 504 KB OK (n = 90, answer = YES)
40 Correct 2 ms 504 KB OK (n = 100, answer = YES)
41 Correct 2 ms 504 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 504 KB OK (n = 100, answer = YES)
44 Correct 2 ms 504 KB OK (n = 100, answer = YES)
45 Correct 2 ms 504 KB OK (n = 100, answer = YES)
46 Correct 2 ms 504 KB OK (n = 100, answer = YES)
47 Correct 2 ms 504 KB OK (n = 100, answer = NO)
48 Correct 2 ms 376 KB OK (n = 100, answer = NO)
49 Correct 2 ms 504 KB OK (n = 100, answer = NO)
50 Correct 2 ms 504 KB OK (n = 100, answer = YES)
51 Correct 2 ms 504 KB OK (n = 100, answer = YES)
52 Correct 2 ms 504 KB OK (n = 100, answer = YES)
53 Correct 2 ms 376 KB OK (n = 100, answer = YES)
54 Correct 2 ms 504 KB OK (n = 100, answer = YES)
55 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
56 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
57 Correct 21 ms 12788 KB OK (n = 10000, answer = YES)
58 Correct 22 ms 12792 KB OK (n = 10000, answer = YES)
59 Correct 20 ms 12792 KB OK (n = 10000, answer = YES)
60 Correct 22 ms 12792 KB OK (n = 10000, answer = YES)
61 Correct 24 ms 12740 KB OK (n = 10000, answer = NO)
62 Correct 22 ms 12796 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 376 KB OK (n = 10000, answer = NO)
64 Correct 23 ms 12792 KB OK (n = 10000, answer = YES)
65 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
66 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
67 Correct 20 ms 12792 KB OK (n = 10000, answer = YES)
68 Correct 22 ms 12832 KB OK (n = 10000, answer = YES)
69 Correct 20 ms 12792 KB OK (n = 10000, answer = YES)
70 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
71 Correct 22 ms 12792 KB OK (n = 10000, answer = YES)
72 Correct 4 ms 1400 KB OK (n = 865, answer = YES)
73 Correct 3 ms 1400 KB OK (n = 820, answer = YES)
74 Runtime error 29 ms 19320 KB Execution killed with signal 11 (could be triggered by violating memory limits)
75 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 2 ms 252 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 4 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 256 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 3 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 376 KB OK (n = 100, answer = NO)
19 Correct 5 ms 376 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 256 KB OK (n = 12, answer = NO)
23 Correct 2 ms 348 KB OK (n = 12, answer = NO)
24 Correct 2 ms 252 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 2 ms 376 KB OK (n = 100, answer = NO)
31 Correct 2 ms 504 KB OK (n = 100, answer = YES)
32 Correct 4 ms 504 KB OK (n = 100, answer = NO)
33 Correct 2 ms 376 KB OK (n = 100, answer = YES)
34 Correct 2 ms 504 KB OK (n = 100, answer = YES)
35 Correct 2 ms 504 KB OK (n = 100, answer = YES)
36 Correct 2 ms 504 KB OK (n = 100, answer = YES)
37 Correct 2 ms 504 KB OK (n = 28, answer = YES)
38 Correct 2 ms 376 KB OK (n = 27, answer = YES)
39 Correct 2 ms 504 KB OK (n = 90, answer = YES)
40 Correct 2 ms 504 KB OK (n = 100, answer = YES)
41 Correct 2 ms 504 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 504 KB OK (n = 100, answer = YES)
44 Correct 2 ms 504 KB OK (n = 100, answer = YES)
45 Correct 2 ms 504 KB OK (n = 100, answer = YES)
46 Correct 2 ms 504 KB OK (n = 100, answer = YES)
47 Correct 2 ms 504 KB OK (n = 100, answer = NO)
48 Correct 2 ms 376 KB OK (n = 100, answer = NO)
49 Correct 2 ms 504 KB OK (n = 100, answer = NO)
50 Correct 2 ms 504 KB OK (n = 100, answer = YES)
51 Correct 2 ms 504 KB OK (n = 100, answer = YES)
52 Correct 2 ms 504 KB OK (n = 100, answer = YES)
53 Correct 2 ms 376 KB OK (n = 100, answer = YES)
54 Correct 2 ms 504 KB OK (n = 100, answer = YES)
55 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
56 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
57 Correct 21 ms 12788 KB OK (n = 10000, answer = YES)
58 Correct 22 ms 12792 KB OK (n = 10000, answer = YES)
59 Correct 20 ms 12792 KB OK (n = 10000, answer = YES)
60 Correct 22 ms 12792 KB OK (n = 10000, answer = YES)
61 Correct 24 ms 12740 KB OK (n = 10000, answer = NO)
62 Correct 22 ms 12796 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 376 KB OK (n = 10000, answer = NO)
64 Correct 23 ms 12792 KB OK (n = 10000, answer = YES)
65 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
66 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
67 Correct 20 ms 12792 KB OK (n = 10000, answer = YES)
68 Correct 22 ms 12832 KB OK (n = 10000, answer = YES)
69 Correct 20 ms 12792 KB OK (n = 10000, answer = YES)
70 Correct 21 ms 12792 KB OK (n = 10000, answer = YES)
71 Correct 22 ms 12792 KB OK (n = 10000, answer = YES)
72 Correct 4 ms 1400 KB OK (n = 865, answer = YES)
73 Correct 3 ms 1400 KB OK (n = 820, answer = YES)
74 Runtime error 29 ms 19320 KB Execution killed with signal 11 (could be triggered by violating memory limits)
75 Halted 0 ms 0 KB -