Submission #1130177

#TimeUsernameProblemLanguageResultExecution timeMemory
1130177ByeWorldSwapping Cities (APIO20_swap)C++20
0 / 100
94 ms10332 KiB
#include "swap.h" #include <bits/stdc++.h> #pragma GCC optimize("O3") #define ll long long #define pb push_back #define fi first #define se second #define lf (id<<1) #define rg ((id<<1)|1) #define md ((l+r)>>1) using namespace std; typedef pair<int,int> pii; typedef pair<int,pii> ipii; const int MAXN = 1e5+15; const int INF = 1e9+10; const int LOG = 19; const int MOD = 1e9+7; int n, m; vector <pii> adj[MAXN]; void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) { n = N; m = M; for(int i=0; i<m; i++){ adj[U[i]+1].pb({V[i]+1, W[i]}); adj[V[i]+1].pb({U[i]+1, W[i]}); } } int getMinimumFuelCapacity(int X, int Y) { X++; Y++; 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...