제출 #605995

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
605995		polya	기지국 (IOI20_stations)	C++14	0 / 100	1 ms	432 KiB

stations

#include "stations.h"
#include <vector>
 
using namespace std;
 
vector<int> adj[1004];
vector<int> labels;
int cnt = 0;
 
int dfs(int nn) {
    if (labels[nn] != -1) return 0;
  else {
	labels[nn] = cnt++;
	for (auto &i : adj[nn]) dfs(i); }
}
 
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	labels.resize(n, -1);
	for (int i=0; i<u.size(); i++) {
		adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
	}
	for (int i=0; i<n; i++) {
		if (adj[i].size() != 2) dfs(i);
	}
    return labels;
}
 
int find_next_station(int s, int t, std::vector<int> c) {
	if (s < t) return s+1;
	else return s-1;
}

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

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:19:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for (int i=0; i<u.size(); i++) {
      |                ~^~~~~~~~~
stations.cpp: In function 'int dfs(int)':
stations.cpp:15:1: warning: control reaches end of non-void function [-Wreturn-type]
   15 | }
      | ^

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61