# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
414922 | Pro_ktmr | Airline Route Map (JOI18_airline) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include"bits/stdc++.h"
#include"Alice.h"
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
typedef long long ll;
const ll MOD = (ll)(1e9+7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
int dx[4]={ 1,0,-1,0 };
int dy[4]={ 0,1,0,-1 };
// void InitG(int V, int U)
// void MakeG(int pos, int C, int D)
void Alice(int N, int M, int A[], int B[]){
vector<pair<int,int>> ret;
rep(i, M) ret.pb({ A[i], B[i] });
rep(i, N){
rep(j, 10){
if((i>>j)&1) ret.pb({i, N+j});
}
}
rep(i, 10) ret.pb({ N+10, N+i });
rep(i, 9) ret.pb({ N+i, N+1+i });
rep(i, N+10){