Submission #430760

# Submission time Handle Problem Language Result Execution time Memory
430760 2021-06-17T03:41:14 Z JUANDI321 Stations (IOI20_stations) C++17
0 / 100
903 ms 676 KB
#include "stations.h"
#include <vector>
#include <iostream>
#include <cstring>
 
using namespace std;
vector<vector<int>> g(1000+10);
vector<int> l(10000 +10);
bool ch[1010];
int r = 0;
void dfs(int node, int i)
{
	if(ch[node])return;
	ch[node]=true;
	l[node] = i;
	//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);
	l.resize(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;
		}
	}
	if(r==0)
	dfs(spn, 0);
	//cout<<"hola"<<endl;
	for (int i = 0; i < n; i++) 
	{
		labels[i] = l[i];
		//cout<<"l[i] "<<l[i]<<" lb i "<<labels[l[i]]<<endl;
	}
	//cout<<"---------"<<endl;
	for(int i = 0; i<n+2; i++)ch[i]=false;
	for(int i=0; i<n; i++) g[i].clear(); 
	//l.clear();
	r++;
	return l;
}
 
int find_next_station(int s, int t, vector<int> c) 
{
	if(t>s)return s+1;
	return s-1;
}
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 516 KB Invalid labels (duplicates values). scenario=2, label=0
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 328 KB Invalid labels (duplicates values). scenario=0, label=10
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 404 KB Invalid labels (duplicates values). scenario=1, label=0
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 903 ms 656 KB Output is correct
2 Incorrect 680 ms 676 KB Wrong query response.
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 360 KB Invalid labels (duplicates values). scenario=1, label=0
2 Halted 0 ms 0 KB -