Submission #979506

#	Time	Username	Problem	Language	Result	Execution time	Memory
979506		ducksaysquack	Swapping Cities (APIO20_swap)	C++17	7 / 100	85 ms	7508 KiB

swap

//#include "swap.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
using namespace std;
int n, m;
vector<pair<int,pair<int,int>>> e;
vector<int> to(1e5+5);
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
	n = N, m = M;
	for(int i=0;i<m;i++) {e.pb({W[i],{U[i],V[i]}}); to[V[i]] = W[i];}
	sort(begin(e),end(e));
}
int getMinimumFuelCapacity(int x, int y) {
	if(n <= 3) return -1;
	if(x > y) swap(x,y);
	if(x == 0) {
		int cnt = 0, mx = to[y];
		for(int i=0;i<m;i++) if(e[i].s.s != y) {
			cnt++, mx = max(mx, e[i].f);
			if(cnt >= 2) return mx;
		}
	}
	else for(int i=0;i<m;i++) if(e[i].s.s != x && e[i].s.s != y) return max({to[x], to[y], e[i].f});
}

Compilation message (stderr)

swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:26:1: warning: control reaches end of non-void function [-Wreturn-type]
   26 | }
      | ^

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