제출 #330232

#제출 시각아이디문제언어결과실행 시간메모리
330232egas자매 도시 (APIO20_swap)C++14
0 / 100
469 ms40272 KiB
#include <bits/stdc++.h>
using namespace std;

map<int,set<int>> adj;
map<pair<int,int>,int> edwt;
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++){
		int x=U[i];
		int y=V[i];
		int z=W[i];
		adj[x].insert(y);
		adj[y].insert(x);
		edwt[{x,y}]=z;
		edwt[{y,x}]=z;
	}
}

int getMinimumFuelCapacity(int X, int 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...