oj.uz

답안 #115265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115265 2019-06-06T12:26:03 Z gs14004 World of Tank (innopolis2018_final_E) C++17
100 / 100
 940 ms 55764 KB 
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 3000005;

vector<int> v[2], ev;
bool trk[MAXN][2];
int dp[MAXN][2];
int n, t;

bool Has(int y, int x){
	return binary_search(v[x].begin(), v[x].end(), y);
}

bool findCut(){
	for(auto &i : v[0]){
		ev.push_back(i);
		ev.push_back(i + 1);
	}
	for(auto &i : v[1]){
		ev.push_back(i);
		ev.push_back(i + 1);
	}
	ev.push_back(0);
	sort(ev.begin(), ev.end());
	ev.resize(unique(ev.begin(), ev.end()) - ev.begin());
	dp[0][1] = -2e9;
	for(int i=1; i<ev.size(); i++){
		for(int j=0; j<2; j++){
			if(!Has(ev[i - 1], j) && dp[i-1][j] < min(dp[i-1][j^1], t)){
				dp[i][j] = min(dp[i-1][j^1], t) + ev[i] - ev[i-1];
				trk[i][j] = 1;
			}
			else{
				dp[i][j] = dp[i-1][j] + ev[i] - ev[i-1];
			}
			if(Has(ev[i], j)){
				dp[i][j] -= t;
				if(dp[i][j] <= 0) dp[i][j] = -2e9;
			}
		}
	}
	return max(dp[ev.size() - 1][0], dp[ev.size() - 1][1]) >= 0;
}

void trace(){
	int pos = 0;
	if(dp[ev.size() - 1][0] < 0) pos = 1;
	vector<pi> boom;
	vector<int> trans;
	for(int i=ev.size() - 1; i; i--){
		if(Has(ev[i], pos)){
			int where = ev[i] - dp[i][pos];
			where = max(where, 1);
			boom.emplace_back(where, pos + 1);
			dp[i][pos] += t;
		}
		if(trk[i][pos]){
			pos ^= 1;
			trans.push_back(ev[i - 1]);
		}
	}
	assert(pos == 0);
	reverse(trans.begin(), trans.end());
	reverse(boom.begin(), boom.end());
	cout << trans.size() << endl;
	for(auto &i : trans) printf("%d ", i);
	cout << endl <<  boom.size() << endl;
	for(auto &i : boom) printf("%d %d\n", i.first, i.second);
}

int main(){
	int t0, t1;
	scanf("%d %d %d %d",&n,&t0,&t1,&t);
	v[0].resize(t0);
	v[1].resize(t1);
	for(int i=0; i<2; i++){
		for(auto &j : v[i]){
			scanf("%d",&j);
		}
	}
	if(!findCut()){
		puts("No");
		return 0;
	}
	puts("Yes");
	trace();
}

Compilation message

E.cpp: In function 'bool findCut()':
E.cpp:29:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i<ev.size(); i++){
               ~^~~~~~~~~~
E.cpp: In function 'int main()':
E.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d",&n,&t0,&t1,&t);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
E.cpp:80:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&j);
    ~~~~~^~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 3 ms 428 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 3 ms 512 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 4 ms 512 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 3 ms 512 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 3 ms 512 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 12, m2 = 9, t = 3
2 Correct 2 ms 384 KB [OK, Yes] n = 10, m1 = 4, m2 = 2, t = 2
3 Correct 2 ms 256 KB [OK, Yes] n = 10, m1 = 6, m2 = 0, t = 2
4 Correct 2 ms 256 KB [OK, Yes] n = 10, m1 = 2, m2 = 4, t = 1
5 Correct 2 ms 384 KB [OK, No] n = 20, m1 = 4, m2 = 11, t = 2
6 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 1
7 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 2
8 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 0, m2 = 10, t = 2
9 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 4, m2 = 6, t = 2
10 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 9, m2 = 1, t = 2
11 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 10, m2 = 9, t = 2
12 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 2
13 Correct 2 ms 304 KB [OK, Yes] n = 20, m1 = 0, m2 = 0, t = 3
14 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 5, m2 = 4, t = 3
15 Correct 2 ms 384 KB [OK, Yes] n = 9, m1 = 4, m2 = 3, t = 3
16 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 8, m2 = 8, t = 3
17 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 9, m2 = 7, t = 3
18 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 7
19 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 7, m2 = 10, t = 8
20 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 13, m2 = 10, t = 4
21 Correct 2 ms 300 KB [OK, Yes] n = 20, m1 = 9, m2 = 9, t = 8
22 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 10, m2 = 11, t = 3
23 Correct 2 ms 356 KB [OK, Yes] n = 20, m1 = 11, m2 = 11, t = 3

Subtask #4
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 3 ms 428 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 3 ms 512 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 4 ms 512 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 3 ms 512 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 3 ms 512 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501
24 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 197, m2 = 53, t = 2
25 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 189, m2 = 61, t = 3
26 Correct 2 ms 384 KB [OK, No] n = 500, m1 = 66, m2 = 184, t = 4
27 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
28 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
29 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 205, m2 = 295, t = 1
30 Correct 184 ms 9960 KB [OK, Yes] n = 1000000, m1 = 183472, m2 = 66528, t = 7
31 Correct 177 ms 9104 KB [OK, Yes] n = 1000000, m1 = 206211, m2 = 43789, t = 6
32 Correct 169 ms 8528 KB [OK, Yes] n = 1000000, m1 = 229445, m2 = 20555, t = 7
33 Correct 282 ms 13924 KB [OK, No] n = 1000000, m1 = 261335, m2 = 238665, t = 2
34 Correct 347 ms 17140 KB [OK, Yes] n = 1000000, m1 = 374819, m2 = 125181, t = 3
35 Correct 303 ms 16496 KB [OK, Yes] n = 1000000, m1 = 88376, m2 = 411624, t = 3
36 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 125, m2 = 125, t = 2
37 Correct 315 ms 18144 KB [OK, Yes] n = 1000000, m1 = 250000, m2 = 250000, t = 2
38 Correct 139 ms 7572 KB [OK, Yes] n = 1000000, m1 = 94957, m2 = 94938, t = 12
39 Correct 145 ms 8224 KB [OK, Yes] n = 1000000, m1 = 94972, m2 = 95007, t = 10
40 Correct 22 ms 1636 KB [OK, Yes] n = 1000000, m1 = 14064, m2 = 13936, t = 200
41 Correct 26 ms 1784 KB [OK, Yes] n = 1000000, m1 = 15990, m2 = 16010, t = 139
42 Correct 50 ms 3412 KB [OK, Yes] n = 1000000, m1 = 32291, m2 = 32404, t = 34
43 Correct 124 ms 6788 KB [OK, Yes] n = 1000000, m1 = 88230, m2 = 88238, t = 13
44 Correct 68 ms 4204 KB [OK, Yes] n = 1000000, m1 = 44550, m2 = 44400, t = 34
45 Correct 50 ms 3308 KB [OK, Yes] n = 1000000, m1 = 31778, m2 = 31772, t = 44
46 Correct 178 ms 8496 KB [OK, No] n = 1000000, m1 = 147142, m2 = 147242, t = 10
47 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 416, m2 = 417, t = 77
48 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 412, m2 = 414, t = 111
49 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 422, m2 = 423, t = 62
50 Correct 2 ms 384 KB [OK, Yes] n = 800, m1 = 279, m2 = 270, t = 33

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 3 ms 428 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 384 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 3 ms 512 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 4 ms 512 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 3 ms 384 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 3 ms 512 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 3 ms 384 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 3 ms 512 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501
24 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 12, m2 = 9, t = 3
25 Correct 2 ms 384 KB [OK, Yes] n = 10, m1 = 4, m2 = 2, t = 2
26 Correct 2 ms 256 KB [OK, Yes] n = 10, m1 = 6, m2 = 0, t = 2
27 Correct 2 ms 256 KB [OK, Yes] n = 10, m1 = 2, m2 = 4, t = 1
28 Correct 2 ms 384 KB [OK, No] n = 20, m1 = 4, m2 = 11, t = 2
29 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 1
30 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 2
31 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 0, m2 = 10, t = 2
32 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 4, m2 = 6, t = 2
33 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 9, m2 = 1, t = 2
34 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 10, m2 = 9, t = 2
35 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 2
36 Correct 2 ms 304 KB [OK, Yes] n = 20, m1 = 0, m2 = 0, t = 3
37 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 5, m2 = 4, t = 3
38 Correct 2 ms 384 KB [OK, Yes] n = 9, m1 = 4, m2 = 3, t = 3
39 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 8, m2 = 8, t = 3
40 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 9, m2 = 7, t = 3
41 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 7
42 Correct 2 ms 256 KB [OK, Yes] n = 20, m1 = 7, m2 = 10, t = 8
43 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 13, m2 = 10, t = 4
44 Correct 2 ms 300 KB [OK, Yes] n = 20, m1 = 9, m2 = 9, t = 8
45 Correct 2 ms 384 KB [OK, Yes] n = 20, m1 = 10, m2 = 11, t = 3
46 Correct 2 ms 356 KB [OK, Yes] n = 20, m1 = 11, m2 = 11, t = 3
47 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 197, m2 = 53, t = 2
48 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 189, m2 = 61, t = 3
49 Correct 2 ms 384 KB [OK, No] n = 500, m1 = 66, m2 = 184, t = 4
50 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
51 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
52 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 205, m2 = 295, t = 1
53 Correct 184 ms 9960 KB [OK, Yes] n = 1000000, m1 = 183472, m2 = 66528, t = 7
54 Correct 177 ms 9104 KB [OK, Yes] n = 1000000, m1 = 206211, m2 = 43789, t = 6
55 Correct 169 ms 8528 KB [OK, Yes] n = 1000000, m1 = 229445, m2 = 20555, t = 7
56 Correct 282 ms 13924 KB [OK, No] n = 1000000, m1 = 261335, m2 = 238665, t = 2
57 Correct 347 ms 17140 KB [OK, Yes] n = 1000000, m1 = 374819, m2 = 125181, t = 3
58 Correct 303 ms 16496 KB [OK, Yes] n = 1000000, m1 = 88376, m2 = 411624, t = 3
59 Correct 2 ms 384 KB [OK, Yes] n = 500, m1 = 125, m2 = 125, t = 2
60 Correct 315 ms 18144 KB [OK, Yes] n = 1000000, m1 = 250000, m2 = 250000, t = 2
61 Correct 139 ms 7572 KB [OK, Yes] n = 1000000, m1 = 94957, m2 = 94938, t = 12
62 Correct 145 ms 8224 KB [OK, Yes] n = 1000000, m1 = 94972, m2 = 95007, t = 10
63 Correct 22 ms 1636 KB [OK, Yes] n = 1000000, m1 = 14064, m2 = 13936, t = 200
64 Correct 26 ms 1784 KB [OK, Yes] n = 1000000, m1 = 15990, m2 = 16010, t = 139
65 Correct 50 ms 3412 KB [OK, Yes] n = 1000000, m1 = 32291, m2 = 32404, t = 34
66 Correct 124 ms 6788 KB [OK, Yes] n = 1000000, m1 = 88230, m2 = 88238, t = 13
67 Correct 68 ms 4204 KB [OK, Yes] n = 1000000, m1 = 44550, m2 = 44400, t = 34
68 Correct 50 ms 3308 KB [OK, Yes] n = 1000000, m1 = 31778, m2 = 31772, t = 44
69 Correct 178 ms 8496 KB [OK, No] n = 1000000, m1 = 147142, m2 = 147242, t = 10
70 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 416, m2 = 417, t = 77
71 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 412, m2 = 414, t = 111
72 Correct 2 ms 384 KB [OK, Yes] n = 1000, m1 = 422, m2 = 423, t = 62
73 Correct 2 ms 384 KB [OK, Yes] n = 800, m1 = 279, m2 = 270, t = 33
74 Correct 3 ms 384 KB [OK, Yes] n = 1000000000, m1 = 489, m2 = 511, t = 3000000
75 Correct 3 ms 384 KB [OK, Yes] n = 100000000, m1 = 496, m2 = 504, t = 300000
76 Correct 3 ms 384 KB [OK, Yes] n = 100000000, m1 = 506, m2 = 494, t = 400000
77 Correct 2 ms 384 KB [OK, Yes] n = 100000000, m1 = 520, m2 = 480, t = 230000
78 Correct 3 ms 384 KB [OK, Yes] n = 1000000000, m1 = 995, m2 = 1005, t = 1100000
79 Correct 3 ms 412 KB [OK, Yes] n = 1000000000, m1 = 1016, m2 = 984, t = 1100003
80 Correct 769 ms 45504 KB [OK, Yes] n = 10000000, m1 = 423780, m2 = 576220, t = 1
81 Correct 717 ms 41036 KB [OK, Yes] n = 10000000, m1 = 102640, m2 = 897360, t = 16
82 Correct 927 ms 50824 KB [OK, Yes] n = 10000000, m1 = 922340, m2 = 77660, t = 6
83 Correct 656 ms 36820 KB [OK, Yes] n = 10000000, m1 = 66539, m2 = 933461, t = 5
84 Correct 723 ms 43008 KB [OK, Yes] n = 10000000, m1 = 156107, m2 = 843893, t = 17
85 Correct 940 ms 55764 KB [OK, Yes] n = 1000000000, m1 = 950948, m2 = 49052, t = 297
86 Correct 783 ms 46992 KB [OK, Yes] n = 1000000000, m1 = 288017, m2 = 711983, t = 1174
87 Correct 773 ms 44372 KB [OK, Yes] n = 1000000000, m1 = 103443, m2 = 896557, t = 1547
88 Correct 718 ms 42896 KB [OK, Yes] n = 1000000000, m1 = 51412, m2 = 948588, t = 1440
89 Correct 760 ms 43220 KB [OK, Yes] n = 1000000000, m1 = 192898, m2 = 807102, t = 581
90 Correct 635 ms 41044 KB [OK, Yes] n = 1000000000, m1 = 500000, m2 = 500000, t = 2
91 Correct 780 ms 45064 KB [OK, Yes] n = 1000000000, m1 = 499558, m2 = 500434, t = 2500
92 Correct 765 ms 44648 KB [OK, Yes] n = 1000000000, m1 = 496969, m2 = 497436, t = 3000
93 Correct 708 ms 42324 KB [OK, Yes] n = 1000000000, m1 = 444326, m2 = 444763, t = 4000
94 Correct 672 ms 39040 KB [OK, No] n = 1000000000, m1 = 499655, m2 = 500345, t = 2000
95 Correct 685 ms 40660 KB [OK, Yes] n = 1000000000, m1 = 423266, m2 = 423367, t = 4500
96 Correct 716 ms 40476 KB [OK, No] n = 1000000000, m1 = 499763, m2 = 500237, t = 3500
97 Correct 658 ms 39764 KB [OK, Yes] n = 1000000000, m1 = 404552, m2 = 404965, t = 5000