oj.uz

Submission #407289

# Submission time Handle Problem Language Result Execution time Memory
407289 2021-05-18T17:24:18 Z Dilshod_Imomov Stations (IOI20_stations) C++17
0 / 100
 1 ms 328 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e3 + 7;

int cnt, lb[MAXN];
vector < int > adj[MAXN];

void dfs( int v, int p ) {
	lb[v] = cnt++;
	for ( auto u: adj[v] ) {
		if ( u != p ) {
			dfs( u, v );
		}
	}
	if ( p != -1 ) {
		lb[v] *= 1000;
		lb[v] += cnt;
	}
	else {
		lb[v] *= 1000;
		lb[v]++;
	}
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	for ( int i = 0; i < n - 1; i++ ) {
		adj[ u[i] ].push_back( v[i] );
		adj[ v[i] ].push_back( u[i] );
	}
	int mx = -1, rt = 0;
	for ( int i = 0; i < n; i++ ) {
		if ( (int)adj[i].size() > mx ) {
			mx = adj[i].size();
			rt = i;
		}
	}
	return {};
	cnt = 0;
	dfs( rt, -1 );
	vector < int > lbs;
	for ( int i = 0; i < n; i++ ) {
		lbs.push_back( lb[i] );
	}
	return lbs;
}

int find_next_station(int s, int t, std::vector<int> c) {
	return 0;
	int i = s / 1000;
	int j = t / 1000;
	if ( s == 1 ) {
		for ( auto v: c ) {
			int x = v / 1000, y = v % 1000;
			if ( j >= x && j <= y ) {
				return v;
			}
		}
	}
	int pr = -1;
	for ( auto v: c ) {
		int x = v / 1000, y = v % 1000;
		if ( x < i ) {
			pr = v;
		}
		if ( j >= x && j <= y ) {
			return v;
		}
	}
	return pr;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 320 KB Invalid length of array as the response of 'label'. scenario=0, n=10, len=0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Invalid length of array as the response of 'label'. scenario=0, n=996, len=0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 316 KB Invalid length of array as the response of 'label'. scenario=0, n=2, len=0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Invalid length of array as the response of 'label'. scenario=0, n=2, len=0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Invalid length of array as the response of 'label'. scenario=0, n=3, len=0
2 Halted 0 ms 0 KB -