제출 #309928

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

stations

#include<bits/stdc++.h>
#include "stations.h"
using namespace std;
vector<int> path[1001], ret;
bool visited[1001];
int tsize[1001];

int dfs(int x){
    int s = 1;
    for(int i = 0;i < path[x].size();i++){
        if(visited[path[x][i]]) continue;
        visited[path[x][i]] = true;
        s += dfs(path[x][i]);
    }
    return tsize[x] = s;
}
void dfs2(int x, int s, int e, int d){
    if(d%2 == 0) {ret[x] = s; s++;}
    else ret[x] = e;
    for(int i = 0;i < path[x].size();i++){
        if(visited[path[x][i]]) continue;
        visited[path[x][i]] = true;
        dfs2(path[x][i], s, s+tsize[path[x][i]]-1, d+1);
        s+=tsize[path[x][i]];
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v){
    ret.clear();
    for(int i = 0;i < n;i++) path[i].clear();
    ret.resize(n);
    for(int i = 0;i < n-1;i++){
        path[u[i]].push_back(v[i]);
        path[v[i]].push_back(u[i]);
    }
    for(int i = 0;i < n;i++) visited[i] = false;
    visited[0] = true;
    dfs(0);
    for(int i = 0;i < n;i++) visited[i] = false;
    visited[0] = true;
    dfs2(0, 0, n-1, 0);
    return ret;
}

int find_next_station(int s, int t, vector<int> c){
    if(c[0] < s){
        if(t > s || t < c[0]) return c[0];
        return c[(int)(upper_bound(c.begin(), c.end(), t) - c.begin())];
    }
    else{
        if(t < s || t > c.back()) return c.back();
        return c[(int)(lower_bound(c.begin(), c.end(), t) - c.begin())];
    }
}

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

stations.cpp: In function 'int dfs(int)':
stations.cpp:10:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i = 0;i < path[x].size();i++){
      |                   ~~^~~~~~~~~~~~~~~~
stations.cpp: In function 'void dfs2(int, int, int, int)':
stations.cpp:20:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i = 0;i < path[x].size();i++){
      |                   ~~^~~~~~~~~~~~~~~~

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