제출 #405923

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405923		amunduzbaev	자매 도시 (APIO20_swap)	C++14	0 / 100	153 ms	11984 KiB

swap

#include "swap.h"
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define int long long

const int NN = 1e5+5;
int res;
vector<pair<int, int>> edges[NN];

void init(int32_t N, int32_t M,
	vector<int32_t> U, vector<int32_t> V, vector<int32_t> W) {
	//cout<<"\n";
	int sum = 0, mx = 0;
	for(int i=0;i<M;i++){
		edges[U[i]].pb({V[i], W[i]});
		edges[V[i]].pb({U[i], W[i]});
		sum += W[i], mx = max(mx, (int)W[i]);
	}
	
	if(N == M) res = max(sum - mx, mx);
	else res = -1;
}

/*

5 5
1 0 1
2 1 2
3 2 3
4 3 4
4 0 5
5
0 1
1 2
2 3
3 4
4 0

*/

int32_t getMinimumFuelCapacity(int32_t x, int32_t y) {
	return res;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27