oj.uz

Submission #532007

# Submission time Handle Problem Language Result Execution time Memory
532007 2022-03-02T03:25:54 Z fhvirus Meetings (JOI19_meetings) C++17
100 / 100
 1085 ms 16464 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll; typedef pair<int, int> pii;
#define pb emplace_back
#define AI(x) begin(x),end(x)
#define ff first
#define ss second
#ifdef OWO
#define debug(args...) LKJ("\033[1;32m[ " + string(#args) + " ]\033[0m", args)
template <class I> void LKJ(I&&x) { cerr << x << endl; }
template <class I, class...T> void LKJ(I&&x, T&&...t) { cerr << x << ", "; LKJ(t...); }
template <class I> void OI(I a, I b) { while (a != b) cerr << *a << " \n"[(a = next(a)) == b]; }
#else
#define debug(...) 0
#define OI(...) 0
#endif

namespace {

random_device rd;
mt19937 mt(rd());

const int kN = 2002;
int N, root, mem[kN][kN];

int queryLCA(int u, int v) {
	assert(u != v);
	if (mem[u][v] != -1) return mem[u][v];
	return (mem[u][v] = Query(root, u, v));
}
void addEdge(int u, int v) {
	if (u > v) swap(u, v);
	debug("Add edge", u, v);
	Bridge(u, v);
}

bool cmp(int u, int v) {
	return queryLCA(u, v) == u;
}

void init(int N) {
	::N = N;
	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j)
			mem[i][j] = -1;
}

void solve(int rt, vector<int> ids) {
	debug(rt);
	OI(AI(ids));
	if (ids.empty()) return;
	if (ids.size() == 1) {
		addEdge(rt, ids[0]);
		return;
	}

	int u = ids.back(); ids.pop_back();
	map<int, vector<int>> mp;
	vector<int> ps;
	for (const int& v: ids) {
		int lca = queryLCA(u, v);
		if (lca == v and lca != u) ps.pb(lca);
		else mp[lca].pb(v);
	}

	debug(u);
	for (auto &[nrt, nids]: mp) {
		debug(nrt);
		OI(AI(nids));
	}

	if (ps.empty()) {
		addEdge(rt, u);
	} else {
		sort(AI(ps));
		ps.erase(unique(AI(ps)), end(ps));
		sort(AI(ps), cmp);
		debug("ps");
		OI(AI(ps));

		addEdge(rt, ps[0]);
		addEdge(ps.back(), u);
		for (int i = 1; i < ps.size(); ++i)
			addEdge(ps[i - 1], ps[i]);
	}

	for (auto &[nrt, nids]: mp) {
		shuffle(AI(nids), mt);
		solve(nrt, nids);
	}
}

} // namespace

void Solve(int N) {
	init(N);

	vector<int> ids(N);
	iota(AI(ids), 0);
	shuffle(AI(ids), mt);

	root = ids.back();
	ids.pop_back();

	debug(root);
	OI(AI(ids));
	solve(root, ids);

	/*
  for (int u = 0; u < N - 1; ++u)
    Bridge(u, u + 1);
	*/
}

Compilation message

meetings.cpp: In function 'void {anonymous}::addEdge(int, int)':
meetings.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
meetings.cpp:34:2: note: in expansion of macro 'debug'
   34 |  debug("Add edge", u, v);
      |  ^~~~~
meetings.cpp: In function 'void {anonymous}::solve(int, std::vector<int>)':
meetings.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
meetings.cpp:50:2: note: in expansion of macro 'debug'
   50 |  debug(rt);
      |  ^~~~~
meetings.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define OI(...) 0
      |                 ^
meetings.cpp:51:2: note: in expansion of macro 'OI'
   51 |  OI(AI(ids));
      |  ^~
meetings.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
meetings.cpp:67:2: note: in expansion of macro 'debug'
   67 |  debug(u);
      |  ^~~~~
meetings.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
meetings.cpp:69:3: note: in expansion of macro 'debug'
   69 |   debug(nrt);
      |   ^~~~~
meetings.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define OI(...) 0
      |                 ^
meetings.cpp:70:3: note: in expansion of macro 'OI'
   70 |   OI(AI(nids));
      |   ^~
meetings.cpp:68:13: warning: unused structured binding declaration [-Wunused-variable]
   68 |  for (auto &[nrt, nids]: mp) {
      |             ^~~~~~~~~~~
meetings.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
meetings.cpp:79:3: note: in expansion of macro 'debug'
   79 |   debug("ps");
      |   ^~~~~
meetings.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define OI(...) 0
      |                 ^
meetings.cpp:80:3: note: in expansion of macro 'OI'
   80 |   OI(AI(ps));
      |   ^~
meetings.cpp:84:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   for (int i = 1; i < ps.size(); ++i)
      |                   ~~^~~~~~~~~~~
meetings.cpp: In function 'void Solve(int)':
meetings.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
meetings.cpp:106:2: note: in expansion of macro 'debug'
  106 |  debug(root);
      |  ^~~~~
meetings.cpp:16:17: warning: statement has no effect [-Wunused-value]
   16 | #define OI(...) 0
      |                 ^
meetings.cpp:107:2: note: in expansion of macro 'OI'
  107 |  OI(AI(ids));
      |  ^~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 16312 KB Output is correct
2 Correct 415 ms 16304 KB Output is correct
3 Correct 445 ms 16264 KB Output is correct
4 Correct 414 ms 16292 KB Output is correct
5 Correct 318 ms 16260 KB Output is correct
6 Correct 306 ms 16308 KB Output is correct
7 Correct 633 ms 16316 KB Output is correct
8 Correct 661 ms 16324 KB Output is correct
9 Correct 670 ms 16372 KB Output is correct
10 Correct 625 ms 16348 KB Output is correct
11 Correct 623 ms 16340 KB Output is correct
12 Correct 397 ms 16348 KB Output is correct
13 Correct 203 ms 16340 KB Output is correct
14 Correct 473 ms 16448 KB Output is correct
15 Correct 397 ms 16320 KB Output is correct
16 Correct 449 ms 16304 KB Output is correct
17 Correct 645 ms 16440 KB Output is correct
18 Correct 453 ms 16340 KB Output is correct
19 Correct 367 ms 16216 KB Output is correct
20 Correct 597 ms 16320 KB Output is correct
21 Correct 510 ms 16276 KB Output is correct
22 Correct 548 ms 16408 KB Output is correct
23 Correct 497 ms 16312 KB Output is correct
24 Correct 427 ms 16360 KB Output is correct
25 Correct 455 ms 16440 KB Output is correct
26 Correct 452 ms 16220 KB Output is correct
27 Correct 431 ms 16420 KB Output is correct
28 Correct 647 ms 16328 KB Output is correct
29 Correct 766 ms 16392 KB Output is correct
30 Correct 652 ms 16464 KB Output is correct
31 Correct 654 ms 16396 KB Output is correct
32 Correct 1085 ms 16376 KB Output is correct
33 Correct 779 ms 16452 KB Output is correct
34 Correct 8 ms 1864 KB Output is correct
35 Correct 4 ms 1864 KB Output is correct
36 Correct 5 ms 1920 KB Output is correct
37 Correct 6 ms 1864 KB Output is correct
38 Correct 4 ms 1880 KB Output is correct
39 Correct 6 ms 1864 KB Output is correct
40 Correct 11 ms 1884 KB Output is correct
41 Correct 12 ms 1864 KB Output is correct
42 Correct 15 ms 1864 KB Output is correct
43 Correct 8 ms 1944 KB Output is correct
44 Correct 11 ms 1940 KB Output is correct
45 Correct 17 ms 1960 KB Output is correct
46 Correct 9 ms 1956 KB Output is correct
47 Correct 1 ms 456 KB Output is correct
48 Correct 1 ms 476 KB Output is correct
49 Correct 1 ms 456 KB Output is correct
50 Correct 1 ms 456 KB Output is correct
51 Correct 1 ms 456 KB Output is correct
52 Correct 1 ms 456 KB Output is correct
53 Correct 1 ms 456 KB Output is correct
54 Correct 1 ms 456 KB Output is correct
55 Correct 1 ms 456 KB Output is correct
56 Correct 1 ms 456 KB Output is correct
57 Correct 1 ms 456 KB Output is correct
58 Correct 1 ms 456 KB Output is correct
59 Correct 1 ms 456 KB Output is correct
60 Correct 0 ms 328 KB Output is correct
61 Correct 1 ms 328 KB Output is correct
62 Correct 0 ms 328 KB Output is correct
63 Correct 1 ms 328 KB Output is correct
64 Correct 1 ms 328 KB Output is correct
65 Correct 1 ms 328 KB Output is correct
66 Correct 0 ms 328 KB Output is correct
67 Correct 0 ms 328 KB Output is correct
68 Correct 0 ms 328 KB Output is correct
69 Correct 1 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 1 ms 328 KB Output is correct
72 Correct 0 ms 328 KB Output is correct