제출 #1155838

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1155838		AlgorithmWarrior	Stations (IOI20_stations)	C++20	69.87 / 100	303 ms	576 KiB

stations

#include "stations.h"
#include <cstdio>
#include <cassert>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;

void dfs(int nod,int tata,bool tip,vector<int>&labels,vector<vector<int>>&tree){
    static int time=-1;
    if(tip)
        labels[nod]=++time;
    for(auto fiu : tree[nod])
        if(fiu!=tata)
            dfs(fiu,nod,!tip,labels,tree);
    if(!tip)
        labels[nod]=++time;
}

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

int find_next_station(int s,int t,vector<int>c) {
    if(s>c.back()){
        if(t<c[0] || t>s)
            return c[0];
        int i;
        for(i=(int)c.size()-1;i>=0;--i)
            if(c[i]<=t)
                return c[i];
    }
    else{
        if(t<s || t>c.back())
            return c.back();
        int i;
        for(i=0;i<(int)c.size();++i)
            if(c[i]>=t)
                return c[i];
    }
}

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

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

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