oj.uz

Submission #603364

# Submission time Handle Problem Language Result Execution time Memory
603364 2022-07-24T05:27:11 Z Shithila Split the Attractions (IOI19_split) C++14
7 / 100
 41 ms 4536 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
 
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> res;
	int m=p.size();
	//cout<<m<<endl;
	int connected[m][2];
	bool visited[m];
	
	for(int i=0;i<n;i++)
	{
		connected[i][0]=-1;
		connected[i][1]=-1;
		visited[i]=false;
		res.push_back(3);
	}
	for(int i=0;i<m;i++)
	{
		int x=p[i];
		int y=q[i];
		if(connected[x][0]==-1) connected[x][0]=y;
		else connected[x][1]=y;
		if(connected[y][0]==-1) connected[y][0]=x;
		else connected[y][1]=x;
	}
	int startpos=-1;
	int endpos=-1;
	for(int i=0;i<n;i++)
	{
		if(connected[i][0]==-1 || connected[i][1]==-1)
		{
			if(startpos==-1) startpos=i;
			else endpos=i;
		}
	}
	if(startpos==-1)
	{
		startpos=0;
		int startcount=0;
		while(startcount<a)
		{
			visited[startpos]=true;
			res[startpos]=1;
			startcount++;
			if(visited[connected[startpos][0]]==true)
			{
				startpos=connected[startpos][1];
			}
			else startpos=connected[startpos][0];
		}
		int endcount=0;
		if(visited[connected[startpos][0]]==true)
		{
			endpos=connected[startpos][1];
		}
		else endpos=connected[startpos][0];
		while(endcount<b)
		{
			visited[endpos]=true;
			res[endpos]=2;
			endcount++;
			if(visited[connected[endpos][0]]==true)
			{
				endpos=connected[endpos][1];
			}
			else endpos=connected[endpos][0];
		}
		return res;
	}
	int startcount=0;
	while(startcount<a)
	{
		visited[startpos]=true;
		res[startpos]=1;
		startcount++;
		if(visited[connected[startpos][0]]==true)
		{
			startpos=connected[startpos][1];
		}
		else startpos=connected[startpos][0];
	}
	int endcount=0;
	while(endcount<b)
	{
		visited[endpos]=true;
		res[endpos]=2;
		endcount++;
		if(visited[connected[endpos][0]]==true)
		{
			endpos=connected[endpos][1];
		}
		else endpos=connected[endpos][0];
	}
	/*for(int i=0;i<n;i++)
	{
		cout<<res[i]<<" ";
	}
	cout<<endl;*/
	return res;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 1 ms 212 KB ok, correct split
4 Correct 0 ms 300 KB ok, correct split
5 Correct 1 ms 212 KB ok, correct split
6 Correct 1 ms 212 KB ok, correct split
7 Correct 30 ms 4520 KB ok, correct split
8 Correct 29 ms 4536 KB ok, correct split
9 Correct 32 ms 4432 KB ok, correct split
10 Correct 31 ms 4524 KB ok, correct split
11 Correct 29 ms 4424 KB ok, correct split

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Runtime error 1 ms 340 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Runtime error 41 ms 3384 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 1 ms 212 KB ok, correct split
4 Correct 0 ms 300 KB ok, correct split
5 Correct 1 ms 212 KB ok, correct split
6 Correct 1 ms 212 KB ok, correct split
7 Correct 30 ms 4520 KB ok, correct split
8 Correct 29 ms 4536 KB ok, correct split
9 Correct 32 ms 4432 KB ok, correct split
10 Correct 31 ms 4524 KB ok, correct split
11 Correct 29 ms 4424 KB ok, correct split
12 Correct 0 ms 212 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Runtime error 1 ms 340 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -