Submission #759417

# Submission time Handle Problem Language Result Execution time Memory
759417 2023-06-16T09:24:51 Z ymm Meetings (JOI19_meetings) C++17
100 / 100
606 ms 852 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;
	for (int v : vec) {
		if (v == rt)
			continue;
		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);
			for (int j = i; j > 0; --j) {
				if (marg[j-1].vec.size() >= marg[j].vec.size())
					break;
				swap(marg[j-1].vec, 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 1 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 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 356 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 0 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 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 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 356 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 0 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 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 336 KB Output is correct
22 Correct 0 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 0 ms 336 KB Output is correct
26 Correct 0 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 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 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 356 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 0 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 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 336 KB Output is correct
22 Correct 0 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 0 ms 336 KB Output is correct
26 Correct 0 ms 336 KB Output is correct
27 Correct 5 ms 396 KB Output is correct
28 Correct 5 ms 404 KB Output is correct
29 Correct 5 ms 336 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 336 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 8 ms 336 KB Output is correct
34 Correct 10 ms 384 KB Output is correct
35 Correct 10 ms 388 KB Output is correct
36 Correct 6 ms 336 KB Output is correct
37 Correct 9 ms 336 KB Output is correct
38 Correct 6 ms 336 KB Output is correct
39 Correct 6 ms 400 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 352 ms 612 KB Output is correct
2 Correct 353 ms 516 KB Output is correct
3 Correct 373 ms 528 KB Output is correct
4 Correct 310 ms 584 KB Output is correct
5 Correct 395 ms 596 KB Output is correct
6 Correct 288 ms 540 KB Output is correct
7 Correct 498 ms 588 KB Output is correct
8 Correct 535 ms 532 KB Output is correct
9 Correct 504 ms 544 KB Output is correct
10 Correct 481 ms 664 KB Output is correct
11 Correct 574 ms 640 KB Output is correct
12 Correct 442 ms 820 KB Output is correct
13 Correct 293 ms 684 KB Output is correct
14 Correct 394 ms 732 KB Output is correct
15 Correct 352 ms 660 KB Output is correct
16 Correct 443 ms 752 KB Output is correct
17 Correct 503 ms 604 KB Output is correct
18 Correct 365 ms 672 KB Output is correct
19 Correct 360 ms 552 KB Output is correct
20 Correct 385 ms 568 KB Output is correct
21 Correct 396 ms 556 KB Output is correct
22 Correct 394 ms 852 KB Output is correct
23 Correct 385 ms 652 KB Output is correct
24 Correct 367 ms 668 KB Output is correct
25 Correct 374 ms 564 KB Output is correct
26 Correct 396 ms 704 KB Output is correct
27 Correct 370 ms 556 KB Output is correct
28 Correct 606 ms 660 KB Output is correct
29 Correct 418 ms 552 KB Output is correct
30 Correct 505 ms 724 KB Output is correct
31 Correct 533 ms 532 KB Output is correct
32 Correct 489 ms 768 KB Output is correct
33 Correct 388 ms 720 KB Output is correct
34 Correct 5 ms 336 KB Output is correct
35 Correct 4 ms 388 KB Output is correct
36 Correct 5 ms 336 KB Output is correct
37 Correct 5 ms 336 KB Output is correct
38 Correct 4 ms 336 KB Output is correct
39 Correct 5 ms 336 KB Output is correct
40 Correct 8 ms 336 KB Output is correct
41 Correct 13 ms 464 KB Output is correct
42 Correct 12 ms 336 KB Output is correct
43 Correct 7 ms 396 KB Output is correct
44 Correct 6 ms 336 KB Output is correct
45 Correct 7 ms 336 KB Output is correct
46 Correct 6 ms 348 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 0 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 0 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 1 ms 336 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 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 0 ms 336 KB Output is correct
69 Correct 1 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