# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
374086 | i_am_noob | Airline Route Map (JOI18_airline) | C++17 | 891 ms | 29804 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 <bits/stdc++.h>
using namespace std;
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
#define inf 1010000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
void Alice( int n, int m, int a[], int b[] ){
//InitG( 3, 2 );
//MakeG( 1, 2 );
//MakeG( 1, 3 );
vector<pii> edges;
rep(m) edges.pb({a[i],b[i]});
rep(n) rep1(j,10) if(i&pow2(j)) edges.pb({i,n+j});
rep(9) edges.pb({n+i,n+i+1});
rep(n) edges.pb({i,n+10});
rep(10) edges.pb({n+i,n+10}),edges.pb({n+i,n+11});
InitG(n+12,sz(edges));
rep(sz(edges)) MakeG(i,edges[i].first,edges[i].second);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |