Submission #753355

# Submission time Handle Problem Language Result Execution time Memory
753355 2023-06-05T05:55:54 Z Dan4Life Meetings (JOI19_meetings) C++17
100 / 100
636 ms 2796 KB
#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;
 
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int mxN = (int)2e3+10;
int n, used[mxN];
vector<int> S[mxN];
 
void mergeSort(vector<int> &v, int a, int b){
	if(sz(v)<=1) return;
	int mid = sz(v)/2;
	vector<int> w,x; w.clear(), x.clear();
	for(int i = 0; i < mid; i++) w.pb(v[i]);
	for(int i = mid; i < sz(v); i++) x.pb(v[i]);
	mergeSort(w,a,b), mergeSort(x,a,b); v.clear();
	int i = 0, j = 0;
	while(i<sz(w) and j<sz(x)){
		if(Query(a,w[i],x[j])==w[i]) v.pb(w[i++]);
		else v.pb(x[j++]);
	}
	while(i<sz(w)) v.pb(w[i++]);
	while(j<sz(x)) v.pb(x[j++]);
}
 
void bridge(int a, int b){
	if(a>b) swap(a,b);
	return Bridge(a,b);
}
 
void recur(int a, vector<int> SS){
	if(SS.empty()) return;
	auto itr = SS.begin();
	int r = rand()%sz(SS);
	while(r--) itr++;
	int b = *itr; used[a]=used[b]=1;
	vector<int> path; path.clear();
	vector<int> S[n+1];
	for(int i = 0; i < n; i++) S[i].clear();
	for(auto i : SS){ if(!used[i]){
		int x = Query(a,b,i);
		if(x==i) path.pb(i),used[i]=1;
		else S[x].pb(i);
	} }
	mergeSort(path,a,b);
	if(path.empty()) bridge(a,b);
	else bridge(a,path[0]),bridge(path.back(),b);
	for(int i = 0; i < sz(path)-1; i++) bridge(path[i],path[i+1]);
	for(auto u : path) recur(u,S[u]);
 	recur(a,S[a]); recur(b,S[b]);
}
 
void Solve(int N) {
	n = N; vector<int> v;
	for(int i = 1; i < n; i++) S[0].pb(i);
	recur(0,S[0]);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 4 ms 464 KB Output is correct
28 Correct 7 ms 488 KB Output is correct
29 Correct 4 ms 464 KB Output is correct
30 Correct 4 ms 464 KB Output is correct
31 Correct 5 ms 464 KB Output is correct
32 Correct 7 ms 552 KB Output is correct
33 Correct 10 ms 592 KB Output is correct
34 Correct 15 ms 592 KB Output is correct
35 Correct 12 ms 692 KB Output is correct
36 Correct 5 ms 464 KB Output is correct
37 Correct 10 ms 464 KB Output is correct
38 Correct 9 ms 456 KB Output is correct
39 Correct 6 ms 464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 366 ms 1620 KB Output is correct
2 Correct 421 ms 1388 KB Output is correct
3 Correct 493 ms 1440 KB Output is correct
4 Correct 413 ms 1524 KB Output is correct
5 Correct 280 ms 1096 KB Output is correct
6 Correct 287 ms 1252 KB Output is correct
7 Correct 499 ms 1904 KB Output is correct
8 Correct 595 ms 2412 KB Output is correct
9 Correct 574 ms 2760 KB Output is correct
10 Correct 516 ms 2480 KB Output is correct
11 Correct 619 ms 2596 KB Output is correct
12 Correct 292 ms 1192 KB Output is correct
13 Correct 187 ms 1160 KB Output is correct
14 Correct 396 ms 1852 KB Output is correct
15 Correct 360 ms 1616 KB Output is correct
16 Correct 446 ms 1700 KB Output is correct
17 Correct 585 ms 2752 KB Output is correct
18 Correct 333 ms 1548 KB Output is correct
19 Correct 310 ms 1408 KB Output is correct
20 Correct 441 ms 1660 KB Output is correct
21 Correct 450 ms 1612 KB Output is correct
22 Correct 478 ms 1812 KB Output is correct
23 Correct 503 ms 1864 KB Output is correct
24 Correct 416 ms 1696 KB Output is correct
25 Correct 387 ms 1428 KB Output is correct
26 Correct 380 ms 1784 KB Output is correct
27 Correct 409 ms 1608 KB Output is correct
28 Correct 636 ms 2588 KB Output is correct
29 Correct 538 ms 2676 KB Output is correct
30 Correct 581 ms 2796 KB Output is correct
31 Correct 593 ms 2504 KB Output is correct
32 Correct 610 ms 1348 KB Output is correct
33 Correct 436 ms 968 KB Output is correct
34 Correct 4 ms 464 KB Output is correct
35 Correct 4 ms 464 KB Output is correct
36 Correct 4 ms 464 KB Output is correct
37 Correct 4 ms 464 KB Output is correct
38 Correct 5 ms 520 KB Output is correct
39 Correct 7 ms 464 KB Output is correct
40 Correct 10 ms 556 KB Output is correct
41 Correct 14 ms 612 KB Output is correct
42 Correct 11 ms 592 KB Output is correct
43 Correct 5 ms 464 KB Output is correct
44 Correct 11 ms 464 KB Output is correct
45 Correct 9 ms 456 KB Output is correct
46 Correct 5 ms 464 KB Output is correct
47 Correct 0 ms 336 KB Output is correct
48 Correct 0 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 0 ms 336 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 0 ms 336 KB Output is correct
64 Correct 0 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 1 ms 336 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct