제출 #569753

#제출 시각아이디문제언어결과실행 시간메모리
569753sumit_kk10Swapping Cities (APIO20_swap)C++17
6 / 100
155 ms32440 KiB
#include "swap.h"
#include<bits/stdc++.h>
#include <vector>
#define pb push_back
using namespace std;
const int N = 1e6 + 5;
vector<pair<int, int> > g[N];
int mx, n, m;


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){
		int u = U[i], v = V[i], w = W[i];
		g[u].pb({v, w});
		g[v].pb({u, w});
		mx = max(mx, w);
	}
}

int getMinimumFuelCapacity(int X, int Y) {
	if(m == n - 1)
		return -1;
	else
		return mx;
}
#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...