oj.uz

Submission #601879

# Submission time Handle Problem Language Result Execution time Memory
601879 2022-07-22T11:40:23 Z Minindu2006 Split the Attractions (IOI19_split) C++14
18 / 100
 81 ms 18436 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;

const int MX = 2e5 + 5;
vector<int> adj[MX];

void dfs(int i, vector<int> &vis, vector<int> &path)
{
	vis[i] = 1;
	path.push_back(i);
	for(int j:adj[i])
		if(!vis[j])
			dfs(j, vis, path);
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
	int m = p.size();
	for(int i=0;i<m;i++)
	{
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}

	int root = -1;
	for(int i=0;i<n;i++)
	{
		if(adj[i].size() == 1)
		{
			root = i;
			break;
		}
	}
	root = max(root, 0);
	vector<int> vis(n, 0), path, res(n, 3);
	dfs(root, vis, path);
	for(int i=0;i<a;i++)
		res[path[i]] = 1;
	for(int i=a;i<a+b;i++)
		res[path[i]] = 2;
	return res;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 3 ms 4948 KB ok, correct split
3 Correct 3 ms 4948 KB ok, correct split
4 Correct 2 ms 4948 KB ok, correct split
5 Correct 3 ms 4948 KB ok, correct split
6 Correct 3 ms 5076 KB ok, correct split
7 Correct 68 ms 18352 KB ok, correct split
8 Correct 79 ms 18436 KB ok, correct split
9 Correct 71 ms 18408 KB ok, correct split
10 Correct 65 ms 18340 KB ok, correct split
11 Correct 61 ms 18308 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB ok, correct split
2 Correct 3 ms 4948 KB ok, correct split
3 Correct 3 ms 4908 KB ok, correct split
4 Correct 71 ms 16772 KB ok, correct split
5 Correct 50 ms 12324 KB ok, correct split
6 Correct 60 ms 18376 KB ok, correct split
7 Correct 58 ms 18388 KB ok, correct split
8 Correct 81 ms 15604 KB ok, correct split
9 Correct 51 ms 12300 KB ok, correct split
10 Correct 43 ms 12400 KB ok, correct split
11 Correct 44 ms 12292 KB ok, correct split
12 Correct 59 ms 12752 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB ok, correct split
2 Incorrect 51 ms 12296 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4948 KB 2 components are not connected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 3 ms 4948 KB ok, correct split
3 Correct 3 ms 4948 KB ok, correct split
4 Correct 2 ms 4948 KB ok, correct split
5 Correct 3 ms 4948 KB ok, correct split
6 Correct 3 ms 5076 KB ok, correct split
7 Correct 68 ms 18352 KB ok, correct split
8 Correct 79 ms 18436 KB ok, correct split
9 Correct 71 ms 18408 KB ok, correct split
10 Correct 65 ms 18340 KB ok, correct split
11 Correct 61 ms 18308 KB ok, correct split
12 Correct 3 ms 4948 KB ok, correct split
13 Correct 3 ms 4948 KB ok, correct split
14 Correct 3 ms 4908 KB ok, correct split
15 Correct 71 ms 16772 KB ok, correct split
16 Correct 50 ms 12324 KB ok, correct split
17 Correct 60 ms 18376 KB ok, correct split
18 Correct 58 ms 18388 KB ok, correct split
19 Correct 81 ms 15604 KB ok, correct split
20 Correct 51 ms 12300 KB ok, correct split
21 Correct 43 ms 12400 KB ok, correct split
22 Correct 44 ms 12292 KB ok, correct split
23 Correct 59 ms 12752 KB ok, correct split
24 Correct 3 ms 5076 KB ok, correct split
25 Incorrect 51 ms 12296 KB 2 components are not connected
26 Halted 0 ms 0 KB -