# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1032558 | juicy | Building 4 (JOI20_building4) | C++17 | 1 ms | 604 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;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
array<int, 2> operator + (const array<int, 2> &a, int x) {
return {a[0] + x, a[1] + x};
}
array<int, 2> mrg(const array<int, 2> <, const array<int, 2> &rt) {
return {min(lt[0], rt[0]), max(rt[0], rt[1])};
}
bool inside(const array<int, 2> &a, int i) {
return a[0] <= i && i <= a[1];
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
const int inf = 1e9;
int N; cin >> N;
vector<int> a(2 * N), b(2 * N);
for (int &x : a) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |