Submission #409848

#TimeUsernameProblemLanguageResultExecution timeMemory
409848fadi57Swapping Cities (APIO20_swap)C++14
6 / 100
161 ms15028 KiB
#include "swap.h" //#include "grader.cpp" #include<bits/stdc++.h> using namespace std; const int mx=2e5+10; typedef long long ll; int inf=1e9+10; const int mod=1e9+7; vector<int>adj[mx]; int ans=-1; 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++){ adj[U[i]].push_back(V[i]); adj[V[i]].push_back(U[i]); } for(auto it:W){ ans=max(ans,it); } for(int i=0;i<n;i++){ if(adj[i].size()!=2){ ans=-1; } } } int getMinimumFuelCapacity(int X, int Y) { return ans; }
#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...