oj.uz

답안 #1055023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055023 2024-08-12T14:04:53 Z Gromp15 기지국 (IOI20_stations) C++17
5 / 100
 534 ms 12788 KB 
#include <bits/stdc++.h>
#include "stations.h"
using namespace std;

bool line = 1;
bool binary = 1;

const int N = 1001;
vector<vector<int>> go(N, vector<int>(N));

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<vector<int>> adj(n);
	for (int i = 0; i < n-1; i++) {
		if (u[i] > v[i]) swap(u[i], v[i]);
		binary &= (v[i] + 1) / 2 == (u[i] + 1);
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	int r = -1;
	for (int i = 0; i < n; i++) {
		if (adj[i].size() == 1) r = i;
		line &= adj[i].size() <= 2;
	}
	if (line) {
		vector<int> ans(n);
		int t = 0;
		auto dfs = [&](auto&& s, int v, int p) -> void {
			ans[v] = t++;
			for (int u : adj[v]) if (u != p) s(s, u, v);
		};
		dfs(dfs, r, -1);
		return ans;
	}
	if (binary) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) go[i][j] = -1;
			auto dfs = [&](auto&& s, int v) -> void {
				for (int u : adj[v]) if (u != go[i][v]) {
					go[i][u] = v;
					s(s, u);
				}
			};
			dfs(dfs, i);
		}
		vector<int> ans(n);
		iota(ans.begin(), ans.end(), 0);
		return ans;
	}
	vector<int> tin(n), tout(n);
	int timer = 0;
	auto dfs = [&](auto&& s, int v, int p) -> void {
		tin[v] = timer++;
		for (int u : adj[v]) if (u != p) {
			s(s, u, v);
		}
		tout[v] = timer - 1;
	};
	dfs(dfs, 0, -1);
	vector<int> ans(n);
	for (int i = 0; i < n; i++) ans[i] = tin[i] * 1000 + tout[i];
	return ans;
}

bool anc(int x, int y) {
	int tins = x / 1000, touts = x % 1000;
	int tint = y / 1000, toutt = y % 1000;
	return tins <= tint && toutt <= touts;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if (line) {
		for (int x : c) if ((x-s)*(x-t) <= 0) return x;
	}
	if (binary) {
		return go[t][s];
	}
	if (anc(s, t)) {
		for (int x : c) {
			if (anc(s, x) && anc(x, t)) return x;
		}
	}
	else {
		for (int x : c) {
			if (anc(x, s)) return x;
		}
	}
	assert(0);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 319 ms 8620 KB Output is correct
2 Correct 259 ms 8620 KB Output is correct
3 Correct 488 ms 8368 KB Output is correct
4 Correct 385 ms 8364 KB Output is correct
5 Correct 327 ms 8364 KB Output is correct
6 Correct 299 ms 8620 KB Output is correct
7 Correct 249 ms 8620 KB Output is correct
8 Correct 5 ms 8456 KB Output is correct
9 Correct 5 ms 8456 KB Output is correct
10 Correct 5 ms 8456 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 332 ms 8620 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 293 ms 8620 KB Output is correct
2 Correct 263 ms 8620 KB Output is correct
3 Correct 479 ms 8368 KB Output is correct
4 Correct 346 ms 8364 KB Output is correct
5 Correct 335 ms 8364 KB Output is correct
6 Correct 265 ms 8620 KB Output is correct
7 Correct 264 ms 8624 KB Output is correct
8 Correct 4 ms 8452 KB Output is correct
9 Correct 5 ms 8456 KB Output is correct
10 Correct 4 ms 8456 KB Output is correct
11 Runtime error 8 ms 12788 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 510 ms 8364 KB Output is correct
2 Correct 359 ms 8364 KB Output is correct
3 Correct 350 ms 8364 KB Output is correct
4 Correct 4 ms 8456 KB Output is correct
5 Correct 5 ms 8464 KB Output is correct
6 Correct 4 ms 8456 KB Output is correct
7 Runtime error 7 ms 12716 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 281 ms 8620 KB Output is correct
2 Correct 226 ms 8620 KB Output is correct
3 Correct 534 ms 8364 KB Output is correct
4 Correct 392 ms 8364 KB Output is correct
5 Correct 369 ms 8388 KB Output is correct
6 Correct 261 ms 8620 KB Output is correct
7 Correct 254 ms 8620 KB Output is correct
8 Correct 4 ms 8456 KB Output is correct
9 Correct 5 ms 8456 KB Output is correct
10 Correct 3 ms 8452 KB Output is correct
11 Incorrect 320 ms 8640 KB Wrong query response.
12 Halted 0 ms 0 KB -