# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174908 | 12345678 | Radio Towers (IOI22_towers) | C++17 | 225 ms | 8460 KiB |
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=1e5+5;
int n, vl[nx];
vector<int> h={0}, srt;
struct segtree
{
struct node
{
int mx, mn, difl, difr;
node(int mx=0, int mn=1e9, int difl=0, int difr=0): mx(mx), mn(mn), difl(difl), difr(difr){}
} d[4*nx];
node merge(node &l, node &r)
{
node res;
res.mx=max(l.mx, r.mx);
res.mn=min(l.mn, r.mn);
res.difl=max({l.difl, r.difl, r.mx-l.mn});
res.difr=max({l.difr, r.difr, l.mx-r.mn});
return res;
}
void build(int l, int r, int i)
{
if (l==r) return d[i]=node(h[l], h[l]), void();
int md=(l+r)/2;
# | 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... |