oj.uz

답안 #218971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218971 2020-04-03T10:19:50 Z yayups Detecting Molecules (IOI16_molecules) C++11
69 / 100
 122 ms 5612 KB 
// created 01 FEB 2018
// updated JUNE 2018
// updated JULY 2018
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
#include <map>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <bitset>
#include <fstream>
#include <sstream>
#include <cstdlib>
#include <list>
#include <stdexcept>

#define N 200000

using namespace std;

vector<int> find_subset(int l, int u, vector<int> ww) {
	vector<int> w;
	for(int i=0;i<ww.size();i++) w.push_back(ww[i]);
	sort(w.begin(),w.end());
	int n=w.size();
	
	//need to find sorting bijection
	vector<int> A(n);
	map<int,int> mults;
	map<int,int>::iterator it;
	for(int i=0;i<n;i++) {
		A[i]=lower_bound(w.begin(),w.end(),ww[i])-w.begin();
		it=mults.find(ww[i]);
		if(it==mults.end()) {
			mults.insert(pair<int,int>(ww[i],1));
		}
		else {
			A[i] = A[i]+ mults[ww[i]];
			mults[ww[i]]++;
		}
	}
	vector<int> B(n);
	for(int i=0;i<n;i++) {
		B[A[i]]=i;
	}
	
	
	
	
	//real solution
	vector<int> v(n);
	vector<int> result;
	v[0]=w[0];
	//cout << v[0] << endl;
	for(int i=1;i<n;i++) {
		v[i] = v[i-1]+w[i];
		//cout <<  v[i]<< endl;
	}
	
	vector<int>::iterator low,up;
	
	int a,b=0;
	int t;
	
	//it's going to be v[b]-v[a]
	for(a=-1;a<n;a++) {
		if(a==-1) {
			t=0;
		}
		else {
			t=v[a];
		}
		low=lower_bound(v.begin(),v.end(),l+t);
		up =upper_bound(v.begin(),v.end(),u+t);
		//cout << "for a = " << a << " we have low = "<<low-v.begin()<<" and up= "<<up-v.begin() << endl;
		if(low-v.begin()<=up-v.begin()) {
			b=low-v.begin();
			if(v[b]-t>=l and v[b]-t<=u) break;
			//cout  << a;
		}
	}
	//cout  << a<<endl<<b<<endl;
	result.clear();
	if(a==n) {
		return result;
	}
	
	for(int i=0;i<b-a;i++) {
		result.push_back(B[a+1+i]);
	}
	
	//cout << a << endl;
	
	return result;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:31:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<ww.size();i++) w.push_back(ww[i]);
              ~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 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 4 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 384 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 5 ms 512 KB OK (n = 3, answer = YES)
12 Correct 4 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 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 4 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 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 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 256 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 5 ms 256 KB OK (n = 12, answer = YES)
27 Correct 4 ms 256 KB OK (n = 12, answer = YES)
28 Correct 4 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 256 KB OK (n = 12, answer = YES)
30 Correct 4 ms 256 KB OK (n = 100, answer = NO)
31 Correct 4 ms 384 KB OK (n = 100, answer = YES)
32 Correct 5 ms 384 KB OK (n = 100, answer = NO)
33 Correct 5 ms 256 KB OK (n = 100, answer = YES)
34 Correct 4 ms 384 KB OK (n = 100, answer = YES)
35 Correct 4 ms 256 KB OK (n = 100, answer = YES)
36 Correct 4 ms 256 KB OK (n = 100, answer = YES)
37 Correct 4 ms 256 KB OK (n = 28, answer = YES)
38 Correct 4 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 256 KB OK (n = 90, answer = YES)
40 Correct 4 ms 256 KB OK (n = 100, answer = YES)
41 Correct 5 ms 256 KB OK (n = 100, answer = YES)
42 Correct 4 ms 256 KB OK (n = 10, answer = YES)
43 Correct 4 ms 256 KB OK (n = 100, answer = YES)
44 Correct 5 ms 384 KB OK (n = 100, answer = YES)
45 Correct 5 ms 384 KB OK (n = 100, answer = YES)
46 Correct 5 ms 256 KB OK (n = 100, answer = YES)
47 Correct 5 ms 256 KB OK (n = 100, answer = NO)
48 Correct 5 ms 256 KB OK (n = 100, answer = NO)
49 Correct 5 ms 256 KB OK (n = 100, answer = NO)
50 Correct 4 ms 256 KB OK (n = 100, answer = YES)
51 Correct 4 ms 256 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 4 ms 256 KB OK (n = 100, answer = YES)
55 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
56 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 8 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 8 ms 512 KB OK (n = 10000, answer = YES)
60 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
61 Correct 8 ms 512 KB OK (n = 10000, answer = NO)
62 Correct 11 ms 768 KB OK (n = 10000, answer = YES)
63 Correct 12 ms 768 KB OK (n = 10000, answer = NO)
64 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
67 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
68 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
69 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
71 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
72 Correct 5 ms 384 KB OK (n = 865, answer = YES)
73 Correct 5 ms 384 KB OK (n = 820, answer = YES)
74 Correct 6 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 7 ms 512 KB OK (n = 10000, answer = NO)
76 Correct 7 ms 512 KB OK (n = 10000, answer = NO)
77 Correct 8 ms 512 KB OK (n = 10000, answer = NO)
78 Correct 8 ms 512 KB OK (n = 10000, answer = NO)
79 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
81 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
83 Correct 8 ms 512 KB OK (n = 10000, answer = NO)
84 Correct 10 ms 640 KB OK (n = 10000, answer = YES)
85 Correct 12 ms 1024 KB OK (n = 10000, answer = NO)
86 Correct 8 ms 640 KB OK (n = 10000, answer = YES)
87 Correct 8 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
89 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
90 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
91 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
92 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
93 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
94 Correct 4 ms 256 KB OK (n = 1, answer = YES)
95 Correct 4 ms 256 KB OK (n = 3, answer = YES)
96 Correct 4 ms 384 KB OK (n = 3, answer = NO)
97 Correct 5 ms 256 KB OK (n = 3, answer = YES)
98 Correct 41 ms 3948 KB OK (n = 150000, answer = NO)
99 Incorrect 122 ms 5612 KB sum of weights should be in [2147482647..2147483647] but it is 62277024948
100 Halted 0 ms 0 KB -