Submission #753369

# Submission time Handle Problem Language Result Execution time Memory
753369 2023-06-05T06:06:26 Z Dan4Life Meetings (JOI19_meetings) C++17
100 / 100
765 ms 2740 KB
#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;
using vi = vector<int>;
#define pb push_back
#define sz(a) (int)a.size()
const int mxN = (int)2e3+10;
int n, used[mxN];
vi v[mxN];
 
void mergeSort(vi &v, int a, int b){
	if(sz(v)<=1) return;
	int mid = sz(v)/2;
	vi 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){ return Bridge(min(a,b),max(a,b)); }
 
void recur(int a, vi &w){
	if(w.empty()) return;
	int b = w[rand()%sz(w)]; used[a]=used[b]=1;
	vi path, v[n+1]; path.clear();
	for(auto i : w){ if(!used[i]){
		int x = Query(a,b,i);
		if(x==i) path.pb(i),used[i]=1;
		else v[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,v[u]);
 	recur(a,v[a]); recur(b,v[b]);
}
 
void Solve(int N) {
	n = N; int x = rand()%N;
	for(int i = 0; i < n; i++) if(x!=i) v[x].pb(i);
	random_shuffle(begin(v[x]),end(v[x])); recur(x,v[x]);
}
# 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 1 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 1 ms 336 KB Output is correct
9 Correct 1 ms 380 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 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 1 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 1 ms 336 KB Output is correct
9 Correct 1 ms 380 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 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 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 1 ms 336 KB Output is correct
19 Correct 1 ms 416 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 0 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 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 1 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 1 ms 336 KB Output is correct
9 Correct 1 ms 380 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 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 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 1 ms 336 KB Output is correct
19 Correct 1 ms 416 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 0 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 0 ms 336 KB Output is correct
27 Correct 6 ms 464 KB Output is correct
28 Correct 5 ms 508 KB Output is correct
29 Correct 4 ms 464 KB Output is correct
30 Correct 4 ms 464 KB Output is correct
31 Correct 4 ms 496 KB Output is correct
32 Correct 6 ms 464 KB Output is correct
33 Correct 12 ms 592 KB Output is correct
34 Correct 13 ms 660 KB Output is correct
35 Correct 13 ms 592 KB Output is correct
36 Correct 4 ms 416 KB Output is correct
37 Correct 9 ms 412 KB Output is correct
38 Correct 10 ms 440 KB Output is correct
39 Correct 10 ms 464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 454 ms 1500 KB Output is correct
2 Correct 413 ms 1504 KB Output is correct
3 Correct 466 ms 1628 KB Output is correct
4 Correct 442 ms 1380 KB Output is correct
5 Correct 287 ms 1220 KB Output is correct
6 Correct 301 ms 1252 KB Output is correct
7 Correct 540 ms 2052 KB Output is correct
8 Correct 595 ms 2300 KB Output is correct
9 Correct 596 ms 2588 KB Output is correct
10 Correct 556 ms 2740 KB Output is correct
11 Correct 674 ms 2436 KB Output is correct
12 Correct 286 ms 1104 KB Output is correct
13 Correct 220 ms 1056 KB Output is correct
14 Correct 406 ms 1676 KB Output is correct
15 Correct 420 ms 1864 KB Output is correct
16 Correct 408 ms 1660 KB Output is correct
17 Correct 595 ms 2428 KB Output is correct
18 Correct 333 ms 1612 KB Output is correct
19 Correct 356 ms 1540 KB Output is correct
20 Correct 455 ms 1564 KB Output is correct
21 Correct 463 ms 1664 KB Output is correct
22 Correct 477 ms 1700 KB Output is correct
23 Correct 556 ms 1760 KB Output is correct
24 Correct 500 ms 1892 KB Output is correct
25 Correct 437 ms 1664 KB Output is correct
26 Correct 387 ms 1656 KB Output is correct
27 Correct 434 ms 1588 KB Output is correct
28 Correct 653 ms 2584 KB Output is correct
29 Correct 541 ms 2528 KB Output is correct
30 Correct 656 ms 2616 KB Output is correct
31 Correct 570 ms 2324 KB Output is correct
32 Correct 765 ms 1208 KB Output is correct
33 Correct 665 ms 1036 KB Output is correct
34 Correct 5 ms 464 KB Output is correct
35 Correct 4 ms 508 KB Output is correct
36 Correct 4 ms 464 KB Output is correct
37 Correct 4 ms 468 KB Output is correct
38 Correct 4 ms 464 KB Output is correct
39 Correct 6 ms 464 KB Output is correct
40 Correct 11 ms 592 KB Output is correct
41 Correct 12 ms 592 KB Output is correct
42 Correct 11 ms 592 KB Output is correct
43 Correct 3 ms 480 KB Output is correct
44 Correct 10 ms 464 KB Output is correct
45 Correct 10 ms 464 KB Output is correct
46 Correct 9 ms 440 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 0 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 464 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 0 ms 336 KB Output is correct
61 Correct 1 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 1 ms 336 KB Output is correct
66 Correct 0 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 1 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct