Submission #394743

#	Time	Username	Problem	Language	Result	Execution time	Memory
394743		suren	Swapping Cities (APIO20_swap)	C++14	0 / 100	2069 ms	28288 KiB

swap

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
int n, m;
vector < int > u, v, w;
vector < int > vc[200045];
map < pair < int , int >, int > mp;
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
		int i;
		n = N;
		m = M;
		u = U;
		v = V;
		w = W;
		for( i = 0; i < m; i ++ ){
			vc[ u[i] ].pb( v[i] );
			vc[ v[i] ].pb( u[i] );
			mp[ mk( u[i], v[i] ) ] = w[i];
			mp[ mk( v[i], u[i] ) ] = w[i];
		}
}
bool vis[200045];
int getMinimumFuelCapacity(int X, int Y) {
	int flag = true, i;
	for( i = 0; i < n; i ++ ){
		if( vc[i].size() != 2 ){
			flag = false;
			break;
		}
	}
	if( flag == true ){
		int ans = 0;
		for( i = 0; i < m; i ++ ){
			ans = max( ans, w[i] );
		}
		return ans;
	}
	
	return -1;
}

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