# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
470138 | dantoh000 | Airline Route Map (JOI18_airline) | C++14 | 911 ms | 29500 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>
using namespace std;
typedef pair<int,int> ii;
int d2[1025];
void Alice( int N, int M, int A[], int B[] ){
vector<ii> E;
for (int i = 0; i < M; i++){
E.push_back({A[i],B[i]});
}
for (int i = 0; i < 10; i++){
for (int j = 0; j < N; j++){
if ((j>>(i))&1) E.push_back({j,N+i+1});
}
if (i!=9) E.push_back({N+i+1,N+i+2});
E.push_back({N+i+1, N+11});
}
for (int i = 0; i <= N+10; i++){
if (i != N) E.push_back({i,N});
}
for (auto v: E){
//printf("%d %d\n",v.first,v.second);
}
InitG( N+12, E.size() );
for (int i = 0; i < (int)E.size(); i++){
MakeG(i, E[i].first, E[i].second);
d2[E[i].first]++;
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... |