Submission #432482

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
432482	2021-06-18T10:36:27 Z	milleniumEeee	Stations (IOI20_stations)	C++17	5 / 100	982 ms	728 KB

stations

#ifndef EVAL
#include "stub.cpp"
#endif
#include "stations.h"
 
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pii pair<int, int>
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
 
using namespace std;
 
const int MAXN = 1005;

vector <int> g[MAXN];
int cnt[MAXN];

void clean() {
	for (int i = 0; i < MAXN; i++) {
		cnt[i] = 0;
	}
	for (int i = 0; i < MAXN; i++) {
		g[i].clear();
	}
}

void dfs(int v, int par, vector <int> &order) {
	order.pb(v);
	for (int to : g[v]) {
		if (to != par) {
			dfs(to, v, order);
		}
	}
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	clean(); // на всякий случай
	for (int i = 0; i <= n - 2; i++) {
		int x = u[i];
		int y = v[i];
		g[x].pb(y);
		g[y].pb(x);
		cnt[x]++;
		cnt[y]++;
	}
	int root = 0;
	bool flag = 0;
	for (int i = 0; i < n; i++) {
		if (cnt[i] >= 3) {
			root = i;
			flag = 1;
		}
	}
	vector <int> labels(n);
	if (flag) {
		labels[root] = 1e6;
		int sub = 1;
		for (int son : g[root]) {
			vector <int> order;
			dfs(son, root, order);
			int id = sub * 1000;
			for (int el : order) {
				labels[el] = id++;
			}
			sub++;
		}
	}
	else { // просто бамбук
		int up = -1;
		for (int i = 0; i < n; i++) {
			if (cnt[i] == 1) {
				up = i;
				break;
			}
		}
		vector <int> order;
		dfs(up, -1, order);
		int id = 0;
		for (int el : order) {
			labels[el] = id++;
		}
	}
	return labels;
}
 
int find_next_station(int s, int t, vector<int> c) {
	if (s == 1e6) {
		return t / 1000 * 1000;
	}
	if (s / 1000 == t / 1000) {
		if (s < t) {
			return s + 1;
		} else {
			return s - 1;
		}
	} else {
		if (s % 1000 == 0) {
			return 1e9;
		} else {
			return s - 1;
		}
	}
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	559 ms	528 KB	Output is correct
2	Correct	471 ms	520 KB	Output is correct
3	Correct	895 ms	400 KB	Output is correct
4	Correct	664 ms	400 KB	Output is correct
5	Correct	579 ms	420 KB	Output is correct
6	Correct	462 ms	520 KB	Output is correct
7	Correct	499 ms	512 KB	Output is correct
8	Correct	3 ms	472 KB	Output is correct
9	Correct	6 ms	468 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct

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=0, label=1007
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	549 ms	644 KB	Output is correct
2	Correct	503 ms	620 KB	Output is correct
3	Correct	932 ms	400 KB	Output is correct
4	Correct	670 ms	512 KB	Output is correct
5	Correct	612 ms	512 KB	Output is correct
6	Correct	509 ms	576 KB	Output is correct
7	Correct	515 ms	508 KB	Output is correct
8	Correct	3 ms	468 KB	Output is correct
9	Correct	5 ms	468 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Incorrect	572 ms	400 KB	Wrong query response.
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	902 ms	512 KB	Output is correct
2	Correct	703 ms	520 KB	Output is correct
3	Correct	644 ms	528 KB	Output is correct
4	Correct	3 ms	420 KB	Output is correct
5	Correct	9 ms	468 KB	Output is correct
6	Correct	2 ms	468 KB	Output is correct
7	Incorrect	692 ms	512 KB	Wrong query response.
8	Halted	0 ms	0 KB	-

Subtask #5

0 / 61.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	554 ms	520 KB	Output is correct
2	Correct	478 ms	728 KB	Output is correct
3	Correct	982 ms	400 KB	Output is correct
4	Correct	688 ms	400 KB	Output is correct
5	Correct	600 ms	712 KB	Output is correct
6	Correct	556 ms	516 KB	Output is correct
7	Correct	488 ms	512 KB	Output is correct
8	Correct	6 ms	468 KB	Output is correct
9	Correct	4 ms	468 KB	Output is correct
10	Correct	2 ms	708 KB	Output is correct
11	Incorrect	502 ms	528 KB	Wrong query response.
12	Halted	0 ms	0 KB	-