제출 #395976

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
395976		benedict0724	기지국 (IOI20_stations)	C++17	0 / 100	3069 ms	2097156 KiB

stations

#include "stations.h"
#include <vector>
#include <algorithm>

using namespace std;
vector<int> adj[1000];
vector<int> labels;
int sub[1000];

void dfs1(int x, int p)
{
    sub[x] = 1;
    for(int i : adj[x])
    {
        if(i == p) continue;
        dfs1(i, x);
        sub[x] += sub[i];
    }
}

void dfs2(int x, int p, int d, int l, int r){
    if(p != -1 && d == 0) labels[x] = l;
    else if(p != -1) labels[x] = r;

    int tmp = l;
    if(d == 0) tmp++;
    for(int i : adj[x])
    {
        if(i == p) continue;
        dfs2(i, x, !d, tmp, tmp + sub[i] - 1);
        tmp += sub[i];
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    labels.resize(n);
	for(int i=0;i<n-1;i++){
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
	}
	dfs1(0, -1);
	labels[0] = 0;
	dfs2(0, -1, 0, 0, n-1);
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    sort(c.begin(), c.end());
    int n = c.size() - 1;
    int m = c[0], M = c[n];

    if(m > s)
    {
        if(t < s || t > M) return M;
        for(int i=0;i<=n;i++)
        {
            if(t <= c[i]) return c[i];
        }
    }

    if(M < s)
    {
        if(t > s || t < m) return m;
        for(int i=n;i>=0;i--)
        {
            if(t >= c[i]) return c[i];
        }
    }
}

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

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:69:1: warning: control reaches end of non-void function [-Wreturn-type]
   69 | }
      | ^

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