# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313399 | arthur_nascimento | Airline Route Map (JOI18_airline) | C++14 | 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 "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
#define maxn 110
#define maxK 4100
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mod 1000000007
#define debug(args...) //fprintf(stderr,args)
using namespace std;
void Alice( int N, int M, int A[], int B[] ){
vector<pii> v;
for(int i=0;i<M;i++)
v.pb({A[i],B[i]});
for(int i=0;i<10;i++)
for(int j=0;j<N;j++)
if(j & (1<<i))
v.pb({i+N,j});
for(int i=0;i<N+10;i++){
if(i < N){
v.pb({10+N,i});
v.pb({11+N,i});
}
else if (i == N);
else if(i < N + 5)
v.pb({10+N,i});
else
v.pb({11+N,i});
}
for(int i=0;i<9;i++)
v.pb({i+N,i+N+1});
InitG(N+12,v.size());
int bla = 0;
for(pii i : v)
MakeG(bla++, i.first,i.second);
}