| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 140759 | WannnabeIOI | Bridges (APIO19_bridges) | C++14 | 49 ms | 6020 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>
#define fr first
#define sc second
#define mp make_pair
using namespace std;
typedef long long ll;
const ll llinf = 1e18;
const int maxn = 4e6 + 100, inf = 1e9 + 100;
pair<pair<ll, bool>, ll> mas[2 * maxn];
pair<ll, ll> arr[maxn];
pair<ll, ll> seg[maxn];
bool arr_all;
int szmas, szarr, szseg, szind;
ll y;
ll ind[maxn];
int val[maxn];
bool good[maxn];
| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||