oj.uz

답안 #1092875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092875 2024-09-25T09:33:11 Z huyngo 기지국 (IOI20_stations) C++17
0 / 100
 3000 ms 2097152 KB 
#include "stations.h"
#include<bits/stdc++.h>
using namespace std;

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
	vector<vector<int>> adj(n);
	for (int i = 0;i < n; ++i) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	vector<int> in(n), out(n);
	int dtime = -1;
	auto dfs = [&](auto self, int u, int p) -> void {
		in[u] = ++dtime;
		for (int v : adj[u]) if (v != p) {
			self(self, v, u);
		}
		out[u] = dtime;
		};
	dfs(dfs, 0, -1);
	for (int i = 0; i < n; i++) {
		labels[i] = in[i] * 1000 + out[i];
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	int res = -1;
	int inS = s / 1000;
	int inT = t / 1000;
	int parS = 0;
	for (int x : c) {
		int i = x / 1000, j = x % 1000;
		if (i <= inT && inT <= j)
			res = x;
		if (i <= inS && inS <= j)
			parS = x;
	}
	if (res == -1)
		res = parS;
	return res;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3062 ms 194556 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 628 ms 684 KB Output is correct
2 Correct 438 ms 684 KB Output is correct
3 Correct 423 ms 684 KB Output is correct
4 Correct 1 ms 764 KB Output is correct
5 Runtime error 1 ms 344 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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