제출 #413196

#제출 시각아이디문제언어결과실행 시간메모리
413196losmi247Stations (IOI20_stations)C++14
0 / 100
1125 ms528 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1005;

int deg[N];




vector <int> label(int n,int k,vector <int> u,vector <int> v){
    bool prvi = 1;
    for(int i = 0; i < n-1; i++) deg[u[i]]++, deg[v[i]]++;
    for(int i = 0; i < n; i++) if(deg[i] > 2) prvi = 0;
    if(prvi){
        vector <int> l(n);
        for(int i = 0; i < n; i++) l[i] = i;
        return l;
    }
}

int find_next_station(int s,int t,vector <int> c){
    if(s < t){
        return s+1;
    }
    else{
        return s-1;
    }
}

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

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^
#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...