# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
404968 | 2021-05-15T12:23:43 Z | LastRonin | Swapping Cities (APIO20_swap) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.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); bool kek = 0; void init(ll n, ll m, vector<ll> u, vector<ll> v, vector<ll> w) { if(m == n - 1) { kek = 1; return; } } int getMinimumFuelCapacity(int X, int Y) { if(kek) { return -1; } return 0; } /* 4 4 6 1 9 2 5 3 2 */