oj.uz

Submission #536091

# Submission time Handle Problem Language Result Execution time Memory
536091 2022-03-12T10:44:39 Z blue Meetings (JOI19_meetings) C++17
100 / 100
 929 ms 1180 KB 
#include "meetings.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <random>
using namespace std;

using vi = vector<int>;
#define sz(x) int(x.size())

const int mx = 2'000;
int N;

set<int> edge[mx];

void cut(int u, int v)
{
	edge[u].erase(v);
	edge[v].erase(u);
}

void join(int u, int v)
{
	edge[u].insert(v);
	edge[v].insert(u);
}


vi subtree;
vi depth;
int goodct;

void dfs(int u, int p, vi& good)
{
	goodct++;
	for(int v : edge[u])
	{
		if(v == p) continue;
		if(!good[v]) continue;

		depth[v] = depth[u] + 1;
		dfs(v, u, good);
		subtree[u] += subtree[v];
	}
}

vi childlist;

vi added(mx, 0);



void computelist(int u, int p, vi& newgood, vi& oldgood)
{
	newgood[u] = 1;
	for(int v : edge[u])
	{
		if(v == p) continue;
		if(!oldgood[v]) continue;

		computelist(v, u, newgood, oldgood);
	}
}



void Locate(vi good, int X)
{
	// cerr << "Locate " << X << "  ";
	// for(int f = 0; f < N; f++) cerr << good[f] << ' ';
	// 	cerr << "\n";
	subtree = vi(N, 1);
	depth = vi(N, 1);
	int rt = 0;
	while(!good[rt]) rt++;

	goodct = 0;

	dfs(rt, rt, good);

	int cent = -1;
	for(int i = 0; i < N; i++)
	{
		if(!good[i]) continue;

		if(2*subtree[i] < goodct) continue;

		if(cent == -1) cent = i;
		else if(depth[i] > depth[cent]) cent = i;
	}

	childlist.clear();

	for(int x : edge[cent])
		if(good[x])
			childlist.push_back(x);

	sort(childlist.begin(), childlist.end(), [] (int p, int q)
	{
		return subtree[p] > subtree[q];
	});

	int desc = -1;


	for(int h = 0; h+1 < sz(childlist); h++)
	{
		int A = childlist[h], B = childlist[h+1];

		int Q = Query(A, B, X);

		if(Q == A)
		{
			desc = A;
			break;
		}
		else if(Q == B)
		{
			desc = B;
			break;
		}
		else if(Q == cent)
		{
			continue;
		}
		else if(Q == X)
		{
			int Q2 = Query(cent, X, A);
			if(Q2 == X)
			{
				cut(cent, A);
				join(cent, X);
				join(A, X);

				added[X] = 1;

				return;
			}
			else
			{
				cut(cent, B);
				join(cent, X);
				join(B, X);

				added[X] = 1;

				return;
			}
		}
		else
		{
			int Q2 = Query(cent, Q, A);
			if(Q2 == Q)
			{
				cut(cent, A);
				join(cent, Q);
				join(Q, A);
				join(Q, X);

				added[Q] = added[X] = 1;
			}
			else
			{
				cut(cent, B);
				join(cent, Q);
				join(Q, B);
				join(Q, X);

				added[Q] = added[X] = 1;
			}

			return;
		}
	}

	if(desc == -1)
	{
		if(sz(childlist) % 2 == 1)
		{
			int z = childlist.back();

			int Q = Query(cent, z, X);

			if(Q == cent)
			{
				join(cent, X);

				added[X] = 1;

				return;
			}
			else if(Q == z)
			{
				desc = z;
			}
			else if(Q == X)
			{
				cut(cent, z);
				join(cent, X);
				join(X, z);

				added[X] = 1;

				return;
			}
			else
			{
				cut(cent, z);
				join(cent, Q);
				join(Q, X);
				join(Q, z);

				added[X] = added[Q] = 1;

				return;
			}
		}
		else
		{
			join(cent, X);

			added[X] = 1;

			return;
		}
	}

	vi goodlist(N, 0);
	computelist(desc, cent, goodlist, good);


	// cerr << "desc = " << desc << '\n';

	Locate(goodlist, X);
}

void Solve(int N_) 
{
	N = N_;

	edge[0].insert(1);
	edge[1].insert(0);

	added[0] = added[1] = 1;

	vi addlist;
	for(int X = 2; X <= N-1; X++)
		addlist.push_back(X);

	for(int k = 0; k < 1'000'000; k++)
	{
		int u = rand() % sz(addlist);
		int v = rand() % sz(addlist);
		swap(addlist[u], addlist[v]);
	}

	for(int X : addlist)
	{
		if(added[X]) continue;
		// cerr << "original new\n";
		Locate(added, X);
	}

	for(int u = 0; u < N; u++)
		for(int v : edge[u])
			if(u < v)
				Bridge(u, v);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 336 KB Output is correct
2 Correct 28 ms 336 KB Output is correct
3 Correct 28 ms 336 KB Output is correct
4 Correct 28 ms 336 KB Output is correct
5 Correct 28 ms 336 KB Output is correct
6 Correct 27 ms 440 KB Output is correct
7 Correct 30 ms 444 KB Output is correct
8 Correct 28 ms 336 KB Output is correct
9 Correct 27 ms 440 KB Output is correct
10 Correct 28 ms 336 KB Output is correct
11 Correct 28 ms 440 KB Output is correct
12 Correct 28 ms 336 KB Output is correct
13 Correct 28 ms 424 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 336 KB Output is correct
2 Correct 28 ms 336 KB Output is correct
3 Correct 28 ms 336 KB Output is correct
4 Correct 28 ms 336 KB Output is correct
5 Correct 28 ms 336 KB Output is correct
6 Correct 27 ms 440 KB Output is correct
7 Correct 30 ms 444 KB Output is correct
8 Correct 28 ms 336 KB Output is correct
9 Correct 27 ms 440 KB Output is correct
10 Correct 28 ms 336 KB Output is correct
11 Correct 28 ms 440 KB Output is correct
12 Correct 28 ms 336 KB Output is correct
13 Correct 28 ms 424 KB Output is correct
14 Correct 27 ms 336 KB Output is correct
15 Correct 26 ms 464 KB Output is correct
16 Correct 28 ms 448 KB Output is correct
17 Correct 27 ms 464 KB Output is correct
18 Correct 28 ms 440 KB Output is correct
19 Correct 26 ms 436 KB Output is correct
20 Correct 30 ms 444 KB Output is correct
21 Correct 28 ms 440 KB Output is correct
22 Correct 28 ms 336 KB Output is correct
23 Correct 28 ms 336 KB Output is correct
24 Correct 28 ms 440 KB Output is correct
25 Correct 26 ms 444 KB Output is correct
26 Correct 28 ms 436 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 336 KB Output is correct
2 Correct 28 ms 336 KB Output is correct
3 Correct 28 ms 336 KB Output is correct
4 Correct 28 ms 336 KB Output is correct
5 Correct 28 ms 336 KB Output is correct
6 Correct 27 ms 440 KB Output is correct
7 Correct 30 ms 444 KB Output is correct
8 Correct 28 ms 336 KB Output is correct
9 Correct 27 ms 440 KB Output is correct
10 Correct 28 ms 336 KB Output is correct
11 Correct 28 ms 440 KB Output is correct
12 Correct 28 ms 336 KB Output is correct
13 Correct 28 ms 424 KB Output is correct
14 Correct 27 ms 336 KB Output is correct
15 Correct 26 ms 464 KB Output is correct
16 Correct 28 ms 448 KB Output is correct
17 Correct 27 ms 464 KB Output is correct
18 Correct 28 ms 440 KB Output is correct
19 Correct 26 ms 436 KB Output is correct
20 Correct 30 ms 444 KB Output is correct
21 Correct 28 ms 440 KB Output is correct
22 Correct 28 ms 336 KB Output is correct
23 Correct 28 ms 336 KB Output is correct
24 Correct 28 ms 440 KB Output is correct
25 Correct 26 ms 444 KB Output is correct
26 Correct 28 ms 436 KB Output is correct
27 Correct 32 ms 468 KB Output is correct
28 Correct 33 ms 464 KB Output is correct
29 Correct 32 ms 464 KB Output is correct
30 Correct 32 ms 476 KB Output is correct
31 Correct 31 ms 464 KB Output is correct
32 Correct 34 ms 476 KB Output is correct
33 Correct 38 ms 464 KB Output is correct
34 Correct 42 ms 464 KB Output is correct
35 Correct 43 ms 504 KB Output is correct
36 Correct 38 ms 496 KB Output is correct
37 Correct 38 ms 464 KB Output is correct
38 Correct 38 ms 480 KB Output is correct
39 Correct 37 ms 512 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 618 ms 996 KB Output is correct
2 Correct 595 ms 904 KB Output is correct
3 Correct 607 ms 924 KB Output is correct
4 Correct 569 ms 916 KB Output is correct
5 Correct 465 ms 1008 KB Output is correct
6 Correct 453 ms 980 KB Output is correct
7 Correct 682 ms 900 KB Output is correct
8 Correct 728 ms 860 KB Output is correct
9 Correct 739 ms 900 KB Output is correct
10 Correct 666 ms 968 KB Output is correct
11 Correct 929 ms 1068 KB Output is correct
12 Correct 633 ms 1104 KB Output is correct
13 Correct 579 ms 1000 KB Output is correct
14 Correct 684 ms 1148 KB Output is correct
15 Correct 681 ms 1092 KB Output is correct
16 Correct 725 ms 1024 KB Output is correct
17 Correct 699 ms 960 KB Output is correct
18 Correct 630 ms 880 KB Output is correct
19 Correct 636 ms 864 KB Output is correct
20 Correct 822 ms 1072 KB Output is correct
21 Correct 854 ms 1160 KB Output is correct
22 Correct 875 ms 932 KB Output is correct
23 Correct 898 ms 944 KB Output is correct
24 Correct 800 ms 1004 KB Output is correct
25 Correct 810 ms 916 KB Output is correct
26 Correct 771 ms 932 KB Output is correct
27 Correct 802 ms 1168 KB Output is correct
28 Correct 840 ms 968 KB Output is correct
29 Correct 666 ms 852 KB Output is correct
30 Correct 678 ms 824 KB Output is correct
31 Correct 766 ms 912 KB Output is correct
32 Correct 918 ms 972 KB Output is correct
33 Correct 719 ms 1180 KB Output is correct
34 Correct 36 ms 464 KB Output is correct
35 Correct 32 ms 464 KB Output is correct
36 Correct 34 ms 464 KB Output is correct
37 Correct 32 ms 464 KB Output is correct
38 Correct 34 ms 464 KB Output is correct
39 Correct 37 ms 468 KB Output is correct
40 Correct 42 ms 464 KB Output is correct
41 Correct 44 ms 464 KB Output is correct
42 Correct 39 ms 468 KB Output is correct
43 Correct 33 ms 464 KB Output is correct
44 Correct 37 ms 464 KB Output is correct
45 Correct 36 ms 524 KB Output is correct
46 Correct 36 ms 468 KB Output is correct
47 Correct 27 ms 440 KB Output is correct
48 Correct 26 ms 448 KB Output is correct
49 Correct 30 ms 424 KB Output is correct
50 Correct 31 ms 336 KB Output is correct
51 Correct 30 ms 440 KB Output is correct
52 Correct 30 ms 448 KB Output is correct
53 Correct 27 ms 444 KB Output is correct
54 Correct 27 ms 448 KB Output is correct
55 Correct 26 ms 448 KB Output is correct
56 Correct 26 ms 440 KB Output is correct
57 Correct 28 ms 464 KB Output is correct
58 Correct 30 ms 448 KB Output is correct
59 Correct 31 ms 428 KB Output is correct
60 Correct 33 ms 336 KB Output is correct
61 Correct 30 ms 336 KB Output is correct
62 Correct 29 ms 336 KB Output is correct
63 Correct 30 ms 336 KB Output is correct
64 Correct 28 ms 448 KB Output is correct
65 Correct 29 ms 420 KB Output is correct
66 Correct 29 ms 336 KB Output is correct
67 Correct 31 ms 336 KB Output is correct
68 Correct 31 ms 440 KB Output is correct
69 Correct 28 ms 336 KB Output is correct
70 Correct 28 ms 336 KB Output is correct
71 Correct 28 ms 336 KB Output is correct
72 Correct 28 ms 336 KB Output is correct