| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 62966 | kingpig9 | Airline Route Map (JOI18_airline) | C++11 | 626 ms | 30408 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 <bits/stdc++.h>
#include "Alicelib.h"
using namespace std;
static bool exist1[1010];
void Alice (int N, int M, int A[], int B[]) {
vector<pair<int, int>> edges;
for (int i = 0; i < M; i++) {
if (A[i] > B[i]) {
swap(A[i], B[i]);
}
exist1[A[i]] |= (B[i] == A[i] + 1);
edges.push_back({A[i], B[i]});
}
for (int i = 0; i < N - 1; i++) {
if (!exist1[i]) {
edges.push_back({i, i + 1});
edges.push_back({i, N});
}
}
edges.push_back({N - 1, N});
InitG(N + 1, edges.size());
for (int i = 0; i < edges.size(); i++) {
MakeG(i, edges[i].first, edges[i].second);
}
}
#include <bits/stdc++.h>
#include "Boblib.h"
using namespace std;
static vector<int> adj[1010];
static int indeg[1010];
static int ind[1010];
void Bob (int N, int M, int C[], int D[]) {
}
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... | ||||
