# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
207186 | nvmdava | Airline Route Map (JOI18_airline) | C++17 | 1682 ms | 69044 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 ff first
#define ss second
vector<pair<int, int> > e;
void Alice( int N, int M, int A[], int B[] ){
for(int i = 0; i < M; ++i)
e.push_back({A[i], B[i]});
for(int j = 0; j < 10; ++j)
for(int i = 0; i < N; ++i)
if(i & (1 << j))
e.push_back({N + j, i});
for(int i = 1; i <= 9; ++i){
for(int j = i + 1; j <= 9; ++j){
if(i + j >= 10){
e.push_back({N + i, N + j});
}
}
}
e.push_back({N + 0, N + 5});
for(int i = 0; i < N + 10; ++i)
e.push_back({N + 10, i});
for(int i = 0; i < 10; ++i)
e.push_back({N + 11, N + i});
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... |