oj.uz

답안 #550582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550582 2022-04-18T15:14:22 Z jeroenodb Two Antennas (JOI19_antennas) C++14
100 / 100
 460 ms 40148 KB 
#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5+1, oo = 1e9;
vi H;
struct segtree {
    struct node {
        // what do I need?

        int mxans=-1;
        array<int,2> h = {oo,-oo}, lazy = {oo,-oo};
        node() {}
    };
    vector<node> seg;
    int n,ptwo;
    segtree(int nn) {
        n=nn,ptwo=1;
        while(ptwo<n) ptwo*=2;
        seg.resize(2*ptwo);
    }
    void puttag(int i, array<int,2> lazy) {
        auto& v = seg[i];
        v.mxans = max({v.mxans,lazy[1]-v.h[0],v.h[1]-lazy[0]});
        v.lazy[0] = min(v.lazy[0],lazy[0]);
        v.lazy[1] = max(v.lazy[1],lazy[1]);
    }
    void pull(int i) {
        auto& v = seg[i], &l = seg[i*2], &r = seg[i*2+1];
        v.mxans = max(l.mxans,r.mxans);
        v.h[0] = min(l.h[0],r.h[0]);
        v.h[1] = max(l.h[1],r.h[1]);
    }
    void push(int i) { // TODO!
        auto& v = seg[i];
        puttag(i*2,v.lazy);
        puttag(i*2+1,v.lazy);
        v.lazy = {oo,-oo};
    }
    int get(int i, int l, int r, int ql, int qr) {
        if(qr<l or r<ql) return -1;
        if(ql<=l and r<=qr) {
            return seg[i].mxans;
        }
        int mid = (l+r)/2;
        push(i);
        auto res = max(get(i*2,l,mid,ql,qr),get(i*2+1,mid+1,r,ql,qr)); // TODO
        pull(i);
        return res;
    }
    void set(int i, int l, int r, int ql, int qr, int v) {
        if(qr<l or r<ql) return;
        if(ql<=l and r<=qr) {
            puttag(i,{v,v}); // correct?
            return;
        }
        int mid = (l+r)/2;
        push(i);
        set(i*2,l,mid,ql,qr,v),set(i*2+1,mid+1,r,ql,qr,v);
        pull(i);
    }
    void set2(int i, int l, int r, int q) {
        if(q<l or r<q) return;
        if(l==q and r==q) {
            if(seg[i].h[0]==oo) seg[i].h = {H[l],H[l]};
            else seg[i].h = {oo,-oo};
            return;
        }
        int mid = (l+r)/2;
        push(i);
        set2(i*2,l,mid,q),set2(i*2+1,mid+1,r,q);
        pull(i);
    }
    void set(int l, int r, ll v) {
        set(1,0,ptwo-1,l,r,v);
    }
    void set2(int i) {
        set2(1,0,ptwo-1,i);
    }
    int get(int l, int r) {
        return get(1,0,ptwo-1,l,r);
    }
    node& operator[](int i) {return seg[i+ptwo];}
    void build() {
        for(int i=ptwo-1;i>=1;--i) {
            pull(i);
        }
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n; cin >> n;
    H.resize(n);
    vi a(n),b(n);
    for(int i=0;i<n;++i) {
        cin >> H[i] >> a[i] >> b[i];
    }
    vvi activations(n+1);
    for(int i=0;i<n;++i) {
        activations[min(n,i+a[i])].push_back(i);
        activations[min(n,i+b[i]+1)].push_back(i);
    }
    int Q; cin >> Q;
    vector<array<int,2>> qs(Q);
    vvi ids(n);
    {int id=0;
    for(auto& [l,ans] : qs) {
        int r; cin >> l >> r;
        --l,--r;
        ids[r].push_back(id++);
    }
    }
    segtree seg(n);
    seg.build();
    for(int j=0;j<n;++j) {
        int l = max(0,j-b[j]), r = max(-1,j-a[j]);
        for(auto i : activations[j]) 
            seg.set2(i);
        if(r>=0) {
            seg.set(l,r,H[j]);
        }
        for(int id : ids[j]) {
            int lb = qs[id][0];
            qs[id][1] = seg.get(lb,j);
        }
    }
    for(auto [l,ans] : qs) {
        cout << ans << '\n';
    }
    
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:115:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  115 |     for(auto& [l,ans] : qs) {
      |               ^
antennas.cpp:135:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  135 |     for(auto [l,ans] : qs) {
      |              ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 324 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 79 ms 4824 KB Output is correct
26 Correct 11 ms 980 KB Output is correct
27 Correct 119 ms 6848 KB Output is correct
28 Correct 128 ms 6980 KB Output is correct
29 Correct 75 ms 4848 KB Output is correct
30 Correct 74 ms 4824 KB Output is correct
31 Correct 85 ms 6140 KB Output is correct
32 Correct 122 ms 6980 KB Output is correct
33 Correct 106 ms 6492 KB Output is correct
34 Correct 54 ms 3544 KB Output is correct
35 Correct 111 ms 6864 KB Output is correct
36 Correct 117 ms 6928 KB Output is correct
37 Correct 66 ms 3624 KB Output is correct
38 Correct 115 ms 5968 KB Output is correct
39 Correct 17 ms 1252 KB Output is correct
40 Correct 108 ms 5900 KB Output is correct
41 Correct 84 ms 4428 KB Output is correct
42 Correct 112 ms 5980 KB Output is correct
43 Correct 37 ms 2324 KB Output is correct
44 Correct 112 ms 5888 KB Output is correct
45 Correct 21 ms 1408 KB Output is correct
46 Correct 110 ms 5980 KB Output is correct
47 Correct 29 ms 1908 KB Output is correct
48 Correct 109 ms 5996 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 28608 KB Output is correct
2 Correct 245 ms 30680 KB Output is correct
3 Correct 149 ms 24768 KB Output is correct
4 Correct 208 ms 30776 KB Output is correct
5 Correct 88 ms 14660 KB Output is correct
6 Correct 238 ms 30812 KB Output is correct
7 Correct 184 ms 27944 KB Output is correct
8 Correct 212 ms 30772 KB Output is correct
9 Correct 26 ms 4688 KB Output is correct
10 Correct 216 ms 30768 KB Output is correct
11 Correct 128 ms 17904 KB Output is correct
12 Correct 210 ms 30764 KB Output is correct
13 Correct 188 ms 28732 KB Output is correct
14 Correct 178 ms 28636 KB Output is correct
15 Correct 168 ms 28632 KB Output is correct
16 Correct 171 ms 29016 KB Output is correct
17 Correct 183 ms 29000 KB Output is correct
18 Correct 179 ms 29012 KB Output is correct
19 Correct 186 ms 28736 KB Output is correct
20 Correct 176 ms 28704 KB Output is correct
21 Correct 161 ms 28508 KB Output is correct
22 Correct 177 ms 28752 KB Output is correct
23 Correct 173 ms 28756 KB Output is correct
24 Correct 168 ms 28768 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 79 ms 4824 KB Output is correct
26 Correct 11 ms 980 KB Output is correct
27 Correct 119 ms 6848 KB Output is correct
28 Correct 128 ms 6980 KB Output is correct
29 Correct 75 ms 4848 KB Output is correct
30 Correct 74 ms 4824 KB Output is correct
31 Correct 85 ms 6140 KB Output is correct
32 Correct 122 ms 6980 KB Output is correct
33 Correct 106 ms 6492 KB Output is correct
34 Correct 54 ms 3544 KB Output is correct
35 Correct 111 ms 6864 KB Output is correct
36 Correct 117 ms 6928 KB Output is correct
37 Correct 66 ms 3624 KB Output is correct
38 Correct 115 ms 5968 KB Output is correct
39 Correct 17 ms 1252 KB Output is correct
40 Correct 108 ms 5900 KB Output is correct
41 Correct 84 ms 4428 KB Output is correct
42 Correct 112 ms 5980 KB Output is correct
43 Correct 37 ms 2324 KB Output is correct
44 Correct 112 ms 5888 KB Output is correct
45 Correct 21 ms 1408 KB Output is correct
46 Correct 110 ms 5980 KB Output is correct
47 Correct 29 ms 1908 KB Output is correct
48 Correct 109 ms 5996 KB Output is correct
49 Correct 197 ms 28608 KB Output is correct
50 Correct 245 ms 30680 KB Output is correct
51 Correct 149 ms 24768 KB Output is correct
52 Correct 208 ms 30776 KB Output is correct
53 Correct 88 ms 14660 KB Output is correct
54 Correct 238 ms 30812 KB Output is correct
55 Correct 184 ms 27944 KB Output is correct
56 Correct 212 ms 30772 KB Output is correct
57 Correct 26 ms 4688 KB Output is correct
58 Correct 216 ms 30768 KB Output is correct
59 Correct 128 ms 17904 KB Output is correct
60 Correct 210 ms 30764 KB Output is correct
61 Correct 188 ms 28732 KB Output is correct
62 Correct 178 ms 28636 KB Output is correct
63 Correct 168 ms 28632 KB Output is correct
64 Correct 171 ms 29016 KB Output is correct
65 Correct 183 ms 29000 KB Output is correct
66 Correct 179 ms 29012 KB Output is correct
67 Correct 186 ms 28736 KB Output is correct
68 Correct 176 ms 28704 KB Output is correct
69 Correct 161 ms 28508 KB Output is correct
70 Correct 177 ms 28752 KB Output is correct
71 Correct 173 ms 28756 KB Output is correct
72 Correct 168 ms 28768 KB Output is correct
73 Correct 348 ms 35840 KB Output is correct
74 Correct 227 ms 31584 KB Output is correct
75 Correct 353 ms 33568 KB Output is correct
76 Correct 450 ms 40104 KB Output is correct
77 Correct 223 ms 20904 KB Output is correct
78 Correct 370 ms 37388 KB Output is correct
79 Correct 415 ms 37168 KB Output is correct
80 Correct 455 ms 40132 KB Output is correct
81 Correct 185 ms 11888 KB Output is correct
82 Correct 358 ms 35816 KB Output is correct
83 Correct 353 ms 26620 KB Output is correct
84 Correct 460 ms 40148 KB Output is correct
85 Correct 333 ms 33720 KB Output is correct
86 Correct 400 ms 36824 KB Output is correct
87 Correct 208 ms 30148 KB Output is correct
88 Correct 428 ms 37372 KB Output is correct
89 Correct 362 ms 35128 KB Output is correct
90 Correct 406 ms 37184 KB Output is correct
91 Correct 273 ms 31624 KB Output is correct
92 Correct 383 ms 36760 KB Output is correct
93 Correct 219 ms 30156 KB Output is correct
94 Correct 395 ms 36940 KB Output is correct
95 Correct 247 ms 31040 KB Output is correct
96 Correct 380 ms 36856 KB Output is correct