Submission #753362

# Submission time Handle Problem Language Result Execution time Memory
753362 2023-06-05T06:03:12 Z Dan4Life Meetings (JOI19_meetings) C++17
100 / 100
716 ms 2644 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){
	if(a>b) swap(a,b);
	return Bridge(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(int i = 0; i < n; i++) v[i].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 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 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 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 1 ms 336 KB Output is correct
4 Correct 0 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 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 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 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 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 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 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 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 3 ms 464 KB Output is correct
29 Correct 4 ms 464 KB Output is correct
30 Correct 4 ms 464 KB Output is correct
31 Correct 3 ms 464 KB Output is correct
32 Correct 7 ms 464 KB Output is correct
33 Correct 10 ms 592 KB Output is correct
34 Correct 12 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 11 ms 464 KB Output is correct
38 Correct 10 ms 464 KB Output is correct
39 Correct 9 ms 448 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 409 ms 1640 KB Output is correct
2 Correct 397 ms 1576 KB Output is correct
3 Correct 428 ms 1568 KB Output is correct
4 Correct 402 ms 1432 KB Output is correct
5 Correct 278 ms 1204 KB Output is correct
6 Correct 288 ms 1224 KB Output is correct
7 Correct 532 ms 1936 KB Output is correct
8 Correct 563 ms 2284 KB Output is correct
9 Correct 599 ms 2560 KB Output is correct
10 Correct 540 ms 2420 KB Output is correct
11 Correct 613 ms 2420 KB Output is correct
12 Correct 269 ms 1052 KB Output is correct
13 Correct 199 ms 1032 KB Output is correct
14 Correct 403 ms 1672 KB Output is correct
15 Correct 422 ms 1688 KB Output is correct
16 Correct 385 ms 1544 KB Output is correct
17 Correct 575 ms 2508 KB Output is correct
18 Correct 339 ms 1536 KB Output is correct
19 Correct 344 ms 1592 KB Output is correct
20 Correct 425 ms 1552 KB Output is correct
21 Correct 422 ms 1532 KB Output is correct
22 Correct 458 ms 1656 KB Output is correct
23 Correct 543 ms 1840 KB Output is correct
24 Correct 500 ms 1816 KB Output is correct
25 Correct 425 ms 1664 KB Output is correct
26 Correct 405 ms 1660 KB Output is correct
27 Correct 423 ms 1712 KB Output is correct
28 Correct 657 ms 2644 KB Output is correct
29 Correct 540 ms 2632 KB Output is correct
30 Correct 575 ms 2592 KB Output is correct
31 Correct 583 ms 2504 KB Output is correct
32 Correct 716 ms 1104 KB Output is correct
33 Correct 675 ms 1096 KB Output is correct
34 Correct 5 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 4 ms 472 KB Output is correct
39 Correct 6 ms 464 KB Output is correct
40 Correct 11 ms 640 KB Output is correct
41 Correct 13 ms 636 KB Output is correct
42 Correct 12 ms 592 KB Output is correct
43 Correct 3 ms 464 KB Output is correct
44 Correct 9 ms 476 KB Output is correct
45 Correct 9 ms 464 KB Output is correct
46 Correct 10 ms 464 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 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 0 ms 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 1 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 1 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 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