oj.uz

Submission #430744

# Submission time Handle Problem Language Result Execution time Memory
430744 2021-06-17T03:18:44 Z JUANDI321 Stations (IOI20_stations) C++17
5 / 100
 887 ms 892 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];
 
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]<<" lb i "<<labels[l[i]]<<endl;
	}
	//cout<<"---------"<<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

# Verdict Execution time Memory Grader output
1 Correct 522 ms 772 KB Output is correct
2 Correct 432 ms 676 KB Output is correct
3 Correct 819 ms 656 KB Output is correct
4 Correct 650 ms 784 KB Output is correct
5 Correct 593 ms 656 KB Output is correct
6 Correct 444 ms 668 KB Output is correct
7 Correct 418 ms 656 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 3 ms 732 KB Output is correct
10 Correct 0 ms 728 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 336 KB Invalid labels (duplicates values). scenario=0, label=0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 541 ms 808 KB Output is correct
2 Correct 423 ms 892 KB Output is correct
3 Correct 854 ms 676 KB Output is correct
4 Correct 609 ms 676 KB Output is correct
5 Correct 602 ms 676 KB Output is correct
6 Correct 443 ms 672 KB Output is correct
7 Correct 447 ms 680 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Incorrect 1 ms 352 KB Invalid labels (duplicates values). scenario=1, label=0
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 866 ms 680 KB Output is correct
2 Correct 621 ms 676 KB Output is correct
3 Correct 579 ms 680 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 1 ms 732 KB Output is correct
7 Incorrect 1 ms 356 KB Invalid labels (duplicates values). scenario=3, label=0
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 510 ms 656 KB Output is correct
2 Correct 437 ms 676 KB Output is correct
3 Correct 887 ms 784 KB Output is correct
4 Correct 677 ms 656 KB Output is correct
5 Correct 597 ms 656 KB Output is correct
6 Correct 433 ms 672 KB Output is correct
7 Correct 432 ms 656 KB Output is correct
8 Correct 4 ms 720 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Incorrect 4 ms 348 KB Invalid labels (duplicates values). scenario=0, label=0
12 Halted 0 ms 0 KB -