oj.uz

답안 #305523

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305523 2020-09-23T12:33:23 Z JustInCase 기지국 (IOI20_stations) C++17
0 / 100
 895 ms 1312 KB 
#include "stations.h"
#include <vector>
#include <iostream>

#define int32_t int
#define int64_t long long

const int32_t MAX_N = 1000;

struct Vertex {
	int32_t inTime, outTime, dep;
	std::vector< int32_t > v;
};

Vertex g[MAX_N + 5];

void dfs(int32_t u, int32_t &t, int32_t par, int32_t dep) {
	g[u].inTime = t++;
	g[u].dep = dep;

	for(auto &v : g[u].v) {
		if(v != par) {
			dfs(v, t, u, dep + 1);
		}
	}

	g[u].outTime = t++;
}

std::vector< int32_t > label(int32_t n, int32_t k, std::vector< int32_t > u, std::vector< int32_t > v) {
	for(int32_t i = 0; i < n; i++) {
		g[i].v.clear();
	}

	for(int32_t i = 0; i < n - 1; i++) {
		g[u[i]].v.push_back(v[i]);
		g[v[i]].v.push_back(u[i]);
	}
	
	int32_t t = 0;
	dfs(0, t, -1, 0);
	
	std::vector< int32_t > labels(n);
	for(int32_t i = 0; i < n; i++) {
		if(g[i].dep % 2 == 0) {
			labels[i] = g[i].inTime;
		}
		else {
			labels[i] = g[i].outTime;
		}
	}

	return labels;
}

int32_t find_next_station(int32_t s, int32_t t, std::vector< int32_t > c) {
	if(s < c[0]) {
		if(t > c[c.size() - 2]) {
			return c[c.size() - 1];
		}
		else {
			for(int32_t i = 0; i < c.size() - 1; i++) {
				if(t > c[i] && t <= c[i + 1]) {
					return c[i + 1];
				}
			}

			return c[0];
		}
	}
	else {
		if(t < c[0]) {
			return c[0];
		}
		else if(t >= c[0] && t > s) {
			return c[0];
		}
		else {
			for(int32_t i = 1; i < c.size() - 1; i++) {
				if(t >= c[i] && t < c[i + 1]) {
					return c[i];
				}
			}

			return c[c.size() - 1];
		}
	}
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:62:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |    for(int32_t i = 0; i < c.size() - 1; i++) {
      |                       ~~^~~~~~~~~~~~~~
stations.cpp:79:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |    for(int32_t i = 1; i < c.size() - 1; i++) {
      |                       ~~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 512 KB Invalid labels (values out of range). scenario=2, k=1000, vertex=1, label=1990
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 384 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1022
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 895 ms 1008 KB Output is correct
2 Incorrect 691 ms 1024 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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