Submission #606116

#TimeUsernameProblemLanguageResultExecution timeMemory
606116polyaStations (IOI20_stations)C++14
0 / 100
913 ms564 KiB

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

Compilation message (stderr)

stations.cpp: In function 'int dfs(int)':
stations.cpp:13:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |  for (int i=0; i<adj[nn].size(); i++) dfs(adj[nn][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...