Submission #726717

# Submission time Handle Problem Language Result Execution time Memory
726717 2023-04-19T09:25:54 Z josanneo22 Meetings (JOI19_meetings) C++17
100 / 100
918 ms 3828 KB
#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:51:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |  for(int i = 1; i < path.size(); i++) {
      |                 ~~^~~~~~~~~~~~~
# 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 0 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 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 1 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 0 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 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 1 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 1 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
# 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 0 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 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 1 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 1 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 6 ms 592 KB Output is correct
28 Correct 8 ms 480 KB Output is correct
29 Correct 6 ms 592 KB Output is correct
30 Correct 6 ms 592 KB Output is correct
31 Correct 4 ms 464 KB Output is correct
32 Correct 6 ms 592 KB Output is correct
33 Correct 11 ms 848 KB Output is correct
34 Correct 9 ms 704 KB Output is correct
35 Correct 9 ms 756 KB Output is correct
36 Correct 4 ms 464 KB Output is correct
37 Correct 13 ms 720 KB Output is correct
38 Correct 8 ms 592 KB Output is correct
39 Correct 10 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 362 ms 2332 KB Output is correct
2 Correct 383 ms 2388 KB Output is correct
3 Correct 367 ms 2320 KB Output is correct
4 Correct 331 ms 2120 KB Output is correct
5 Correct 203 ms 1864 KB Output is correct
6 Correct 239 ms 2156 KB Output is correct
7 Correct 343 ms 2908 KB Output is correct
8 Correct 415 ms 3248 KB Output is correct
9 Correct 359 ms 3564 KB Output is correct
10 Correct 345 ms 3508 KB Output is correct
11 Correct 467 ms 3828 KB Output is correct
12 Correct 424 ms 2052 KB Output is correct
13 Correct 357 ms 2184 KB Output is correct
14 Correct 332 ms 2508 KB Output is correct
15 Correct 298 ms 2744 KB Output is correct
16 Correct 356 ms 2856 KB Output is correct
17 Correct 432 ms 3648 KB Output is correct
18 Correct 261 ms 2316 KB Output is correct
19 Correct 250 ms 2228 KB Output is correct
20 Correct 300 ms 2120 KB Output is correct
21 Correct 376 ms 2612 KB Output is correct
22 Correct 275 ms 2140 KB Output is correct
23 Correct 340 ms 2420 KB Output is correct
24 Correct 327 ms 2300 KB Output is correct
25 Correct 402 ms 2636 KB Output is correct
26 Correct 300 ms 2184 KB Output is correct
27 Correct 295 ms 2184 KB Output is correct
28 Correct 429 ms 3488 KB Output is correct
29 Correct 326 ms 3528 KB Output is correct
30 Correct 434 ms 3640 KB Output is correct
31 Correct 388 ms 3636 KB Output is correct
32 Correct 918 ms 3784 KB Output is correct
33 Correct 467 ms 3652 KB Output is correct
34 Correct 4 ms 464 KB Output is correct
35 Correct 5 ms 592 KB Output is correct
36 Correct 5 ms 592 KB Output is correct
37 Correct 6 ms 512 KB Output is correct
38 Correct 4 ms 464 KB Output is correct
39 Correct 5 ms 592 KB Output is correct
40 Correct 8 ms 720 KB Output is correct
41 Correct 10 ms 728 KB Output is correct
42 Correct 10 ms 788 KB Output is correct
43 Correct 5 ms 592 KB Output is correct
44 Correct 6 ms 592 KB Output is correct
45 Correct 9 ms 720 KB Output is correct
46 Correct 7 ms 720 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 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 0 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 0 ms 336 KB Output is correct
68 Correct 1 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 1 ms 336 KB Output is correct
72 Correct 1 ms 336 KB Output is correct