Submission #1201546

#TimeUsernameProblemLanguageResultExecution timeMemory
1201546mr_junkSwapping Cities (APIO20_swap)C++17
0 / 100
11 ms23876 KiB
#include "swap.h" #include <bits/stdc++.h> using namespace std; int const N=1e6; vector<pair<int,int>> g[N]; int used[N]; int mx,check; void dfs(int v){ if (check){ return; } used[v]=1; for(auto it : g[v]){ if (used[it.first]==1){ check=true; }else{ dfs(it.first); } }used[v]=2; } void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) { for(int i=0;i<M;i++){ g[U[i]].push_back({V[i],W[i]}); g[V[i]].push_back({U[i],W[i]}); mx=max(mx,W[i]); }dfs(1); }int getMinimumFuelCapacity(int X, int Y) { if (check)return mx; return -1; }
#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...