Submission #341711

#	Time	Username	Problem	Language	Result	Execution time	Memory
341711		ogibogi2004	기지국 (IOI20_stations)	C++14	100 / 100	1174 ms	1252 KiB

stations

#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define time afds
const int MAXN=1024;
vector<int>g[MAXN];
int depth[MAXN];
int in_time[MAXN],out_time[MAXN],time=-1;
void dfs(int u,int par)
{
	in_time[u]=++time;
	for(auto v:g[u])
	{
		if(v==par)continue;
		depth[v]=depth[u]+1;
		dfs(v,u);
	}
	out_time[u]=++time;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
	time=-1;
	memset(depth,-1,sizeof(depth));
	for(int i=0;i<=n;i++)g[i].clear();
	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);
	set<int>l;
	map<int,int>mp;
	for (int i = 0; i < n; i++) {
		if(depth[i]%2==0)
		{
			labels[i]=in_time[i];
		}
		else labels[i]=out_time[i];
		l.insert(labels[i]);
	}
	int cnt=0;
	for(auto xd:l)
	{
		mp[xd]=cnt;++cnt;
	}
	for(int i=0;i<n;i++)
	{
		labels[i]=mp[labels[i]];
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if(c.size()==1)return c[0];
	if(s<c[0])
	{
		if(t<s)
		{
			return c.back();
		}
		for(int i=0;i<c.size();i++)
		{
			if(c[i]>=t)return c[i];
		}
		return c.back();
	}
	else
	{
		if(t>s)
		{
			return c[0];
		}
		for(int i=c.size()-1;i>=0;i--)
		{
			if(c[i]<=t)return c[i];
		}
		return c[0];
	}
	return 0;
}

Compilation message (stderr)

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

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