제출 #434225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434225		Kanaifu	Stations (IOI20_stations)	C++14	0 / 100	3039 ms	2097156 KiB

stations

#include <bits/stdc++.h>
#include "stations.h"

using namespace std;
#define pb push_back

vector<vector<int>> adj;
vector <int> in;
vector <int> out;
int cnt = -1;

void dfs (int node, int last)
{
    cnt++;
    in[node] = cnt;
    for (int next : adj[node])
    {
        if (next!=last)
        {
            dfs(next, node);
        }
    }
    out[node] = cnt;
    return ;
}

bool check(int lab1, int lab2)
{
    int cur_in = lab1/1000;
    int cur_out = lab1%1000;
    int des_in = lab2/1000;
    int des_out = lab2%1000;
    if (cur_in < des_in and des_in <= cur_out)
    {
        return true;
    }
    else
    {
        return false;
    }
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v)
{
    in.resize(n+1);
    out.resize(n+1);
    adj.resize(n+1);
    vector <int> labels;
	for (int i = 0; i < n-1; i++)
    {
		adj[u[i]].pb(v[i]);
        adj[v[i]].pb(u[i]);
	}
	dfs(0, -1);
	for (int i=0; i<n; i++)
    {
        labels.pb(in[i]*1000 + out[i]);
    }
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c)
{
    if (check(s, t))
    {
        for (int child : c)
        {
            if (child==t)
            {
                return child;
            }
            if (check(child, s))
            {
                continue;
            }
            if (check(child, t))
            {
                return child;
            }
        }
    }
    else
    {
        for (int child : c)
        {
            if (child==t)
            {
                return child;
            }
            if (check(child, s))
            {
                return child;
            }
        }
    }
    return c[0];
}

/*
1
5 10000000
0 1
1 2
1 3
2 4
2
2 0 1
1 3 3

*/

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

stations.cpp: In function 'bool check(int, int)':
stations.cpp:32:9: warning: unused variable 'des_out' [-Wunused-variable]
   32 |     int des_out = lab2%1000;
      |         ^~~~~~~

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