제출 #673527

#제출 시각아이디문제언어결과실행 시간메모리
673527Essa2006기지국 (IOI20_stations)C++14
0 / 100
893 ms684 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
vector<int>Vis, labels;
vector<vector<int>>A;
vector<array<int, 2>>dp;
// time, max_time
int time_=0;
void dfs(int ind){
    Vis[ind]=1, labels[ind]=time_++;
    for(int i=0;i<A[ind].size();i++)
        if(!Vis[A[ind][i]])
            dfs(A[ind][i]); 
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    dp.clear(), Vis.clear(), A.clear(), labels.clear();
    dp.resize(n), Vis.resize(n), A.resize(n), labels.resize(n);
    for(int i=0;i<n;i++)
        A[u[i]].push_back(v[i]), A[v[i]].push_back(u[i]);
    dfs(0);
    return labels;
}

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

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

stations.cpp: In function 'void dfs(int)':
stations.cpp:16:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i=0;i<A[ind].size();i++)
      |                 ~^~~~~~~~~~~~~~
#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...