# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701941 | coding_snorlax | Swapping Cities (APIO20_swap) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#include "swap.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
vector<pair<int,int>> G[100002];
vector<int> process[100002];
vector<int> pass;
int vis[100002]={0};
int N,Start,End;
int dfs(int node){
vis[node]=1;
pass.pb()
for(int i:G[node]){
if(!vis[i]) dfs(i);
}
}
int Check(int C){
for(int i=0;i<N;i++){
for(auto j:G[i]){
if(j.second<=C){
process[i].push_back(j.first);
process[j.first].push_back(i);
}
}
}
}
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
N = num;
for(int i=0;i<M;i++){
G[U[i]].pb(mp(V[i],W[i]));
G[V[i]].pb(mp(U[i],W[i]));
}
}
int getMinimumFuelCapacity(int X, int Y) {
return 0;
}