| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 312915 | quocnguyen1012 | Building 4 (JOI20_building4) | C++14 | 0 ms | 384 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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
template<class T>
bool chkmin(T & x, T val) {
if (x > val) {
x = val;
return true;
}
return false;
}
const int maxn = 1e6 + 5;
int a[maxn][2], N;
pair<ll, int> f[maxn][2];
int trace[maxn][2];
pair<ll, int> calc(int cost) {
for (int i = 1; i <= 2 * N; ++i) {
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||