oj.uz

Submission #204105

# Submission time Handle Problem Language Result Execution time Memory
204105 2020-02-24T11:17:50 Z Rakhmand Two Antennas (JOI19_antennas) C++14
100 / 100
 1097 ms 63608 KB 
//
//  ROIGold.cpp
//  Main calisma
//
//  Created by Rakhman on 05/02/2019.
//  Copyright © 2019 Rakhman. All rights reserved.
//
 
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
 
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for(llong i = start; i <= finish; i += k)
 
const long long MXN = 2e5 + 200;
const long long N = 2e5 + 200;
const long long MNN = 5e3 + 100;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const long long OO = 2e9 + 500;
 
typedef long long llong;
typedef unsigned long long ullong;
 
using namespace std;

void gettxt(bool yes){
    if(yes == 1){
        freopen("problem.in", "r", stdin);
        freopen("problem.out", "w", stdout);
    }else{
        freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/input.txt", "r", stdin);
    }
}
 
llong n, Q, ans[MXN], ql[MXN], qr[MXN];
vector<llong> st[MXN], en[MXN], qq[MXN];

struct antenna{
    llong a, b, h;
}b[MXN];

struct node{
    llong t, mx, mod;
}t[MXN * 4];

void push(llong v, llong tl, llong tr){
    if (t[v].mod == OO) return;
    if (tl != tr) {
        t[v + v].mod = min(t[v + v + 1].mod, t[v].mod);
        t[v + v + 1].mod = min(t[v + v + 1].mod, t[v].mod);
    }
    t[v].t = max(t[v].t, t[v].mx - t[v].mod);
    t[v].mod = OO;
}

void updating(llong v){
    t[v].mx = max(t[v + v].mx, t[v + v + 1].mx);
    t[v].t = max(t[v + v].t, t[v + v + 1].t);
}

void upd(llong v, llong tl, llong tr, llong pos, llong x){
    push(v, tl, tr);
    if (tl > pos || pos > tr) return;
    if (tl == tr) {
        t[v].mx = x;
        return;
    }
    int tm = (tl + tr) / 2;
    upd (v + v, tl, tm, pos, x);
    upd (v + v + 1, tm + 1, tr, pos, x);
    updating(v);
}

void segupd(llong v, llong tl, llong tr, llong l, llong r, llong x){
    push(v, tl,  tr);
    if (l > tr || tl > r) return;
    if (tl >= l && tr <= r) {
        t[v].mod = x;
        push(v, tl, tr);
        return;
    }
    int tm = (tl + tr) / 2;
    segupd (v + v, tl, tm, l, r, x);
    segupd (v + v + 1, tm + 1, tr, l, r, x);
    updating(v);
}

llong get (int v, int tl, int tr, int l, int r) {
       push(v, tl, tr);
       if (tl >= l && tr <= r) return t[v].t;
       if (tl > r || l > tr) return -1;
       int tm = (tl + tr) >> 1;
       return max(get (v + v, tl, tm, l, r), get(v + v + 1, tm + 1, tr, l, r));
}

void solve(){
    for(llong i = 1; i < MXN * 4; i++){
        t[i].t = -1;
        t[i].mx = 0;
        t[i].mod = OO;
    }
    for (int i = 1; i <= n; i ++) {
           st[i].clear();
           en[i].clear();
           qq[i].clear();
    }
    for (int i = 1; i <= Q; i ++) {
        qq[qr[i]].pb(i);
    }
    for (int i = 1; i <= n; i ++) {
        if (i + b[i].a <= n) {
            st[i + b[i].a].pb(i);
        }
        if (i + b[i].b <= n) {
            en[i + b[i].b].pb(i);
        }
    }
    for(int i = 1; i <= n; i++){
        for (auto j : st[i])
            upd(1, 1, n, j, b[j].h);
        if (i > b[i].a) {
            segupd(1, 1, n, i - b[i].b, i - b[i].a, b[i].h);
        }
        for (auto j : qq[i]) {
            ans[j] = max(ans[j], get(1, 1, n, ql[j], qr[j]));
        }
        for (auto j : en[i])
            upd(1, 1, n, j, 0);
    }
}

int main () {
    ios;
    //gettxt(0);
    cin >> n;
    for (int i = 1; i <= n; i ++) {
        cin >> b[i].h >> b[i].a >> b[i].b;
    }
    cin >> Q;
    for (int i = 1; i <= Q; ++i) {
        ans[i] = -1;
        cin >> ql[i] >> qr[i];
    }
    solve();
    reverse(b + 1, b + n + 1);
    for (int i = 1; i <= Q; i ++) {
        tie(ql[i], qr[i]) = make_pair(n - qr[i] + 1, n - ql[i] + 1);
    }
    solve();
    for (int i = 1; i <= Q; i ++)
        cout << ans[i] << nl;
    return 0;
}

Compilation message

antennas.cpp: In function 'void gettxt(bool)':
antennas.cpp:56:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("problem.in", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("problem.out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:59:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/input.txt", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 33272 KB Output is correct
2 Correct 27 ms 33272 KB Output is correct
3 Correct 27 ms 33272 KB Output is correct
4 Correct 28 ms 33272 KB Output is correct
5 Correct 28 ms 33272 KB Output is correct
6 Correct 29 ms 33272 KB Output is correct
7 Correct 27 ms 33272 KB Output is correct
8 Correct 28 ms 33272 KB Output is correct
9 Correct 28 ms 33272 KB Output is correct
10 Correct 28 ms 33272 KB Output is correct
11 Correct 28 ms 33272 KB Output is correct
12 Correct 33 ms 33320 KB Output is correct
13 Correct 29 ms 33272 KB Output is correct
14 Correct 28 ms 33276 KB Output is correct
15 Correct 28 ms 33272 KB Output is correct
16 Correct 28 ms 33276 KB Output is correct
17 Correct 28 ms 33400 KB Output is correct
18 Correct 28 ms 33272 KB Output is correct
19 Correct 28 ms 33272 KB Output is correct
20 Correct 28 ms 33400 KB Output is correct
21 Correct 28 ms 33272 KB Output is correct
22 Correct 28 ms 33272 KB Output is correct
23 Correct 28 ms 33272 KB Output is correct
24 Correct 29 ms 33272 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 33272 KB Output is correct
2 Correct 27 ms 33272 KB Output is correct
3 Correct 27 ms 33272 KB Output is correct
4 Correct 28 ms 33272 KB Output is correct
5 Correct 28 ms 33272 KB Output is correct
6 Correct 29 ms 33272 KB Output is correct
7 Correct 27 ms 33272 KB Output is correct
8 Correct 28 ms 33272 KB Output is correct
9 Correct 28 ms 33272 KB Output is correct
10 Correct 28 ms 33272 KB Output is correct
11 Correct 28 ms 33272 KB Output is correct
12 Correct 33 ms 33320 KB Output is correct
13 Correct 29 ms 33272 KB Output is correct
14 Correct 28 ms 33276 KB Output is correct
15 Correct 28 ms 33272 KB Output is correct
16 Correct 28 ms 33276 KB Output is correct
17 Correct 28 ms 33400 KB Output is correct
18 Correct 28 ms 33272 KB Output is correct
19 Correct 28 ms 33272 KB Output is correct
20 Correct 28 ms 33400 KB Output is correct
21 Correct 28 ms 33272 KB Output is correct
22 Correct 28 ms 33272 KB Output is correct
23 Correct 28 ms 33272 KB Output is correct
24 Correct 29 ms 33272 KB Output is correct
25 Correct 156 ms 41660 KB Output is correct
26 Correct 43 ms 34296 KB Output is correct
27 Correct 214 ms 44880 KB Output is correct
28 Correct 215 ms 44796 KB Output is correct
29 Correct 145 ms 41720 KB Output is correct
30 Correct 160 ms 41400 KB Output is correct
31 Correct 166 ms 43896 KB Output is correct
32 Correct 227 ms 44792 KB Output is correct
33 Correct 199 ms 44408 KB Output is correct
34 Correct 118 ms 38904 KB Output is correct
35 Correct 217 ms 45176 KB Output is correct
36 Correct 243 ms 44792 KB Output is correct
37 Correct 129 ms 39416 KB Output is correct
38 Correct 217 ms 43768 KB Output is correct
39 Correct 53 ms 34808 KB Output is correct
40 Correct 219 ms 43768 KB Output is correct
41 Correct 160 ms 41208 KB Output is correct
42 Correct 212 ms 43768 KB Output is correct
43 Correct 84 ms 36856 KB Output is correct
44 Correct 218 ms 43768 KB Output is correct
45 Correct 61 ms 35192 KB Output is correct
46 Correct 216 ms 43896 KB Output is correct
47 Correct 74 ms 36088 KB Output is correct
48 Correct 213 ms 43772 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 42872 KB Output is correct
2 Correct 568 ms 43896 KB Output is correct
3 Correct 355 ms 40696 KB Output is correct
4 Correct 553 ms 43848 KB Output is correct
5 Correct 223 ms 38136 KB Output is correct
6 Correct 556 ms 43896 KB Output is correct
7 Correct 479 ms 42360 KB Output is correct
8 Correct 542 ms 48248 KB Output is correct
9 Correct 85 ms 35576 KB Output is correct
10 Correct 555 ms 48420 KB Output is correct
11 Correct 317 ms 42744 KB Output is correct
12 Correct 582 ms 48248 KB Output is correct
13 Correct 334 ms 47592 KB Output is correct
14 Correct 322 ms 47424 KB Output is correct
15 Correct 315 ms 46468 KB Output is correct
16 Correct 305 ms 46648 KB Output is correct
17 Correct 351 ms 48112 KB Output is correct
18 Correct 334 ms 47048 KB Output is correct
19 Correct 342 ms 47084 KB Output is correct
20 Correct 325 ms 47208 KB Output is correct
21 Correct 330 ms 47716 KB Output is correct
22 Correct 336 ms 47368 KB Output is correct
23 Correct 324 ms 47348 KB Output is correct
24 Correct 302 ms 46092 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 33272 KB Output is correct
2 Correct 27 ms 33272 KB Output is correct
3 Correct 27 ms 33272 KB Output is correct
4 Correct 28 ms 33272 KB Output is correct
5 Correct 28 ms 33272 KB Output is correct
6 Correct 29 ms 33272 KB Output is correct
7 Correct 27 ms 33272 KB Output is correct
8 Correct 28 ms 33272 KB Output is correct
9 Correct 28 ms 33272 KB Output is correct
10 Correct 28 ms 33272 KB Output is correct
11 Correct 28 ms 33272 KB Output is correct
12 Correct 33 ms 33320 KB Output is correct
13 Correct 29 ms 33272 KB Output is correct
14 Correct 28 ms 33276 KB Output is correct
15 Correct 28 ms 33272 KB Output is correct
16 Correct 28 ms 33276 KB Output is correct
17 Correct 28 ms 33400 KB Output is correct
18 Correct 28 ms 33272 KB Output is correct
19 Correct 28 ms 33272 KB Output is correct
20 Correct 28 ms 33400 KB Output is correct
21 Correct 28 ms 33272 KB Output is correct
22 Correct 28 ms 33272 KB Output is correct
23 Correct 28 ms 33272 KB Output is correct
24 Correct 29 ms 33272 KB Output is correct
25 Correct 156 ms 41660 KB Output is correct
26 Correct 43 ms 34296 KB Output is correct
27 Correct 214 ms 44880 KB Output is correct
28 Correct 215 ms 44796 KB Output is correct
29 Correct 145 ms 41720 KB Output is correct
30 Correct 160 ms 41400 KB Output is correct
31 Correct 166 ms 43896 KB Output is correct
32 Correct 227 ms 44792 KB Output is correct
33 Correct 199 ms 44408 KB Output is correct
34 Correct 118 ms 38904 KB Output is correct
35 Correct 217 ms 45176 KB Output is correct
36 Correct 243 ms 44792 KB Output is correct
37 Correct 129 ms 39416 KB Output is correct
38 Correct 217 ms 43768 KB Output is correct
39 Correct 53 ms 34808 KB Output is correct
40 Correct 219 ms 43768 KB Output is correct
41 Correct 160 ms 41208 KB Output is correct
42 Correct 212 ms 43768 KB Output is correct
43 Correct 84 ms 36856 KB Output is correct
44 Correct 218 ms 43768 KB Output is correct
45 Correct 61 ms 35192 KB Output is correct
46 Correct 216 ms 43896 KB Output is correct
47 Correct 74 ms 36088 KB Output is correct
48 Correct 213 ms 43772 KB Output is correct
49 Correct 494 ms 42872 KB Output is correct
50 Correct 568 ms 43896 KB Output is correct
51 Correct 355 ms 40696 KB Output is correct
52 Correct 553 ms 43848 KB Output is correct
53 Correct 223 ms 38136 KB Output is correct
54 Correct 556 ms 43896 KB Output is correct
55 Correct 479 ms 42360 KB Output is correct
56 Correct 542 ms 48248 KB Output is correct
57 Correct 85 ms 35576 KB Output is correct
58 Correct 555 ms 48420 KB Output is correct
59 Correct 317 ms 42744 KB Output is correct
60 Correct 582 ms 48248 KB Output is correct
61 Correct 334 ms 47592 KB Output is correct
62 Correct 322 ms 47424 KB Output is correct
63 Correct 315 ms 46468 KB Output is correct
64 Correct 305 ms 46648 KB Output is correct
65 Correct 351 ms 48112 KB Output is correct
66 Correct 334 ms 47048 KB Output is correct
67 Correct 342 ms 47084 KB Output is correct
68 Correct 325 ms 47208 KB Output is correct
69 Correct 330 ms 47716 KB Output is correct
70 Correct 336 ms 47368 KB Output is correct
71 Correct 324 ms 47348 KB Output is correct
72 Correct 302 ms 46092 KB Output is correct
73 Correct 891 ms 58560 KB Output is correct
74 Correct 605 ms 50040 KB Output is correct
75 Correct 803 ms 58124 KB Output is correct
76 Correct 1097 ms 63524 KB Output is correct
77 Correct 551 ms 50424 KB Output is correct
78 Correct 880 ms 59256 KB Output is correct
79 Correct 946 ms 61152 KB Output is correct
80 Correct 1059 ms 63608 KB Output is correct
81 Correct 398 ms 47612 KB Output is correct
82 Correct 796 ms 56644 KB Output is correct
83 Correct 769 ms 56764 KB Output is correct
84 Correct 1057 ms 63444 KB Output is correct
85 Correct 618 ms 56428 KB Output is correct
86 Correct 819 ms 61656 KB Output is correct
87 Correct 388 ms 49044 KB Output is correct
88 Correct 770 ms 61052 KB Output is correct
89 Correct 688 ms 59072 KB Output is correct
90 Correct 815 ms 60924 KB Output is correct
91 Correct 485 ms 52588 KB Output is correct
92 Correct 799 ms 61320 KB Output is correct
93 Correct 406 ms 50788 KB Output is correct
94 Correct 790 ms 61636 KB Output is correct
95 Correct 462 ms 51696 KB Output is correct
96 Correct 761 ms 60136 KB Output is correct