Submission #753373

# Submission time Handle Problem Language Result Execution time Memory
753373 2023-06-05T06:12:14 Z Dan4Life Meetings (JOI19_meetings) C++17
100 / 100
758 ms 2632 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, vis[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)]; vis[a]=vis[b]=1;
	vi path, v[n+1]; path.clear();
	for(auto i : w){ if(!vis[i]){
		int x = Query(a,b,i);
		if(x==i) path.pb(i),vis[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 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 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 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 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 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 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 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 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 1 ms 352 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 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 1 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 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 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 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 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 1 ms 352 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 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 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 5 ms 464 KB Output is correct
28 Correct 3 ms 496 KB Output is correct
29 Correct 5 ms 464 KB Output is correct
30 Correct 4 ms 464 KB Output is correct
31 Correct 4 ms 464 KB Output is correct
32 Correct 6 ms 464 KB Output is correct
33 Correct 13 ms 656 KB Output is correct
34 Correct 16 ms 592 KB Output is correct
35 Correct 12 ms 592 KB Output is correct
36 Correct 4 ms 464 KB Output is correct
37 Correct 9 ms 568 KB Output is correct
38 Correct 10 ms 464 KB Output is correct
39 Correct 10 ms 464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 467 ms 1528 KB Output is correct
2 Correct 430 ms 1504 KB Output is correct
3 Correct 443 ms 1548 KB Output is correct
4 Correct 427 ms 1304 KB Output is correct
5 Correct 295 ms 1376 KB Output is correct
6 Correct 302 ms 1236 KB Output is correct
7 Correct 545 ms 2180 KB Output is correct
8 Correct 580 ms 2304 KB Output is correct
9 Correct 611 ms 2600 KB Output is correct
10 Correct 530 ms 2632 KB Output is correct
11 Correct 619 ms 2384 KB Output is correct
12 Correct 277 ms 1052 KB Output is correct
13 Correct 237 ms 1024 KB Output is correct
14 Correct 410 ms 1772 KB Output is correct
15 Correct 379 ms 1860 KB Output is correct
16 Correct 404 ms 1544 KB Output is correct
17 Correct 598 ms 2392 KB Output is correct
18 Correct 336 ms 1532 KB Output is correct
19 Correct 334 ms 1532 KB Output is correct
20 Correct 502 ms 1688 KB Output is correct
21 Correct 454 ms 1704 KB Output is correct
22 Correct 464 ms 1664 KB Output is correct
23 Correct 564 ms 1888 KB Output is correct
24 Correct 504 ms 1872 KB Output is correct
25 Correct 460 ms 1680 KB Output is correct
26 Correct 413 ms 1656 KB Output is correct
27 Correct 441 ms 1636 KB Output is correct
28 Correct 692 ms 2628 KB Output is correct
29 Correct 561 ms 2500 KB Output is correct
30 Correct 563 ms 2476 KB Output is correct
31 Correct 598 ms 2488 KB Output is correct
32 Correct 758 ms 1216 KB Output is correct
33 Correct 697 ms 1072 KB Output is correct
34 Correct 6 ms 464 KB Output is correct
35 Correct 3 ms 464 KB Output is correct
36 Correct 4 ms 464 KB Output is correct
37 Correct 3 ms 464 KB Output is correct
38 Correct 3 ms 464 KB Output is correct
39 Correct 8 ms 464 KB Output is correct
40 Correct 12 ms 560 KB Output is correct
41 Correct 13 ms 648 KB Output is correct
42 Correct 15 ms 672 KB Output is correct
43 Correct 3 ms 424 KB Output is correct
44 Correct 10 ms 452 KB Output is correct
45 Correct 9 ms 464 KB Output is correct
46 Correct 9 ms 444 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 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 336 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 0 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 0 ms 336 KB Output is correct
62 Correct 0 ms 336 KB Output is correct
63 Correct 1 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 0 ms 336 KB Output is correct
67 Correct 1 ms 336 KB Output is correct
68 Correct 1 ms 336 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 1 ms 388 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 0 ms 296 KB Output is correct