제출 #1165611

#제출 시각아이디문제언어결과실행 시간메모리
1165611SmuggingSpun자매 도시 (APIO20_swap)C++20
0 / 100
2 ms2628 KiB
#include<bits/stdc++.h> #include "swap.h" using namespace std; const int lim = 1e5 + 5; bool is_sub2 = false; int n, m, u[lim], v[lim], w[lim]; vector<int>g[lim]; void init(int N, int M, vector<int>U, vector<int>V, vector<int>W){ n = N; m = M; for(int i = 0; i < m; i++){ g[u[i] = U[i]].emplace_back(i); g[v[i] = V[i]].emplace_back(i); W[i] = W[i]; } if(is_sub2 = (*max_element(u, u + m) == 0 && m == n - 1)){ return; } } int getMinimumFuelCapacity(int x, int y){ if(is_sub2){ return x == 0 || y == 0 ? -1 : max(w[g[x][0]], w[g[y][0]]); } }

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

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