# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
635977 | Arinoor | Olympic Bus (JOI20_ho_t4) | C++17 | 320 ms | 3704 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>
using namespace std;
#define ios ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define bug(x) cout << #x << " : " << x << '\n'
#define bug2(x, y) cout << #x << ' ' << #y << " : " << x << ' ' << y << '\n'
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 2e2 + 10;
const int maxm = 5e4 + 10;
const int mod = 1e9 + 7;
const int inf = 2e9 + 10;
int n, m;
int u[maxm], v[maxm], c[maxm], f[maxm];
int d[2][2][maxn][maxn];
int par[2][2][maxn];
bool mark[maxn];
vector<int> G[maxn][2];
int ant(int e, int v){
return ::v[e] + ::u[e] - v;
}
# | 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... |