제출 #315687

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

stations

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

using namespace std;

const int N = 1000 + 3;

vector<int> adj[N];

int dfs(int u, int p, int idx, vector<int> &labels){
    for(int to: adj[u]){
        if(to == p) continue;
        idx = dfs(to, u, idx, labels);
    }
    labels[u] = idx++;
    return idx;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v){
    for(int i = 0; i < n; ++i)
        adj[i].clear();

    for(int i = 0; i < n - 1; ++i){
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }

	vector<int> labels(n);
	dfs(0, -1, 0, labels);
	return labels;
}

int find_next_station(int s, int t, vector<int> c){
    for(int i = 0; i < c.size(); ++i)
        if(c[i] >= t)
            return c[i];
    return c.back();
}
/*
2
5 10
0 1
0 2
1 3
1 4
1
0 4 0
2 1
0 1
1
1 0 0
*/

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

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

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