제출 #1034091

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1034091		Boas	기지국 (IOI20_stations)	C++17	76 / 100	633 ms	1528 KiB

stations

#include <bits/stdc++.h>
using namespace std;
#include "stations.h"

#define loop(x, i) for (int i = 0; i < x; i++)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef set<int> si;
typedef vector<vi> vvi;

vvi adj;
vi nrs;
vi d;
vi nrMx;
int curNr = 0;

void DFS(int i, int prev = -1, int de = 0)
{
	nrs[i] = curNr;
	curNr++;
	d[i] = de;
	for (int j : adj[i])
	{
		if (prev == j)
			continue;
		DFS(j, i, de + 1);
	}
	nrMx[i] = curNr;
	curNr++;
}

vi label(int n, int k, vi u, vi v)
{
	assert(k >= n);
	curNr = 0;
	nrs = vi(n);
	nrMx = vi(n);
	d = vi(n);
	adj = vvi(n);
	loop(u.size(), i)
	{
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}
	DFS(0);
	vi labels(n);
	for (int i = 0; i < n; i++)
	{
		if (d[i] % 2 == 0)
			labels[i] = nrs[i];
		else
			labels[i] = nrMx[i];
	}
	return labels;
}

int find_next_station(int s, int t, vi c)
{
	if (c.size() == 1)
		return c[0];
	if (s > c[0])
	{
		int nrMax = s;
		int nrGoal = t;
		if (nrGoal > nrMax || nrGoal < c[1])
		{
			// smallest number, so to the root
			return c[0];
		}
		c.pb(s);
		for (int i = 1; i < c.size() - 1; i++)
		{
			int l = c[i];
			if (nrGoal < c[i + 1] && nrGoal >= l)
				return l;
		}
	}
	else if (s == 0)
	{
		c.pb(0);
		for (int i = 1; i < c.size(); i++)
		{
			int l = c[i];
			if (t <= l && t > c[i - 1])
				return l;
		}
	}
	else // s < c[0]
	{
		int nr = s;
		int nrGoal = t;
		if (nrGoal > c[c.size() - 2] || nrGoal < nr)
		{
			// to the root
			return c.back();
		}
		c.insert(c.begin(), s);
		for (int i = 1; i < c.size(); i++)
		{
			int l = c[i];
			if (t <= l && t > c[i - 1])
				return l;
		}
	}
	// throw;
	return c[0];
}

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

stations.cpp: In function 'vi label(int, int, vi, vi)':
stations.cpp:5:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define loop(x, i) for (int i = 0; i < x; i++)
......
   42 |  loop(u.size(), i)
      |                                       
stations.cpp:42:2: note: in expansion of macro 'loop'
   42 |  loop(u.size(), i)
      |  ^~~~
stations.cpp: In function 'int find_next_station(int, int, vi)':
stations.cpp:73:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |   for (int i = 1; i < c.size() - 1; i++)
      |                   ~~^~~~~~~~~~~~~~
stations.cpp:83:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |   for (int i = 1; i < c.size(); i++)
      |                   ~~^~~~~~~~~~
stations.cpp:100:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |   for (int i = 1; i < c.size(); i++)
      |                   ~~^~~~~~~~~~

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