oj.uz

답안 #433532

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433532 2021-06-20T04:28:30 Z JUANDI321 Split the Attractions (IOI19_split) C++17
7 / 100
 88 ms 9372 KB 
#include "split.h"
#include <vector>
#include <iostream>

using namespace std;
vector<vector<int>> g(100100);
vector<int> rest(100100);
int aa, bb, cc;
bool ch[100100];
void dfs(int node)
{
	if(ch[node])return;
	ch[node]=true;
	if(aa>0)
	{
		rest[node]=1;
		aa--;
	}
	else if(bb>0)
	{
		rest[node]=2;
		bb--;
	}
	else 
	{
		rest[node]=3;
		cc--;
	}
	for(int y : g[node])
	{
		if(!ch[y])
		{
			//cout<<y<<" "<<node<<endl;
			dfs(y);
			break;
		}
	}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) 
{
	aa = a;
	bb = b;
	cc = c;
	vector<int> res(n);
	int m = p.size();
	for(int i = 0; i<m; i++)
	{
		g[p[i]].push_back(q[i]);
		g[q[i]].push_back(p[i]);
	}
	int node = 0;
	if(m==n-1)
	{
		for(int i = 0; i<n; i++)
		{
			if(g[i].size() == 1)
			{
				node = i; 
				break;
			}
		}
	}
	dfs(node);
	for(int i = 0; i<n; i++)
	{//cout<<"HOLA"<<endl;
		res[i] = rest[i];
		
	}
	return res;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3020 KB ok, correct split
2 Correct 2 ms 3072 KB ok, correct split
3 Correct 2 ms 3020 KB ok, correct split
4 Correct 2 ms 3020 KB ok, correct split
5 Correct 2 ms 3020 KB ok, correct split
6 Correct 3 ms 3148 KB ok, correct split
7 Correct 73 ms 9372 KB ok, correct split
8 Correct 75 ms 9368 KB ok, correct split
9 Correct 75 ms 9304 KB ok, correct split
10 Correct 88 ms 9284 KB ok, correct split
11 Correct 80 ms 9284 KB ok, correct split

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3020 KB ok, correct split
2 Correct 2 ms 3020 KB ok, correct split
3 Incorrect 2 ms 3056 KB answer contains both zero and positive values
4 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 3020 KB answer contains both zero and positive values
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 3020 KB answer contains both zero and positive values
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3020 KB ok, correct split
2 Correct 2 ms 3072 KB ok, correct split
3 Correct 2 ms 3020 KB ok, correct split
4 Correct 2 ms 3020 KB ok, correct split
5 Correct 2 ms 3020 KB ok, correct split
6 Correct 3 ms 3148 KB ok, correct split
7 Correct 73 ms 9372 KB ok, correct split
8 Correct 75 ms 9368 KB ok, correct split
9 Correct 75 ms 9304 KB ok, correct split
10 Correct 88 ms 9284 KB ok, correct split
11 Correct 80 ms 9284 KB ok, correct split
12 Correct 2 ms 3020 KB ok, correct split
13 Correct 2 ms 3020 KB ok, correct split
14 Incorrect 2 ms 3056 KB answer contains both zero and positive values
15 Halted 0 ms 0 KB -