# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679537 | keta_tsimakuridze | Two Dishes (JOI19_dishes) | C++14 | 8328 ms | 282712 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 f first
#define s second
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18; // !
int lazy[4 * N][2], a[N][2], c[N][2], s[N][2], n[2];
vector<pii> x[N];
int t[4 * N];
int merge(int x, int y) {
return max(x, y);
}
void push(int u, int l, int r) {
if(lazy[u][0] != -inf) {
t[u] = lazy[u][0];
if(l < r) {
lazy[2 * u][1] = lazy[2 * u + 1][1] = 0;
lazy[2 * u][0] = lazy[2 * u + 1][0] = lazy[u][0];
}
lazy[u][0] = -inf;
}
if(lazy[u][1] != 0) {
t[u] += lazy[u][1];
if(l < r) {
lazy[2 * u][1] += lazy[u][1];
lazy[2 * u + 1][1] += lazy[u][1];
}
lazy[u][1] = 0;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |