Submission #996348

#	Time	Username	Problem	Language	Result	Execution time	Memory
996348		Dan4Life	Swapping Cities (APIO20_swap)	C++17	6 / 100	75 ms	10684 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#define all(a) begin(a),end(a)

const int mxN = (int)3e5+10;
bool line = false;
int deg[mxN], ans;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
	fill(deg,deg+N,0);
	for(int i = 0; i < M; i++) 
		deg[U[i]]++, deg[V[i]]++;
	line = (*min_element(deg,deg+N)==1);
	ans = *max_element(all(W));
}

int getMinimumFuelCapacity(int X, int Y) {
	if(line) return -1;
	return ans;
}

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