oj.uz

답안 #432443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
432443 2021-06-18T09:58:48 Z milleniumEeee 기지국 (IOI20_stations) C++14
0 / 100
 2899 ms 2097156 KB 
#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];
 
void save(int v, int par, vector <int> &order) {
	order.pb(v);
	for (int to : g[v]) {
		if (par != to) {
			save(to, v, order);
		}
	}
}
 
void clean() {
	for (int i = 0; i < MAXN; i++) {
		g[i].clear();
	}
}
 
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);
	}
	int root = -1;
	for (int i = 0; i < n; i++) {
		if (szof(g[i]) == 1) {
			root = i;
			break;
		}
	}
	vector <int> order;
	save(root, -1, order);
	vector <int> labels(n);
	for (int i = 0; i < n; i++) {
		int cur = order[i];
		labels[cur] = i;
	}
	return labels;
}
 
int find_next_station(int s, int t, vector<int> c) {
	int left = min(s, t);
	int right = max(s, t);
	for (int el : c) {
		if (left <= el && el <= right) {
			return el;
		}
	}
	assert(false);
	return -1;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2899 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 556 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1799 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 897 ms 592 KB Output is correct
2 Incorrect 1 ms 200 KB Invalid labels (duplicates values). scenario=1, label=0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2823 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -