제출 #432754

#제출 시각아이디문제언어결과실행 시간메모리
432754A_D기지국 (IOI20_stations)C++14
0 / 100
923 ms600 KiB
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> label(int n, int k,vector<int> u,vector<int> v){
    vector<int> ret;
    for(int i=0;i<n;i++)ret.push_back(i);
    return ret;
}

int find_next_station(int s, int t,vector<int> c){
    int mx=0,mn=1e9;
    for(auto x:c){
        mn=min(mn,x);
        mx=max(mx,x);
    }
    if(s<t)return mx;
    else return mn;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...