oj.uz

Submission #150114

# Submission time Handle Problem Language Result Execution time Memory
150114 2019-09-01T07:45:02 Z お前はもう死んでいる(#3784, kuroni, nvmdava, tfg) Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 14 ms 896 KB 
#include "lokahia.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 205;

random_device rd;
mt19937_64 mt(rd());

int n, dsu[N], con[N][N];
vector<int> ve[N];

int rand(int l, int r)
{
	uniform_int_distribution<int> uni(l, r);
	return uni(mt);
}

int trace(int u)
{
	return dsu[u] < 0 ? u : dsu[u] = trace(dsu[u]);
}

void connect(int u, int v)
{
	if ((u = trace(u)) == (v = trace(v)))
		return;
	if (dsu[u] > dsu[v])
		swap(u, v);
	dsu[u] += dsu[v];
	dsu[v] = u;
	vector<int> tmp;
	for (int j = 1; j <= n; j++)
		if (con[u][j] == -1 || con[v][j] == -1)
			tmp.push_back(j);
	for (int &a : ve[u])
		for (int &b : ve[v])
			con[a][b] = con[b][a] = 1;
	for (int &b : ve[v])
		ve[u].push_back(b);
	ve[v].clear();
	for (int &a : ve[u])
		for (int &b : tmp)
			con[a][b] = con[b][a] = -1;
}

int FindBase(int _n)
{
	n = _n;
	for (int i = 0; i < n; i++)
	{
		dsu[i] = -1;
		ve[i] = {i};
		con[i][i] = 1;
	}
	for (int i = 1; i <= 600; i++)
	{
		int u, v, cnt = 0;
		do
		{
			u = rand(0, n - 1);
			v = rand(0, n - 1);
			cnt++;
		} while (con[u][v] != 0 && cnt <= 10);
		if (cnt > 10)
			break;
		u = trace(u); v = trace(v);
		int rt = CollectRelics(u, v);
		if (rt == -1)
		{
			for (int &a : ve[u])
				for (int &b : ve[v])
					con[a][b] = con[b][a] = -1;
		}
		else
		{
			connect(rt, u);
			connect(rt, v);
		}
	}
	for (int i = 0; i < n; i++)
		if (-dsu[i] >= n / 2)
			return i;
	return -1;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 896 KB Correct : C = 222
2 Correct 6 ms 768 KB Correct : C = 140
3 Incorrect 7 ms 640 KB Wrong
4 Correct 7 ms 768 KB Correct : C = 118
5 Incorrect 9 ms 768 KB Wrong
6 Partially correct 7 ms 768 KB Partially correct : C = 600
7 Partially correct 6 ms 640 KB Partially correct : C = 600
8 Incorrect 7 ms 640 KB Wrong
9 Correct 9 ms 768 KB Correct : C = 280
10 Correct 9 ms 768 KB Correct : C = 217
11 Correct 10 ms 856 KB Correct : C = 284
12 Partially correct 7 ms 768 KB Partially correct : C = 600
13 Correct 8 ms 640 KB Correct : C = 190
14 Incorrect 7 ms 640 KB Wrong
15 Partially correct 6 ms 640 KB Partially correct : C = 600
16 Partially correct 10 ms 768 KB Partially correct : C = 498
17 Correct 6 ms 512 KB Correct : C = 3
18 Incorrect 11 ms 856 KB Wrong
19 Incorrect 11 ms 768 KB Wrong
20 Correct 5 ms 512 KB Correct : C = 0
21 Partially correct 8 ms 768 KB Partially correct : C = 491
22 Incorrect 11 ms 768 KB Wrong
23 Incorrect 7 ms 640 KB Wrong
24 Incorrect 8 ms 640 KB Wrong
25 Correct 6 ms 640 KB Correct : C = 82
26 Correct 6 ms 640 KB Correct : C = 80
27 Partially correct 11 ms 768 KB Partially correct : C = 367