# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
957186 | Vladth11 | Overtaking (IOI23_overtaking) | C++17 | 3256 ms | 1013904 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>
#pragma GCC target("avx2")
#include "overtaking.h"
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const int NMAX = 31000001;
const ll INF = 1e18;
const pii NEUTRU = {0, 0};
struct Node {
/// max(x + a, b)
int st, dr;
ll maxi; /// basically asta e valoarea lui f(dr)
pii lazy;
ll eval(ll x) {
return max(x + lazy.first, lazy.second);
}
};
Node aint[NMAX];
int cnt;
pii combine(pii nou, pii a) {
return {a.first + nou.first, max(a.second + nou.first, nou.second)};
}
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... |