제출 #780985

#제출 시각아이디문제언어결과실행 시간메모리
780985Blagoj기지국 (IOI20_stations)C++17
0 / 100
611 ms548 KiB
#include <bits/stdc++.h>
#include "stations.h"

using namespace std;

vector<int> g[1005], labels;
int in[1005], out[1005], timer = 0;

void dfs(int n, int p) {
	labels[n] = timer++;
	for (auto x : g[n]) if (x != p) dfs(x, n);
}
 
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	labels.resize(n, 0);
	for (int i = 0; i < n; i++) g[i].clear();
	timer = 0;
	for (int i = 0; i < u.size(); i++) {
		g[u[i]].push_back(v[i]);
		g[v[i]].push_back(u[i]);
	}
	dfs(0, -1);
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	int parent = -1;
	for (auto x : c) {
		if (x < s) {
			parent = x;
			continue;
		}
		if (min(x, s) < t && t < max(x, s)) return x;
	}
	return parent;
}

컴파일 시 표준 에러 (stderr) 메시지

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:18:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |  for (int i = 0; i < u.size(); i++) {
      |                  ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...