oj.uz

Submission #429878

# Submission time Handle Problem Language Result Execution time Memory
429878 2021-06-16T10:13:35 Z dreezy Stations (IOI20_stations) C++17
0 / 100
 1373 ms 664 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back

vector<int> labels;
vector<vector<int>> graph;

void dfs(int n,int p,  int curlabel){
	labels[n] = curlabel;
	for(int adj : graph[n])
	{
		if(adj != p)
			dfs(adj, n, curlabel + 1);
	}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> cnt(n);
	labels.assign(n, 0);
	graph.assign( n, vector<int>());
	for (int i = 0; i < n - 1; i++) {
		//cout << u[i]<<", "<<v[i]<<endl;
		cnt[u[i]]++;
		cnt[v[i]]++;
		graph[u[i]].pb(v[i]);
		graph[v[i]].pb(u[i]);
	}
	
	int root = 0;
	int counter = 0;
	for(int branch : graph[root]){
		dfs(branch, root,counter * 1000 +1);
		counter++;
	}
	
	
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	int startbranch = s/1000;
	int endbranch = t/1000;
	if(s == 0){
		return endbranch * 1000 + 1;
	}
	
	if(startbranch == endbranch){
		if(s < t)
			return s + 1;
		
			
	}
	
	if( (s - 1) % 1000 == 0)
			return 0;
		return s -1;
}


/************/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 328 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1005
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 328 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=2, label=1001
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 618 ms 608 KB Output is correct
2 Correct 763 ms 608 KB Output is correct
3 Correct 1367 ms 400 KB Output is correct
4 Correct 1023 ms 484 KB Output is correct
5 Correct 838 ms 484 KB Output is correct
6 Correct 550 ms 604 KB Output is correct
7 Correct 552 ms 560 KB Output is correct
8 Correct 3 ms 584 KB Output is correct
9 Correct 8 ms 464 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Incorrect 1 ms 200 KB Invalid labels (duplicates values). scenario=1, label=2
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1373 ms 400 KB Output is correct
2 Correct 792 ms 476 KB Output is correct
3 Correct 880 ms 628 KB Output is correct
4 Correct 4 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 284 KB Invalid labels (duplicates values). scenario=0, label=2
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Partially correct 1006 ms 612 KB Partially correct
2 Partially correct 621 ms 604 KB Partially correct
3 Correct 987 ms 548 KB Output is correct
4 Partially correct 990 ms 420 KB Partially correct
5 Partially correct 800 ms 456 KB Partially correct
6 Partially correct 612 ms 664 KB Partially correct
7 Partially correct 514 ms 556 KB Partially correct
8 Partially correct 3 ms 540 KB Partially correct
9 Correct 6 ms 576 KB Output is correct
10 Partially correct 2 ms 464 KB Partially correct
11 Incorrect 6 ms 276 KB Invalid labels (duplicates values). scenario=0, label=2
12 Halted 0 ms 0 KB -