답안 #116431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116431 2019-06-12T12:54:13 Z Mamnoon_Siam Meetings (JOI19_meetings) C++17
100 / 100
965 ms 3768 KB
// Query Bridge
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 2e3 + 5;
using ii = pair<int, int>;

int n;
set<ii> ans;
map<int, map<int, map<int, int>>> mem;

int ask(int u, int v, int w) {
	{
		int mn = min({u, v, w});
		int mx = max({u, v, w});
		int md = u + v + w - mn - mx;
		u = mn, v = md, w = mx;
	}
	if(u == v or v == w) return v;
	if(mem[u][v].find(w) == mem[u][v].end()) return mem[u][v][w] = Query(u, v, w);
	else return mem[u][v][w];
}

void add_edge(int u, int v) {
	if(u > v) swap(u, v);
	// cout << "addded = " << u << ' ' << v << endl;
	ans.insert(ii(u, v));
}

void solve(vector<int> &s) {
	if(s.size() < 2) return;
	if(s.size() == 2) {
		add_edge(s[0], s[1]);
		return;
	}
	shuffle(s.begin(), s.end(), rng);
	set<int> path_nodes;
	map<int, int> mp;
	int p = s[0], q = s[1];
	for(int u : s) {
		mp[u] = ask(p, q, u);
		path_nodes.insert(mp[u]);
	}
	path_nodes.erase(p);
	path_nodes.erase(q);
	vector<int> path(path_nodes.begin(), path_nodes.end());
	shuffle(path.begin(), path.end(), rng);
	sort(path.begin(), path.end(), [&](int u, int v){ return ask(p, u, v) == u; });
	for(int i = 1; i < path.size(); i++) {
		add_edge(path[i - 1], path[i]);
	}
	if(path.size()) {
		add_edge(path[0], p);
		add_edge(path.back(), q);
	} else add_edge(p, q);
	map<int, vector<int>> to;
	for(auto i : mp) {
		to[i.second].emplace_back(i.first);
	}
	for(auto i : to) {
		solve(i.second);
	}
}

void Solve(int N) {
	vector<int> v(N);
	iota(v.begin(), v.end(), 0);
	solve(v);
	for(ii i : ans) Bridge(i.first, i.second);
}

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>&)':
meetings.cpp:52:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < path.size(); i++) {
                 ~~^~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 432 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 412 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 432 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 412 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 7 ms 640 KB Output is correct
28 Correct 6 ms 640 KB Output is correct
29 Correct 9 ms 712 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 5 ms 540 KB Output is correct
32 Correct 8 ms 640 KB Output is correct
33 Correct 10 ms 640 KB Output is correct
34 Correct 13 ms 816 KB Output is correct
35 Correct 11 ms 640 KB Output is correct
36 Correct 7 ms 512 KB Output is correct
37 Correct 8 ms 736 KB Output is correct
38 Correct 10 ms 640 KB Output is correct
39 Correct 8 ms 640 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 437 ms 1940 KB Output is correct
2 Correct 466 ms 2028 KB Output is correct
3 Correct 546 ms 2128 KB Output is correct
4 Correct 493 ms 2332 KB Output is correct
5 Correct 248 ms 1872 KB Output is correct
6 Correct 325 ms 2060 KB Output is correct
7 Correct 418 ms 2944 KB Output is correct
8 Correct 491 ms 3624 KB Output is correct
9 Correct 469 ms 3756 KB Output is correct
10 Correct 466 ms 3576 KB Output is correct
11 Correct 749 ms 3528 KB Output is correct
12 Correct 512 ms 2236 KB Output is correct
13 Correct 221 ms 1836 KB Output is correct
14 Correct 291 ms 2400 KB Output is correct
15 Correct 308 ms 2516 KB Output is correct
16 Correct 314 ms 2168 KB Output is correct
17 Correct 532 ms 3764 KB Output is correct
18 Correct 370 ms 2636 KB Output is correct
19 Correct 318 ms 2488 KB Output is correct
20 Correct 307 ms 2272 KB Output is correct
21 Correct 350 ms 2048 KB Output is correct
22 Correct 373 ms 2492 KB Output is correct
23 Correct 395 ms 2656 KB Output is correct
24 Correct 385 ms 2664 KB Output is correct
25 Correct 349 ms 2564 KB Output is correct
26 Correct 470 ms 2808 KB Output is correct
27 Correct 357 ms 2552 KB Output is correct
28 Correct 545 ms 3472 KB Output is correct
29 Correct 464 ms 3768 KB Output is correct
30 Correct 524 ms 3732 KB Output is correct
31 Correct 479 ms 3476 KB Output is correct
32 Correct 965 ms 2692 KB Output is correct
33 Correct 681 ms 3352 KB Output is correct
34 Correct 6 ms 512 KB Output is correct
35 Correct 6 ms 512 KB Output is correct
36 Correct 6 ms 640 KB Output is correct
37 Correct 7 ms 640 KB Output is correct
38 Correct 6 ms 512 KB Output is correct
39 Correct 9 ms 768 KB Output is correct
40 Correct 10 ms 780 KB Output is correct
41 Correct 11 ms 768 KB Output is correct
42 Correct 10 ms 740 KB Output is correct
43 Correct 6 ms 512 KB Output is correct
44 Correct 9 ms 640 KB Output is correct
45 Correct 10 ms 640 KB Output is correct
46 Correct 8 ms 640 KB Output is correct
47 Correct 2 ms 384 KB Output is correct
48 Correct 3 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 304 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 3 ms 384 KB Output is correct
55 Correct 3 ms 384 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 2 ms 384 KB Output is correct
60 Correct 2 ms 256 KB Output is correct
61 Correct 2 ms 256 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 2 ms 256 KB Output is correct
64 Correct 2 ms 256 KB Output is correct
65 Correct 2 ms 256 KB Output is correct
66 Correct 2 ms 256 KB Output is correct
67 Correct 2 ms 304 KB Output is correct
68 Correct 2 ms 432 KB Output is correct
69 Correct 2 ms 256 KB Output is correct
70 Correct 2 ms 256 KB Output is correct
71 Correct 2 ms 256 KB Output is correct
72 Correct 2 ms 384 KB Output is correct