# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224741 | Minnakhmetov | Building 4 (JOI20_building4) | C++14 | 356 ms | 44268 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 ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 1e6 + 5;
pair<int, int> dp[N][2];
int a[N][2];
int n;
pair<int, int> mrg(pair<int, int> a, pair<int, int> b) {
if (a.first > a.second)
return b;
if (b.first > b.second)
return a;
return {min(a.first, b.first), max(a.second, b.second)};
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int j = 0; j < 2; j++) {
for (int i = 0; i < n + n; i++) {
cin >> a[i][j];
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |