Submission #759411

# Submission time Handle Problem Language Result Execution time Memory
759411 2023-06-16T09:20:21 Z ymm Meetings (JOI19_meetings) C++17
100 / 100
606 ms 1148 KB
#include "meetings.h"

#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

int query(int i, int j, int k) {
	if (i == j || i == k)
		return i;
	if (j == k)
		return j;
	return Query(i, j, k);
}

mt19937_64 rd(time(0));

void solve(vector<int> vec)
{
	shuffle(vec.begin(), vec.end(), rd);
	int rt = query(vec[rd()%vec.size()], vec[rd()%vec.size()], vec[rd()%vec.size()]);
	struct dard { vector<int> vec; int rt; };
	vector<dard> marg;
	set<int> done = {rt};
	for (int v : vec) {
		if (done.count(v))
			continue;
		done.insert(v);
		bool found = 0;
		Loop (i,0,marg.size()) {
			int x = query(rt, marg[i].rt, v);
			if (x == rt)
				continue;
			marg[i].rt = x;
			marg[i].vec.push_back(v);
			if (done.insert(x).second)
				marg[i].vec.push_back(x);
			for (int j = i; j > 0; --j) {
				if (marg[j-1].vec.size() >= marg[j].vec.size())
					break;
				marg[j-1].vec.swap(marg[j].vec);
				swap(marg[j-1].rt, marg[j].rt);
			}
			found = 1;
			break;
		}
		if (!found)
			marg.push_back({{v}, v});
	}
	Loop (i,0,marg.size())
		Bridge(min(rt, marg[i].rt), max(rt, marg[i].rt));
	Loop (i,0,marg.size())
		solve(marg[i].vec);
}


void Solve(int N) {
	vector<int> a(N);
	iota(a.begin(), a.end(), 0);
	solve(a);
}
# 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 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 1 ms 252 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 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 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 1 ms 252 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 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 1 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 348 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 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 1 ms 252 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 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 1 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 348 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 5 ms 336 KB Output is correct
28 Correct 4 ms 336 KB Output is correct
29 Correct 5 ms 336 KB Output is correct
30 Correct 5 ms 336 KB Output is correct
31 Correct 5 ms 336 KB Output is correct
32 Correct 6 ms 424 KB Output is correct
33 Correct 8 ms 336 KB Output is correct
34 Correct 10 ms 336 KB Output is correct
35 Correct 10 ms 392 KB Output is correct
36 Correct 5 ms 336 KB Output is correct
37 Correct 7 ms 376 KB Output is correct
38 Correct 7 ms 336 KB Output is correct
39 Correct 7 ms 456 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 291 ms 796 KB Output is correct
2 Correct 321 ms 684 KB Output is correct
3 Correct 342 ms 744 KB Output is correct
4 Correct 323 ms 900 KB Output is correct
5 Correct 337 ms 872 KB Output is correct
6 Correct 290 ms 676 KB Output is correct
7 Correct 453 ms 796 KB Output is correct
8 Correct 520 ms 660 KB Output is correct
9 Correct 498 ms 752 KB Output is correct
10 Correct 469 ms 704 KB Output is correct
11 Correct 595 ms 736 KB Output is correct
12 Correct 415 ms 1048 KB Output is correct
13 Correct 322 ms 1016 KB Output is correct
14 Correct 412 ms 904 KB Output is correct
15 Correct 366 ms 1040 KB Output is correct
16 Correct 389 ms 924 KB Output is correct
17 Correct 510 ms 812 KB Output is correct
18 Correct 356 ms 744 KB Output is correct
19 Correct 363 ms 836 KB Output is correct
20 Correct 385 ms 716 KB Output is correct
21 Correct 400 ms 828 KB Output is correct
22 Correct 381 ms 880 KB Output is correct
23 Correct 388 ms 944 KB Output is correct
24 Correct 369 ms 848 KB Output is correct
25 Correct 377 ms 716 KB Output is correct
26 Correct 348 ms 724 KB Output is correct
27 Correct 364 ms 872 KB Output is correct
28 Correct 606 ms 852 KB Output is correct
29 Correct 453 ms 672 KB Output is correct
30 Correct 487 ms 840 KB Output is correct
31 Correct 530 ms 788 KB Output is correct
32 Correct 502 ms 1148 KB Output is correct
33 Correct 394 ms 932 KB Output is correct
34 Correct 5 ms 336 KB Output is correct
35 Correct 4 ms 336 KB Output is correct
36 Correct 5 ms 336 KB Output is correct
37 Correct 5 ms 336 KB Output is correct
38 Correct 5 ms 336 KB Output is correct
39 Correct 5 ms 336 KB Output is correct
40 Correct 9 ms 336 KB Output is correct
41 Correct 10 ms 412 KB Output is correct
42 Correct 10 ms 384 KB Output is correct
43 Correct 5 ms 336 KB Output is correct
44 Correct 7 ms 444 KB Output is correct
45 Correct 7 ms 464 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 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 0 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 292 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 344 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 304 KB Output is correct
66 Correct 1 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 0 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct