제출 #1164658

#제출 시각아이디문제언어결과실행 시간메모리
1164658just자매 도시 (APIO20_swap)C++20
6 / 100
71 ms12460 KiB
#include "bits/stdc++.h" using namespace std; #define vec vector int N, M; vec<int> U, V, W; vec<vec<int>> adj; int ans = 0; void init(int n, int m, vec<int> u, vec<int> v, vec<int> w) { N = n; M = m; U = u; V = v; W = w; assert(U.size() == M); assert(V.size() == M); assert(W.size() == M); adj.resize(N); for (int i = 0; i < M; i++) { adj[U[i]].push_back(V[i]); adj[V[i]].push_back(U[i]); } for (auto x: adj) { if (x.size() == 1) { ans = -1; return; } } for (auto x: W) { ans = max(ans, x); } } int getMinimumFuelCapacity(int X, int Y) { return ans; } #ifdef debug signed main() {} #endif
#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...