Submission #1096002

#	Time	Username	Problem	Language	Result	Execution time	Memory
1096002		Newtonabc	기지국 (IOI20_stations)	C++14	100 / 100	667 ms	1096 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int tmpcase1,cnt=0,root;
vector<int> adj[N],lb;
void dfs(int u,int p,int lvl){
	if(lvl%2==0) lb[u]=cnt++;
	for(int i=0;i<adj[u].size();i++){
		int v=adj[u][i];
		if(v!=p) dfs(v,u,lvl+1);
	}
	if(lvl%2) lb[u]=cnt++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	lb.resize(n);
	cnt=0;
	for(int i=0;i<n-1;i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	dfs(0,-1,0);
	for(int i=0;i<n;i++) adj[i].clear();
	/*for(int i=0;i<lb.size();i++) cout<<lb[i] <<" ";
	cout<<"\n\n\n";*/
	return lb;
}

int find_next_station(int s, int t, vector<int> c) {
	//for(int i=0;i<c.size();i++) cout<<c[i] <<" ";
	//cout<<c.size();
	//cout<<"\n";
	bool mx=true;
	int tmn=INT_MAX,n=c.size();
	if(c.size()==1) return c[0];
	for(int i=0;i<c.size();i++){
		if(s<c[i]) mx=false;
	}
	if(mx){
		for(int i=n-1;t<s && i>=1;i--) if(t>=c[i]) return c[i];
		return c[0];
	}
	else{
		for(int i=0;t>s && i<n-1;i++) if(t<=c[i]) return c[i];
		return c[n-1];
	}
	
}

Compilation message (stderr)

stations.cpp: In function 'void dfs(int, int, int)':
stations.cpp:9:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for(int i=0;i<adj[u].size();i++){
      |              ~^~~~~~~~~~~~~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:36:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for(int i=0;i<c.size();i++){
      |              ~^~~~~~~~~
stations.cpp:34:6: warning: unused variable 'tmn' [-Wunused-variable]
   34 |  int tmn=INT_MAX,n=c.size();
      |      ^~~

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