Submission #563148

#	Time	Username	Problem	Language	Result	Execution time	Memory
563148		Aktan	Swapping Cities (APIO20_swap)	C++14	0 / 100	88 ms	10200 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;

#ifndef EVAL
#include "grader.cpp"
#endif

vector<int> e[100005];
int used[100005],mx=0;
bool h=0;
void dfs(int x){
	used[x]++;
	if(e[x].size()<2){
		h=1;
		return;
	}
	if(h==1){
		return;
	}
	for(auto w : e[x]){
		if(used[w]==0){
			dfs(w);
		}
	}
}
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W){
	for(int i=0;i<M;i++){
		e[U[i]].push_back(V[i]);
		e[V[i]].push_back(U[i]);
		mx=max(mx,W[i]);
	}
	for(int i=0;i<N;i++){
		if(used[i]==0){
			h=0;
			dfs(i);
		}
	}
}

int getMinimumFuelCapacity(int X, int Y) {
	if(h==1){
		return -1;
	}
	else{
		return mx;
	}
}

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