제출 #802732

#제출 시각아이디문제언어결과실행 시간메모리
802732radaiosm7Swapping Cities (APIO20_swap)C++11
0 / 100
71 ms5700 KiB
#include "swap.h" #include <bits/stdc++.h> using namespace std; int i, n; bool visited[100005]; int we[100005]; pair<int, int> tw[100005]; bool cycle; void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) { n = N; for (i=0; i < M; ++i) tw[i] = make_pair(W[i], V[i]); sort(tw, tw+M); for (i=0; i < M; ++i) we[V[i]] = W[i]; } int getMinimumFuelCapacity(int X, int Y) { if (X == 0 || Y == 0 || n == 3) return -1; else for (i=0; i < 3; ++i) if (tw[i].second != X && tw[i].second != Y) return min({we[X], we[Y], tw[i].first}); }

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

swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.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...
#Verdict Execution timeMemoryGrader output
Fetching results...