# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
684956 | ethening | Olympic Bus (JOI20_ho_t4) | C++17 | 776 ms | 3456 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 <functional>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MAXN = 200;
const int MAXM = 50000;
const ll INF = 1000'000'000'000'000ll;
int n, m;
struct edge {
int fr, to;
ll wcost;
ll scost;
bool crit;
};
edge E[MAXM + 5];
// vector<int> v[MAXN + 5], v2[MAXN + 5];
vector<vector<int>> adj;
vector<vector<int>> adj2;
int get_edge(int a, int b, int swapEg) {
int ret = -1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |