답안 #779909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779909 2023-07-12T02:44:01 Z rxlfd314 Meetings (JOI19_meetings) C++17
100 / 100
1504 ms 1180 KB
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

void solve(vector<int> V) {
	if (V.size() < 2) return;
	int a = V[rand()%V.size()], b = V[rand()%V.size()];
	while (b == a) {
		b = V[rand()%V.size()];
	}

	map<int, vector<int>> subtrees;
	vector<int> roots = {a};
	map<int, bool> seen, pushed;
	seen[a] = seen[b] = true;
	for (int i : V) {
		if (seen[i]) continue;
		int c = Query(i, a, b);
		subtrees[c].push_back(i);
		pushed[c] |= c == i;
		if (!seen[c]) {
			roots.push_back(c);
			seen[c] = true;
		}
	}
	roots.push_back(b);
	
	sort(roots.begin(), roots.end(), [&](const int &i, const int &j) {
		return i == a || j == b ? true : i == b || j == a ? false : Query(a, i, j) == i; 
	});
	for (int i = 0; i+1 < roots.size(); i++) {
		Bridge(min(roots[i], roots[i+1]), max(roots[i], roots[i+1]));
	}
	
	//cerr << "Path: " << a << ", " << b << '\n';
	
	for (int i : roots) {
		if (!pushed[i]) {
			subtrees[i].push_back(i);
		}
		//cerr << "Root: " << i << '\n';
		solve(subtrees[i]);
	}
}

void Solve(int N) {
	srand(time(NULL));
	vector<int> v(N);
	iota(v.begin(), v.end(), 0);
	solve(v);
}

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:31:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for (int i = 0; i+1 < roots.size(); i++) {
      |                  ~~~~^~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 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 1 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 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 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 1 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 0 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 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 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
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 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 1 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 0 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 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 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 4 ms 336 KB Output is correct
28 Correct 4 ms 336 KB Output is correct
29 Correct 3 ms 336 KB Output is correct
30 Correct 3 ms 336 KB Output is correct
31 Correct 3 ms 336 KB Output is correct
32 Correct 3 ms 336 KB Output is correct
33 Correct 5 ms 464 KB Output is correct
34 Correct 6 ms 464 KB Output is correct
35 Correct 7 ms 416 KB Output is correct
36 Correct 3 ms 336 KB Output is correct
37 Correct 8 ms 424 KB Output is correct
38 Correct 6 ms 464 KB Output is correct
39 Correct 5 ms 420 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 732 KB Output is correct
2 Correct 227 ms 936 KB Output is correct
3 Correct 176 ms 872 KB Output is correct
4 Correct 206 ms 916 KB Output is correct
5 Correct 156 ms 632 KB Output is correct
6 Correct 170 ms 872 KB Output is correct
7 Correct 245 ms 776 KB Output is correct
8 Correct 261 ms 972 KB Output is correct
9 Correct 273 ms 904 KB Output is correct
10 Correct 244 ms 1088 KB Output is correct
11 Correct 283 ms 936 KB Output is correct
12 Correct 208 ms 912 KB Output is correct
13 Correct 135 ms 824 KB Output is correct
14 Correct 197 ms 908 KB Output is correct
15 Correct 147 ms 948 KB Output is correct
16 Correct 170 ms 712 KB Output is correct
17 Correct 251 ms 864 KB Output is correct
18 Correct 186 ms 792 KB Output is correct
19 Correct 184 ms 920 KB Output is correct
20 Correct 215 ms 800 KB Output is correct
21 Correct 214 ms 800 KB Output is correct
22 Correct 191 ms 928 KB Output is correct
23 Correct 172 ms 908 KB Output is correct
24 Correct 149 ms 732 KB Output is correct
25 Correct 155 ms 820 KB Output is correct
26 Correct 191 ms 856 KB Output is correct
27 Correct 192 ms 824 KB Output is correct
28 Correct 351 ms 1136 KB Output is correct
29 Correct 226 ms 1056 KB Output is correct
30 Correct 274 ms 1000 KB Output is correct
31 Correct 314 ms 988 KB Output is correct
32 Correct 606 ms 1180 KB Output is correct
33 Correct 1504 ms 1084 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 3 ms 336 KB Output is correct
36 Correct 4 ms 376 KB Output is correct
37 Correct 4 ms 376 KB Output is correct
38 Correct 3 ms 336 KB Output is correct
39 Correct 4 ms 336 KB Output is correct
40 Correct 5 ms 456 KB Output is correct
41 Correct 6 ms 480 KB Output is correct
42 Correct 6 ms 464 KB Output is correct
43 Correct 3 ms 336 KB Output is correct
44 Correct 9 ms 464 KB Output is correct
45 Correct 7 ms 448 KB Output is correct
46 Correct 6 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 0 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 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 1 ms 336 KB Output is correct
62 Correct 0 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 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 0 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct