| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 943860 | beepbeepsheep | Airline Route Map (JOI18_airline) | C++17 | 531 ms | 47708 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>
#define ll long long
#include <bits/stdc++.h>
using namespace std;
static vector<ll> adj[1012];
void Alice( int N, int M, int A[], int B[] ){
if (N==1){
InitG(1,0);
return;
}
ll cnt=0;
for (int i=0;i<M;i++){
adj[A[i]].emplace_back(B[i]);
cnt++;
}
for (int i=0;i<N;i++){
for (int j=0;j<10;j++){
if (i & (1<<j)){
adj[N+j].emplace_back(i);
cnt++;
}
}
}
cnt+=N+10+10+9;
InitG(N+12,cnt);
for (int i=0;i<N+10;i++){
--cnt;
MakeG(cnt,i,N+10);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||