oj.uz

Submission #65199

# Submission time Handle Problem Language Result Execution time Memory
65199 2018-08-07T03:37:18 Z MatheusLealV Simurgh (IOI17_simurgh) C++17
51 / 100
 292 ms 15612 KB 
#include "simurgh.h"
#define N 225000
#define f first
#define ss second
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;

int n, m, peso[N],ok[N], st[N], nivel[N], ans[N], valor;

int ponte[N];

pii E[N], pai[N];

vector<pii> grafo[N], tree[N];

vector<int> save;

void dfs(int x)
{
	ok[x] = 1;

	random_shuffle(grafo[x].begin(), grafo[x].end());

	for(auto v: grafo[x])
	{
		if(ok[v.f]) continue;

		tree[x].push_back({v.f, v.ss});

		tree[v.f].push_back({x, v.ss});

		pai[v.f] = {x, v.ss};

		nivel[v.f] = nivel[x] + 1;

		save.push_back(v.ss);

		st[v.ss] = 1;

		dfs(v.f);
	}
}

int checa1(int antiga, int nova)
{	
	vector<int> aux;

	for(auto x: save)
	{
		if(x == antiga) continue;

		aux.push_back(x);
	}

	aux.push_back(nova);

	int val = count_common_roads(aux);

	if(val > valor) return 1;

	if(val < valor) return -1;

	return ans[antiga];
}

int checa2(int antiga, int nova)
{
	vector<int> aux;

	for(auto x: save)
	{
		if(x == antiga) continue;

		aux.push_back(x);
	}

	aux.push_back(nova);

	int val = count_common_roads(aux);

	if(val > valor) return 1;

	if(val < valor) return -1;

	return 0;
}

void solve(int x)
{
	int u = E[x].f, v = E[x].ss, pronto = -1;

	vector<int> path;

	while(u != v)
	{
		if(nivel[u] > nivel[v])
		{
			int up = pai[u].f, ed = pai[u].ss;

			path.push_back(ed);

			if(ans[ed] != 0 and ed != x)
			{
				pronto = ed;
			}

			u = up;
		}

		else
		{
			int up = pai[v].f, ed = pai[v].ss;

			path.push_back(ed);

			if(ans[ed] != 0 and ed != x)
			{
				pronto = ed;
			}

			v = up;			
		}
	}

	if(pronto == -1 and ans[x] == 0)
	{
		vector<int> iguais;

		for(auto y: path)
		{
			if(ans[x] != 0 and ans[y] != 0) continue;

			if(x == y) continue;

			int val = checa2(y, x);

			if(val == 1)
			{
				ans[x] = 1;

				ans[y] = -1;
			}

			else if(val == -1)
			{
				ans[x] = -1;

				ans[y] = 1;
			}

			else iguais.push_back(y);
		}

		if(ans[x] == 0)
		{
			ans[x] = -1;

			for(auto y: path) ans[y] = -1;
		}

		for(auto y: iguais) ans[y] = ans[x];
	}

	if(ans[x] == 0 and pronto != -1) ans[x] = checa1(pronto,x);

	for(auto y: path)
	{
		if(ans[y] != 0 or x== y) continue;

		int val = checa1(y, x);

		if(val > 0) ans[y] = -1;

		else if(val < 0) ans[y] = 1;

		else ans[y] = ans[x];
	}
}

vector<int> find_roads(int ni, vector<int> u, vector<int> v)
{
	n = ni, m = (int)u.size();

	for(int i = 0; i < m; i++)
	{
		E[i] = {u[i], v[i]};

		grafo[u[i]].push_back({v[i], i});

		grafo[v[i]].push_back({u[i], i});
	}

	pai[0] = {0, 0};

	dfs(0);

	valor = count_common_roads(save);

	if(valor == n - 1) return save;

	for(int i = 0; i < m; i++)
	{
		if(st[i]) continue;

		solve(i);
	}

	vector<int> resp;

	for(int i = 0; i < m; i++)
	{
		if(ans[i] >= 0) resp.push_back(i);
	}

	resp.resize(n - 1);

	sort(resp.begin(), resp.end());

	return resp;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10872 KB correct
2 Correct 14 ms 10980 KB correct
3 Correct 16 ms 11184 KB correct
4 Correct 13 ms 11184 KB correct
5 Correct 14 ms 11184 KB correct
6 Correct 13 ms 11184 KB correct
7 Correct 14 ms 11184 KB correct
8 Correct 12 ms 11184 KB correct
9 Correct 13 ms 11184 KB correct
10 Correct 12 ms 11184 KB correct
11 Correct 12 ms 11184 KB correct
12 Correct 14 ms 11184 KB correct
13 Correct 15 ms 11212 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10872 KB correct
2 Correct 14 ms 10980 KB correct
3 Correct 16 ms 11184 KB correct
4 Correct 13 ms 11184 KB correct
5 Correct 14 ms 11184 KB correct
6 Correct 13 ms 11184 KB correct
7 Correct 14 ms 11184 KB correct
8 Correct 12 ms 11184 KB correct
9 Correct 13 ms 11184 KB correct
10 Correct 12 ms 11184 KB correct
11 Correct 12 ms 11184 KB correct
12 Correct 14 ms 11184 KB correct
13 Correct 15 ms 11212 KB correct
14 Correct 15 ms 11244 KB correct
15 Correct 17 ms 11244 KB correct
16 Correct 16 ms 11244 KB correct
17 Correct 16 ms 11244 KB correct
18 Correct 16 ms 11244 KB correct
19 Correct 16 ms 11244 KB correct
20 Correct 17 ms 11244 KB correct
21 Correct 17 ms 11244 KB correct
22 Correct 16 ms 11244 KB correct
23 Correct 16 ms 11244 KB correct
24 Correct 15 ms 11244 KB correct
25 Correct 12 ms 11244 KB correct
26 Correct 14 ms 11244 KB correct
27 Correct 17 ms 11244 KB correct
28 Correct 14 ms 11244 KB correct
29 Correct 16 ms 11244 KB correct
30 Correct 16 ms 11244 KB correct
31 Correct 15 ms 11244 KB correct
32 Correct 15 ms 11244 KB correct
33 Correct 15 ms 11248 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10872 KB correct
2 Correct 14 ms 10980 KB correct
3 Correct 16 ms 11184 KB correct
4 Correct 13 ms 11184 KB correct
5 Correct 14 ms 11184 KB correct
6 Correct 13 ms 11184 KB correct
7 Correct 14 ms 11184 KB correct
8 Correct 12 ms 11184 KB correct
9 Correct 13 ms 11184 KB correct
10 Correct 12 ms 11184 KB correct
11 Correct 12 ms 11184 KB correct
12 Correct 14 ms 11184 KB correct
13 Correct 15 ms 11212 KB correct
14 Correct 15 ms 11244 KB correct
15 Correct 17 ms 11244 KB correct
16 Correct 16 ms 11244 KB correct
17 Correct 16 ms 11244 KB correct
18 Correct 16 ms 11244 KB correct
19 Correct 16 ms 11244 KB correct
20 Correct 17 ms 11244 KB correct
21 Correct 17 ms 11244 KB correct
22 Correct 16 ms 11244 KB correct
23 Correct 16 ms 11244 KB correct
24 Correct 15 ms 11244 KB correct
25 Correct 12 ms 11244 KB correct
26 Correct 14 ms 11244 KB correct
27 Correct 17 ms 11244 KB correct
28 Correct 14 ms 11244 KB correct
29 Correct 16 ms 11244 KB correct
30 Correct 16 ms 11244 KB correct
31 Correct 15 ms 11244 KB correct
32 Correct 15 ms 11244 KB correct
33 Correct 15 ms 11248 KB correct
34 Correct 206 ms 12652 KB correct
35 Correct 193 ms 12652 KB correct
36 Correct 164 ms 12652 KB correct
37 Correct 21 ms 12652 KB correct
38 Correct 292 ms 12652 KB correct
39 Correct 170 ms 12652 KB correct
40 Correct 160 ms 12652 KB correct
41 Correct 252 ms 12652 KB correct
42 Correct 239 ms 12652 KB correct
43 Correct 122 ms 12652 KB correct
44 Correct 109 ms 12652 KB correct
45 Correct 106 ms 12652 KB correct
46 Correct 95 ms 12652 KB correct
47 Correct 56 ms 12652 KB correct
48 Correct 14 ms 12652 KB correct
49 Correct 20 ms 12652 KB correct
50 Correct 38 ms 12652 KB correct
51 Correct 109 ms 12652 KB correct
52 Correct 102 ms 12652 KB correct
53 Correct 81 ms 12652 KB correct
54 Correct 143 ms 12652 KB correct
55 Correct 120 ms 12652 KB correct
56 Correct 143 ms 12652 KB correct
57 Correct 137 ms 12652 KB correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12652 KB correct
2 Correct 13 ms 12652 KB correct
3 Incorrect 197 ms 15612 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10872 KB correct
2 Correct 14 ms 10980 KB correct
3 Correct 16 ms 11184 KB correct
4 Correct 13 ms 11184 KB correct
5 Correct 14 ms 11184 KB correct
6 Correct 13 ms 11184 KB correct
7 Correct 14 ms 11184 KB correct
8 Correct 12 ms 11184 KB correct
9 Correct 13 ms 11184 KB correct
10 Correct 12 ms 11184 KB correct
11 Correct 12 ms 11184 KB correct
12 Correct 14 ms 11184 KB correct
13 Correct 15 ms 11212 KB correct
14 Correct 15 ms 11244 KB correct
15 Correct 17 ms 11244 KB correct
16 Correct 16 ms 11244 KB correct
17 Correct 16 ms 11244 KB correct
18 Correct 16 ms 11244 KB correct
19 Correct 16 ms 11244 KB correct
20 Correct 17 ms 11244 KB correct
21 Correct 17 ms 11244 KB correct
22 Correct 16 ms 11244 KB correct
23 Correct 16 ms 11244 KB correct
24 Correct 15 ms 11244 KB correct
25 Correct 12 ms 11244 KB correct
26 Correct 14 ms 11244 KB correct
27 Correct 17 ms 11244 KB correct
28 Correct 14 ms 11244 KB correct
29 Correct 16 ms 11244 KB correct
30 Correct 16 ms 11244 KB correct
31 Correct 15 ms 11244 KB correct
32 Correct 15 ms 11244 KB correct
33 Correct 15 ms 11248 KB correct
34 Correct 206 ms 12652 KB correct
35 Correct 193 ms 12652 KB correct
36 Correct 164 ms 12652 KB correct
37 Correct 21 ms 12652 KB correct
38 Correct 292 ms 12652 KB correct
39 Correct 170 ms 12652 KB correct
40 Correct 160 ms 12652 KB correct
41 Correct 252 ms 12652 KB correct
42 Correct 239 ms 12652 KB correct
43 Correct 122 ms 12652 KB correct
44 Correct 109 ms 12652 KB correct
45 Correct 106 ms 12652 KB correct
46 Correct 95 ms 12652 KB correct
47 Correct 56 ms 12652 KB correct
48 Correct 14 ms 12652 KB correct
49 Correct 20 ms 12652 KB correct
50 Correct 38 ms 12652 KB correct
51 Correct 109 ms 12652 KB correct
52 Correct 102 ms 12652 KB correct
53 Correct 81 ms 12652 KB correct
54 Correct 143 ms 12652 KB correct
55 Correct 120 ms 12652 KB correct
56 Correct 143 ms 12652 KB correct
57 Correct 137 ms 12652 KB correct
58 Correct 12 ms 12652 KB correct
59 Correct 13 ms 12652 KB correct
60 Incorrect 197 ms 15612 KB WA in grader: NO
61 Halted 0 ms 0 KB -