답안 #430743

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430743	2021-06-17T03:15:37 Z	JUANDI321	기지국 (IOI20_stations)	C++17	5 / 100	892 ms	700 KB

stations

#include "stations.h"
#include <vector>
#include <iostream>
#include <cstring>
 
using namespace std;
vector<vector<int>> g(1000+10);
vector<int> l(1000 +10);
bool ch[1010];
 
void dfs(int node, int i)
{
	if(ch[node])return;
	ch[node]=true;
	l[i] = node;
	//cout<<node<<endl;
	for(int y : g[node])
	{
		if(!ch[y])
		{
			dfs(y, i+1);
		}
	}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) 
{
	vector<int> labels(n);
	for(int i = 0; i < n-1; i++)
	{
		g[u[i]].push_back(v[i]);
    	g[v[i]].push_back(u[i]);
	}
	int spn = 0;
	for(int i = 0; i < n; i++)
	{
		if(g[i].size() == 1)
		{
			spn = i;
			break;
		}
	}
	dfs(spn, 0);
	//cout<<"hola"<<endl;
	for (int i = 0; i < n; i++) 
	{
		labels[l[i]] = i;
		//cout<<"l[i] "<<l[i]<<" i "<<i<<endl;
	}
	memset(ch, false, sizeof(ch));
	for(int i=0; i<n; i++) g[i].clear(); 
	l.clear();
	return labels;
}
 
int find_next_station(int s, int t, vector<int> c) 
{
	if(t>s)return s+1;
	return s-1;
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	524 ms	616 KB	Output is correct
2	Correct	432 ms	512 KB	Output is correct
3	Correct	857 ms	700 KB	Output is correct
4	Correct	647 ms	516 KB	Output is correct
5	Correct	553 ms	516 KB	Output is correct
6	Correct	451 ms	528 KB	Output is correct
7	Correct	426 ms	520 KB	Output is correct
8	Correct	3 ms	468 KB	Output is correct
9	Correct	3 ms	468 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct

Subtask #2

0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	320 KB	Invalid labels (duplicates values). scenario=0, label=0
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	522 ms	528 KB	Output is correct
2	Correct	458 ms	528 KB	Output is correct
3	Correct	870 ms	516 KB	Output is correct
4	Correct	621 ms	516 KB	Output is correct
5	Correct	562 ms	400 KB	Output is correct
6	Correct	447 ms	528 KB	Output is correct
7	Correct	430 ms	512 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	2 ms	476 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Incorrect	1 ms	328 KB	Invalid labels (duplicates values). scenario=1, label=0
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	875 ms	536 KB	Output is correct
2	Correct	646 ms	516 KB	Output is correct
3	Correct	565 ms	528 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	4 ms	468 KB	Output is correct
6	Correct	2 ms	468 KB	Output is correct
7	Incorrect	1 ms	320 KB	Invalid labels (duplicates values). scenario=3, label=0
8	Halted	0 ms	0 KB	-

Subtask #5

0 / 61.0

#	결과	실행 시간	메모리	Grader output
1	Correct	503 ms	516 KB	Output is correct
2	Correct	438 ms	528 KB	Output is correct
3	Correct	892 ms	476 KB	Output is correct
4	Correct	643 ms	516 KB	Output is correct
5	Correct	596 ms	572 KB	Output is correct
6	Correct	462 ms	516 KB	Output is correct
7	Correct	449 ms	504 KB	Output is correct
8	Correct	2 ms	468 KB	Output is correct
9	Correct	4 ms	468 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Incorrect	4 ms	320 KB	Invalid labels (duplicates values). scenario=0, label=0
12	Halted	0 ms	0 KB	-