# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383335 | fishy15 | Airline Route Map (JOI18_airline) | C++17 | 910 ms | 29768 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 <array>
#include <numeric>
#include <vector>
using namespace std;
void Alice(int N, int M, int A[], int B[]) {
if (N == 1) {
InitG(1, 0);
return;
}
if (N == 2) {
if (M == 0) {
InitG(2, M);
} else {
InitG(2, 1);
MakeG(0, 0, 1);
}
return;
}
int all = 0;
int mark = N + 1;
vector<int> bit(10);
iota(bit.begin(), bit.end(), N + 2);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |