# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976578 | LinkedArray | Building 4 (JOI20_building4) | C++17 | 180 ms | 57160 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;
using ll = long long;
#define pb push_back
const int MAX_N = 1e6;
const int INF = 1e9;
int val[2][2 * MAX_N + 5];
int st_min[2][2 * MAX_N + 5], dr_max[2][2 * MAX_N + 5];
/* 0 -> a[ ]; 1 -> b[ ] */
int main () {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, i, j, k, prev_val, num_a, num_b;
string ans;
cin >> n;
for (i = 1; i <= 2 * n; i++) {
cin >> val[0][i];
}
for (i = 1; i <= 2 * n; i++) {
cin >> val[1][i];
}
for (i = 1; i <= 2 * n; i++) {
/* iau variante */
for (j = 0; j < 2; j++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |