# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
424895 | Mamnoon_Siam | Two Antennas (JOI19_antennas) | C++17 | 3080 ms | 16620 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.
// https://codeforces.com/blog/entry/66022?#comment-500622
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
#define sz(v) (int)(v).size()
#define fi first
#define se second
const int inf = 1e9 + 9;
struct Node {
vector<int> c, d;
Node(int _, int n) {
c.assign(n, -inf);
d.assign(n, -inf);
}
void update_ci(int pos, int val) {
c[pos-1] = val;
}
void update_di(int L, int R, int val) {
for(int i = L-1; i < R; ++i) {
d[i] = max(d[i], c[i] + val);
}
}
int get_max_di(int L, int R) {
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... |