oj.uz

Submission #210265

# Submission time Handle Problem Language Result Execution time Memory
210265 2020-03-17T00:52:00 Z ToMmyDong Two Antennas (JOI19_antennas) C++11
100 / 100
 998 ms 38312 KB 
#include <bits/stdc++.h>
using namespace std;
//#define int ll
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#define eb emplace_back
#define ALL(i) i.begin(),i.end()
#define X first
#define Y second
#ifdef tmd
#define IOS()
#define debug(...) fprintf(stderr,"#%d: %s = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
template<typename It> ostream& _printRng(ostream &os,It bg,It ed)
{
    os<<"{";
    for(It it=bg;it!=ed;it++) {
        os<<(it==bg?"":",")<<*it;
    }
    os<<"}";
    return os;
}
template<typename T> ostream &operator << (ostream &os,vector<T> &v){return _printRng(os,v.begin(), v.end());}
template<typename T> void pary(T bg, T ed){_printRng(cerr,bg,ed);cerr<<endl;}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(...)
#define pary(...)
#endif

const int MAXN = 200005;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f3f3f3f3f;

int n, q;
int h[MAXN], a[MAXN], b[MAXN];
int ans[MAXN];
vector<pii> qry[MAXN];

int seg[MAXN*4], mn[MAXN*4], tag[MAXN*4];

int get (int o) {
    return seg[o];
}

int getMx (int o) {
    return tag[o];
}


void upd (int o) {
    seg[o] = max(seg[o], tag[o] + mn[o]);
}

void pull (int o) {
    mn[o] = max(mn[o<<1], mn[o<<1|1]);
    seg[o] = max({seg[o], seg[o<<1], seg[o<<1|1]});
    upd(o);
}

void push (int o) {
    if (tag[o] != -INF) {
        tag[o<<1] = max(tag[o<<1], tag[o]);
        tag[o<<1|1] = max(tag[o<<1|1], tag[o]);
        upd(o<<1);
        upd(o<<1|1);
        tag[o] = -INF;
        pull(o);
    }
}

void build () {
    REP (i, MAXN*4) {
        seg[i] = -INF;
        mn[i] = -INF;
        tag[i] = -INF;
    }
}

void segC (int x, int val, int o, int nL, int nR) {
    if (x >= nR || x < nL) {
        return;
    } else if (nL == x && x + 1 == nR) {
        mn[o] = val;
        tag[o] = -INF;
    } else {
        push(o);
        int nM = (nL + nR) >> 1;
        segC(x, val, o<<1, nL, nM);
        segC(x, val, o<<1|1, nM, nR);
        pull(o);
    }
}

void segM (int qL, int qR, int val, int o, int nL, int nR) {
    if (qL >= nR || qR <= nL || qL >= qR) {
        return;
    } else if (qL <= nL && nR <= qR) {
        tag[o] = max(tag[o], val);
        upd(o);
    } else {
        push(o);
        int nM = (nL + nR) >> 1;
        segM(qL, qR, val, o<<1, nL, nM);
        segM(qL, qR, val, o<<1|1, nM, nR);
        pull(o);
    }
}


int segQ (int qL, int qR, int o, int nL, int nR) {
    if (qL >= nR || qR <= nL || qL >= qR) {
        return -INF;
    } else if (qL <= nL && nR <= qR) {
        return get(o);
    } else {
        push(o);
        int nM = (nL + nR) >> 1;
        return max(segQ(qL, qR, o<<1, nL, nM),\
            segQ(qL, qR, o<<1|1, nM, nR));
    }
}


vector<pii> opr[MAXN];
void solve () {
    build();
    for (int i=1; i<=n; i++) {
        opr[i].clear();
    }

    for (int i=1; i<=n; i++) {
        if (i+a[i]<=n) {
            opr[i+a[i]].eb(i, 1);
        }
        if (i+b[i]+1<=n) {
            opr[i+b[i]+1].eb(i, -1);
        }
    }

    for (int i=1; i<=n; i++) {
        debug(i);
        for (auto v : opr[i]) {
            if (v.Y > 0) {
                debug("ADD", v.X, -h[v.X]);
                segC(v.X, -h[v.X], 1, 1, n+1);
            } else {
                debug("RMV", v.X, -h[v.X]);
                segC(v.X, -INF, 1,1,n+1);
            }
        }

        int L = i - b[i];
        int R = i - a[i];

        debug(L, R, h[i]);
        segM(L, R+1, h[i], 1, 1, n+1);
        for (auto p : qry[i]) {
            int res = segQ(p.X, i+1, 1, 1, n+1);
            debug(p.Y, p.X, i, res);
            ans[p.Y] = max(ans[p.Y], segQ(p.X, i+1, 1, 1, n+1));
        }
        debug(mn[1], tag[1], seg[1]);

    }

}
/*********************GoodLuck***********************/
signed main () {
    IOS();

    cin >> n;
    for (int i=1; i<=n; i++) {
        cin >> h[i] >> a[i] >> b[i];
    }
    cin >> q;
    for (int i=0; i<q; i++) {
        int l, r;
        cin >> l >> r;
        qry[r].eb(l, i);
    }

    fill(ans,ans+q, -INF);
    solve();
    for (int i=1; i<=n; i++) {
        h[i] = -h[i];
    }
    solve();


    for (int i=0; i<q; i++) {
        cout << (ans[i] < 0 ? -1 : ans[i]) << endl;
    }
}
/*
6
60 4 4
21 3 3
73 3 3
62 1 2
30 4 4
31 1 4
1
2 5
*/

Compilation message

antennas.cpp:39:17: warning: overflow in implicit constant conversion [-Woverflow]
 const int INF = 0x3f3f3f3f3f3f3f3f;
                 ^~~~~~~~~~~~~~~~~~
antennas.cpp: In function 'void solve()':
antennas.cpp:165:17: warning: unused variable 'res' [-Wunused-variable]
             int res = segQ(p.X, i+1, 1, 1, n+1);
                 ^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 19192 KB Output is correct
2 Correct 18 ms 19192 KB Output is correct
3 Correct 18 ms 19192 KB Output is correct
4 Correct 17 ms 19192 KB Output is correct
5 Correct 17 ms 19192 KB Output is correct
6 Correct 17 ms 19192 KB Output is correct
7 Correct 18 ms 19192 KB Output is correct
8 Correct 18 ms 19192 KB Output is correct
9 Correct 18 ms 19192 KB Output is correct
10 Correct 18 ms 19192 KB Output is correct
11 Correct 18 ms 19192 KB Output is correct
12 Correct 18 ms 19192 KB Output is correct
13 Correct 18 ms 19192 KB Output is correct
14 Correct 18 ms 19192 KB Output is correct
15 Correct 18 ms 19196 KB Output is correct
16 Correct 18 ms 19192 KB Output is correct
17 Correct 18 ms 19196 KB Output is correct
18 Correct 18 ms 19192 KB Output is correct
19 Correct 17 ms 19192 KB Output is correct
20 Correct 18 ms 19192 KB Output is correct
21 Correct 17 ms 19192 KB Output is correct
22 Correct 18 ms 19192 KB Output is correct
23 Correct 18 ms 19192 KB Output is correct
24 Correct 18 ms 19192 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 19192 KB Output is correct
2 Correct 18 ms 19192 KB Output is correct
3 Correct 18 ms 19192 KB Output is correct
4 Correct 17 ms 19192 KB Output is correct
5 Correct 17 ms 19192 KB Output is correct
6 Correct 17 ms 19192 KB Output is correct
7 Correct 18 ms 19192 KB Output is correct
8 Correct 18 ms 19192 KB Output is correct
9 Correct 18 ms 19192 KB Output is correct
10 Correct 18 ms 19192 KB Output is correct
11 Correct 18 ms 19192 KB Output is correct
12 Correct 18 ms 19192 KB Output is correct
13 Correct 18 ms 19192 KB Output is correct
14 Correct 18 ms 19192 KB Output is correct
15 Correct 18 ms 19196 KB Output is correct
16 Correct 18 ms 19192 KB Output is correct
17 Correct 18 ms 19196 KB Output is correct
18 Correct 18 ms 19192 KB Output is correct
19 Correct 17 ms 19192 KB Output is correct
20 Correct 18 ms 19192 KB Output is correct
21 Correct 17 ms 19192 KB Output is correct
22 Correct 18 ms 19192 KB Output is correct
23 Correct 18 ms 19192 KB Output is correct
24 Correct 18 ms 19192 KB Output is correct
25 Correct 160 ms 22752 KB Output is correct
26 Correct 38 ms 19704 KB Output is correct
27 Correct 227 ms 25848 KB Output is correct
28 Correct 237 ms 25976 KB Output is correct
29 Correct 157 ms 23928 KB Output is correct
30 Correct 167 ms 23672 KB Output is correct
31 Correct 182 ms 25080 KB Output is correct
32 Correct 254 ms 25848 KB Output is correct
33 Correct 217 ms 25444 KB Output is correct
34 Correct 138 ms 22392 KB Output is correct
35 Correct 228 ms 25852 KB Output is correct
36 Correct 235 ms 25920 KB Output is correct
37 Correct 140 ms 22520 KB Output is correct
38 Correct 245 ms 24952 KB Output is correct
39 Correct 50 ms 20088 KB Output is correct
40 Correct 229 ms 24952 KB Output is correct
41 Correct 174 ms 23416 KB Output is correct
42 Correct 234 ms 24952 KB Output is correct
43 Correct 90 ms 21112 KB Output is correct
44 Correct 236 ms 24952 KB Output is correct
45 Correct 56 ms 20216 KB Output is correct
46 Correct 227 ms 24952 KB Output is correct
47 Correct 74 ms 20728 KB Output is correct
48 Correct 238 ms 25020 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 25720 KB Output is correct
2 Correct 442 ms 29176 KB Output is correct
3 Correct 265 ms 26104 KB Output is correct
4 Correct 410 ms 29176 KB Output is correct
5 Correct 188 ms 23672 KB Output is correct
6 Correct 441 ms 29180 KB Output is correct
7 Correct 333 ms 27768 KB Output is correct
8 Correct 408 ms 29176 KB Output is correct
9 Correct 63 ms 20728 KB Output is correct
10 Correct 427 ms 29176 KB Output is correct
11 Correct 235 ms 25464 KB Output is correct
12 Correct 438 ms 29176 KB Output is correct
13 Correct 288 ms 27756 KB Output is correct
14 Correct 273 ms 27704 KB Output is correct
15 Correct 270 ms 27764 KB Output is correct
16 Correct 249 ms 28356 KB Output is correct
17 Correct 301 ms 27948 KB Output is correct
18 Correct 259 ms 28360 KB Output is correct
19 Correct 290 ms 27756 KB Output is correct
20 Correct 253 ms 27752 KB Output is correct
21 Correct 247 ms 27500 KB Output is correct
22 Correct 273 ms 27632 KB Output is correct
23 Correct 269 ms 27636 KB Output is correct
24 Correct 238 ms 27888 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 19192 KB Output is correct
2 Correct 18 ms 19192 KB Output is correct
3 Correct 18 ms 19192 KB Output is correct
4 Correct 17 ms 19192 KB Output is correct
5 Correct 17 ms 19192 KB Output is correct
6 Correct 17 ms 19192 KB Output is correct
7 Correct 18 ms 19192 KB Output is correct
8 Correct 18 ms 19192 KB Output is correct
9 Correct 18 ms 19192 KB Output is correct
10 Correct 18 ms 19192 KB Output is correct
11 Correct 18 ms 19192 KB Output is correct
12 Correct 18 ms 19192 KB Output is correct
13 Correct 18 ms 19192 KB Output is correct
14 Correct 18 ms 19192 KB Output is correct
15 Correct 18 ms 19196 KB Output is correct
16 Correct 18 ms 19192 KB Output is correct
17 Correct 18 ms 19196 KB Output is correct
18 Correct 18 ms 19192 KB Output is correct
19 Correct 17 ms 19192 KB Output is correct
20 Correct 18 ms 19192 KB Output is correct
21 Correct 17 ms 19192 KB Output is correct
22 Correct 18 ms 19192 KB Output is correct
23 Correct 18 ms 19192 KB Output is correct
24 Correct 18 ms 19192 KB Output is correct
25 Correct 160 ms 22752 KB Output is correct
26 Correct 38 ms 19704 KB Output is correct
27 Correct 227 ms 25848 KB Output is correct
28 Correct 237 ms 25976 KB Output is correct
29 Correct 157 ms 23928 KB Output is correct
30 Correct 167 ms 23672 KB Output is correct
31 Correct 182 ms 25080 KB Output is correct
32 Correct 254 ms 25848 KB Output is correct
33 Correct 217 ms 25444 KB Output is correct
34 Correct 138 ms 22392 KB Output is correct
35 Correct 228 ms 25852 KB Output is correct
36 Correct 235 ms 25920 KB Output is correct
37 Correct 140 ms 22520 KB Output is correct
38 Correct 245 ms 24952 KB Output is correct
39 Correct 50 ms 20088 KB Output is correct
40 Correct 229 ms 24952 KB Output is correct
41 Correct 174 ms 23416 KB Output is correct
42 Correct 234 ms 24952 KB Output is correct
43 Correct 90 ms 21112 KB Output is correct
44 Correct 236 ms 24952 KB Output is correct
45 Correct 56 ms 20216 KB Output is correct
46 Correct 227 ms 24952 KB Output is correct
47 Correct 74 ms 20728 KB Output is correct
48 Correct 238 ms 25020 KB Output is correct
49 Correct 371 ms 25720 KB Output is correct
50 Correct 442 ms 29176 KB Output is correct
51 Correct 265 ms 26104 KB Output is correct
52 Correct 410 ms 29176 KB Output is correct
53 Correct 188 ms 23672 KB Output is correct
54 Correct 441 ms 29180 KB Output is correct
55 Correct 333 ms 27768 KB Output is correct
56 Correct 408 ms 29176 KB Output is correct
57 Correct 63 ms 20728 KB Output is correct
58 Correct 427 ms 29176 KB Output is correct
59 Correct 235 ms 25464 KB Output is correct
60 Correct 438 ms 29176 KB Output is correct
61 Correct 288 ms 27756 KB Output is correct
62 Correct 273 ms 27704 KB Output is correct
63 Correct 270 ms 27764 KB Output is correct
64 Correct 249 ms 28356 KB Output is correct
65 Correct 301 ms 27948 KB Output is correct
66 Correct 259 ms 28360 KB Output is correct
67 Correct 290 ms 27756 KB Output is correct
68 Correct 253 ms 27752 KB Output is correct
69 Correct 247 ms 27500 KB Output is correct
70 Correct 273 ms 27632 KB Output is correct
71 Correct 269 ms 27636 KB Output is correct
72 Correct 238 ms 27888 KB Output is correct
73 Correct 703 ms 35068 KB Output is correct
74 Correct 462 ms 30072 KB Output is correct
75 Correct 691 ms 34808 KB Output is correct
76 Correct 998 ms 38312 KB Output is correct
77 Correct 495 ms 29816 KB Output is correct
78 Correct 766 ms 35448 KB Output is correct
79 Correct 826 ms 36728 KB Output is correct
80 Correct 928 ms 38288 KB Output is correct
81 Correct 378 ms 28024 KB Output is correct
82 Correct 634 ms 33912 KB Output is correct
83 Correct 647 ms 33912 KB Output is correct
84 Correct 903 ms 38304 KB Output is correct
85 Correct 553 ms 32548 KB Output is correct
86 Correct 742 ms 35740 KB Output is correct
87 Correct 332 ms 29172 KB Output is correct
88 Correct 714 ms 36268 KB Output is correct
89 Correct 651 ms 33964 KB Output is correct
90 Correct 705 ms 36184 KB Output is correct
91 Correct 431 ms 30732 KB Output is correct
92 Correct 730 ms 35688 KB Output is correct
93 Correct 323 ms 28912 KB Output is correct
94 Correct 717 ms 35568 KB Output is correct
95 Correct 394 ms 30064 KB Output is correct
96 Correct 705 ms 35824 KB Output is correct