Submission #404979

#	Time	Username	Problem	Language	Result	Execution time	Memory
404979		LastRonin	Swapping Cities (APIO20_swap)	C++14	0 / 100	1 ms	204 KiB

swap

#include <bits/stdc++.h>
#include "swap.h"
#define pb push_back
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define si short int
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pill pair<ll,ll>
#define f first
#define s second
#define pilc pair<ll,char>
#define all(a) (a).begin(),(a).end()
#define rep(s,e,step) for(int i = (s); i < (e) ; i += step)
#define vrep(s,e,step) for(int j = (s); j < (e) ; j += step)
#define ex exit(0) 
#define sz(a) (ll)(a).size()
#define triple pair<pill, ll>
#define pinode pair<node*, node*>
#define quadra pair<pill, pill>
#define ld long double
using namespace std;
 
const ll N = 1e6 + 10;
const ll M = 1e14;
const ll big = 1e14;
const ll hsh2 = 1964325029 ;
const long long mod = 1e9 + 7;
const long double EPS = 1e-20;
const ll block = 500;
const ll shift = 2e3;
const ld pi = acos(-1.0);
 
void init(int N, int M, vector<int> u, vector<int> v, vector<int> w) {
    /*if(m == n - 1) {
        kek = 1;
    	return;
    }
	vector<pair<ll, pill>> q;
	for(int i = 1; i <= m; i++) 
		q.pb(mp(w[i - 1], mp(u[i - 1], v[i - 1])));		
	sort(all(q));
	for(auto u : q) {
		ng[u.s.f].pb(mp(u.f, u.s.s));
		unt(u.s.f, u.s.s, u.f);
	}
	dfs(1);*/
}
 
int getMinimumFuelCapacity(int X, int Y) {
	/*if(kek) {
		return -1;	
   }*/
	return 0;
}
 
/*                  
4
4 6 1 9
2 5 3 2 
*/

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