oj.uz

Submission #375066

# Submission time Handle Problem Language Result Execution time Memory
375066 2021-03-09T02:03:21 Z Kevin_Zhang_TW Meetings (JOI19_meetings) C++17
100 / 100
 911 ms 1260 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif 
const int MAX_N = 300010;
// function : Query(a, b, c)
// function : Bridge(a, b)
random_device rd;
//mt19937 gen(rd());
mt19937 gen;

#define qry Query

vector<pair<int,int>> res;

void solve(vector<int> ids) {
	if (ids.size() <= 1) return;
	if (ids.size() == 2) {
		res.pb(ids[0], ids[1]);
		return;
	}

	shuffle(AI(ids), gen);
	int a = ids[0], b = ids[1];

	map<int, vector<int>> subtree;

	vector<int> sorted;

	for (int i = 2;i < ids.size();++i) {
		int x = ids[i], anc = qry(a, b, x);
		subtree[anc].pb(x);
		if (anc != a && anc != b)
			sorted.pb(anc);
	}
	subtree[a].pb(a), subtree[b].pb(b);

	for (auto [_, sid] : subtree)
		solve(sid);

	sort(AI(sorted));
	sorted.erase(unique(AI(sorted)), end(sorted));

	int root = a;

	set<pair<int,int>> vis;
	auto cmp = [&](int a, int b) {
		if (vis.count({a, b})) return true;
		if (vis.count({b, a})) return false;
		int mid = qry(root, a, b);
		vis.insert({mid, a + b - mid});
		return mid == a;
	};

	stable_sort(AI(sorted), cmp);

	int lst = root;

	for (int u : sorted) {
		res.pb(lst, u), lst = u;
	}

	res.pb(lst, b);
}
void Solve(int N) {
	static int cnt;
	assert(++cnt == 1);
	vector<int> ids(N); iota(AI(ids), 0);

	solve(ids);

	assert(res.size() == N-1);
	for (auto &[a, b] : res) {
		if (a > b) swap(a, b);
		DE(a, b);
		Bridge(a, b);
	}
}

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:43:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |  for (int i = 2;i < ids.size();++i) {
      |                 ~~^~~~~~~~~~~~
In file included from /usr/include/c++/9/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:33,
                 from meetings.cpp:2:
meetings.cpp: In function 'void Solve(int)':
meetings.cpp:85:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   85 |  assert(res.size() == N-1);
      |         ~~~~~~~~~~~^~~~~~
meetings.cpp:15:17: warning: statement has no effect [-Wunused-value]
   15 | #define DE(...) 0
      |                 ^
meetings.cpp:88:3: note: in expansion of macro 'DE'
   88 |   DE(a, b);
      |   ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 7 ms 640 KB Output is correct
28 Correct 8 ms 492 KB Output is correct
29 Correct 7 ms 492 KB Output is correct
30 Correct 6 ms 492 KB Output is correct
31 Correct 5 ms 492 KB Output is correct
32 Correct 6 ms 492 KB Output is correct
33 Correct 9 ms 492 KB Output is correct
34 Correct 10 ms 492 KB Output is correct
35 Correct 10 ms 492 KB Output is correct
36 Correct 8 ms 492 KB Output is correct
37 Correct 10 ms 492 KB Output is correct
38 Correct 8 ms 492 KB Output is correct
39 Correct 7 ms 492 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 748 KB Output is correct
2 Correct 441 ms 652 KB Output is correct
3 Correct 414 ms 748 KB Output is correct
4 Correct 451 ms 748 KB Output is correct
5 Correct 338 ms 748 KB Output is correct
6 Correct 329 ms 772 KB Output is correct
7 Correct 484 ms 748 KB Output is correct
8 Correct 556 ms 748 KB Output is correct
9 Correct 566 ms 748 KB Output is correct
10 Correct 484 ms 748 KB Output is correct
11 Correct 559 ms 748 KB Output is correct
12 Correct 297 ms 876 KB Output is correct
13 Correct 252 ms 748 KB Output is correct
14 Correct 356 ms 768 KB Output is correct
15 Correct 395 ms 748 KB Output is correct
16 Correct 393 ms 748 KB Output is correct
17 Correct 528 ms 724 KB Output is correct
18 Correct 321 ms 828 KB Output is correct
19 Correct 352 ms 748 KB Output is correct
20 Correct 373 ms 748 KB Output is correct
21 Correct 440 ms 748 KB Output is correct
22 Correct 519 ms 916 KB Output is correct
23 Correct 358 ms 748 KB Output is correct
24 Correct 414 ms 748 KB Output is correct
25 Correct 390 ms 748 KB Output is correct
26 Correct 423 ms 748 KB Output is correct
27 Correct 359 ms 748 KB Output is correct
28 Correct 584 ms 876 KB Output is correct
29 Correct 590 ms 748 KB Output is correct
30 Correct 518 ms 876 KB Output is correct
31 Correct 590 ms 876 KB Output is correct
32 Correct 911 ms 1260 KB Output is correct
33 Correct 349 ms 1004 KB Output is correct
34 Correct 6 ms 492 KB Output is correct
35 Correct 7 ms 492 KB Output is correct
36 Correct 7 ms 492 KB Output is correct
37 Correct 6 ms 492 KB Output is correct
38 Correct 5 ms 492 KB Output is correct
39 Correct 6 ms 492 KB Output is correct
40 Correct 9 ms 492 KB Output is correct
41 Correct 10 ms 492 KB Output is correct
42 Correct 10 ms 492 KB Output is correct
43 Correct 6 ms 492 KB Output is correct
44 Correct 11 ms 492 KB Output is correct
45 Correct 8 ms 492 KB Output is correct
46 Correct 8 ms 492 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 0 ms 364 KB Output is correct
61 Correct 0 ms 364 KB Output is correct
62 Correct 0 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 0 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 492 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 384 KB Output is correct