# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
622878 | 2022-08-04T17:39:18 Z | CSQ31 | Airline Route Map (JOI18_airline) | C++17 | 0 ms | 0 KB |
#include "Alicelib.h" #include <cassert> #include <cstdio> #include <bits/stdc++.h> using namespace std; #define sz(a) (int)(a.size()) #define pb push_back void Alice( int n, int m, int A[], int B[] ){ vector<array<int,2>>edge; for(int i=0;i<m;i++){ edge.push_back({A[i],B[i]}); } for(int i=0;i<n;i++){ for(int j=0;j<10;j++){ if(i&(1<<j)){ edge.push_back({i,j+n}); } } } for(int j=0;j+1<10;j++)edge.push_back({j+n,j+n+1}); for(int j=0;j<10;j++){ edge.push_back({n+10,j+n}); edge.push_back({n+11,j+n}); } InitG(n+12,sz(edge)); //cout<<vert<<" "<<M<<'\n'; int pos = 0; for(auto x:edge)MakeG(pos++,x[0],x[1]); }