Submission #753354

# Submission time Handle Problem Language Result Execution time Memory
753354 2023-06-05T05:54:44 Z Dan4Life Meetings (JOI19_meetings) C++17
100 / 100
692 ms 5900 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];
set<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, set<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();
	set<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].insert(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].insert(i);
	recur(0,S[0]);
}
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 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 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 1 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 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 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 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 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 0 ms 464 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 0 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 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 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 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 0 ms 464 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 0 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 5 ms 696 KB Output is correct
28 Correct 7 ms 720 KB Output is correct
29 Correct 5 ms 592 KB Output is correct
30 Correct 4 ms 720 KB Output is correct
31 Correct 5 ms 720 KB Output is correct
32 Correct 6 ms 720 KB Output is correct
33 Correct 12 ms 972 KB Output is correct
34 Correct 15 ms 1160 KB Output is correct
35 Correct 13 ms 1104 KB Output is correct
36 Correct 4 ms 592 KB Output is correct
37 Correct 15 ms 792 KB Output is correct
38 Correct 12 ms 592 KB Output is correct
39 Correct 6 ms 592 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 352 ms 2832 KB Output is correct
2 Correct 425 ms 2736 KB Output is correct
3 Correct 482 ms 3112 KB Output is correct
4 Correct 395 ms 2724 KB Output is correct
5 Correct 292 ms 2072 KB Output is correct
6 Correct 288 ms 2488 KB Output is correct
7 Correct 528 ms 3900 KB Output is correct
8 Correct 609 ms 5340 KB Output is correct
9 Correct 569 ms 5284 KB Output is correct
10 Correct 532 ms 5036 KB Output is correct
11 Correct 692 ms 5472 KB Output is correct
12 Correct 318 ms 2144 KB Output is correct
13 Correct 216 ms 1900 KB Output is correct
14 Correct 413 ms 3548 KB Output is correct
15 Correct 383 ms 2996 KB Output is correct
16 Correct 426 ms 3320 KB Output is correct
17 Correct 638 ms 5776 KB Output is correct
18 Correct 332 ms 2580 KB Output is correct
19 Correct 347 ms 2656 KB Output is correct
20 Correct 474 ms 3144 KB Output is correct
21 Correct 464 ms 3088 KB Output is correct
22 Correct 465 ms 3448 KB Output is correct
23 Correct 555 ms 3836 KB Output is correct
24 Correct 452 ms 2888 KB Output is correct
25 Correct 424 ms 2564 KB Output is correct
26 Correct 390 ms 2804 KB Output is correct
27 Correct 425 ms 2576 KB Output is correct
28 Correct 667 ms 5028 KB Output is correct
29 Correct 568 ms 5772 KB Output is correct
30 Correct 630 ms 5900 KB Output is correct
31 Correct 647 ms 5424 KB Output is correct
32 Correct 657 ms 2156 KB Output is correct
33 Correct 449 ms 1272 KB Output is correct
34 Correct 5 ms 720 KB Output is correct
35 Correct 5 ms 640 KB Output is correct
36 Correct 5 ms 592 KB Output is correct
37 Correct 4 ms 720 KB Output is correct
38 Correct 6 ms 720 KB Output is correct
39 Correct 7 ms 720 KB Output is correct
40 Correct 12 ms 976 KB Output is correct
41 Correct 15 ms 1224 KB Output is correct
42 Correct 14 ms 1100 KB Output is correct
43 Correct 4 ms 592 KB Output is correct
44 Correct 11 ms 592 KB Output is correct
45 Correct 10 ms 592 KB Output is correct
46 Correct 7 ms 592 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 1 ms 464 KB Output is correct
49 Correct 1 ms 464 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 1 ms 464 KB Output is correct
52 Correct 1 ms 464 KB Output is correct
53 Correct 1 ms 464 KB Output is correct
54 Correct 1 ms 464 KB Output is correct
55 Correct 1 ms 464 KB Output is correct
56 Correct 1 ms 464 KB Output is correct
57 Correct 1 ms 464 KB Output is correct
58 Correct 1 ms 464 KB Output is correct
59 Correct 1 ms 464 KB Output is correct
60 Correct 0 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 1 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