oj.uz

Submission #102244

# Submission time Handle Problem Language Result Execution time Memory
102244 2019-03-23T20:22:10 Z Benq Two Antennas (JOI19_antennas) C++14
100 / 100
 980 ms 52436 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 1<<18;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); } 
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modInt {
    T val;
    T mod = 0;
    // static const T mod = MOD;

    void normalize() {
        if (mod == 0) return;
        val %= mod; if (val < 0) val += mod;
    }
    modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
    // modInt(T v = 0, T m = 0) : val(v) { normalize(); }

    explicit operator T() const { return val; }
    friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
    friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
    friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }

    friend void check(modInt& a, modInt& b) { // make sure all operations are valid
        // comment out if mod is static const
        if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
        T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
        if (a.mod != mod) { a.mod = mod; a.normalize(); }
        if (b.mod != mod) { b.mod = mod; b.normalize(); }
    }
    friend modInt operator+(modInt a, modInt b) {
        check(a,b); a.val += (T)b;
        if (a.val >= a.mod) a.val -= a.mod;
        return a;
    }
    friend modInt operator-(modInt a, modInt b) {
        check(a,b); a.val -= (T)b; 
        if (a.val < 0) a.val += a.mod; 
        return a;
    }
    friend modInt operator-(const modInt& a) { return modInt(0)-a; }

    friend modInt operator*(modInt a, modInt b) {
        check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
    }
    friend modInt exp(modInt a, ll p) {
        modInt ans(1,a.mod);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modInt inv(const modInt& a) {
        return {invGeneral(a.val,a.mod),a.mod};
        // return exp(b,b.mod-2) if prime
    }
    friend modInt operator/(modInt a, modInt b) { 
        check(a,b); return a*inv(b); 
    }
};

typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int N, Q, ans[MX];
vpi query;
vector<array<int,3>> a;
vi st[MX], en[MX];
vpi q[MX];

void init() {
    setIO(); re(N); a.resz(N); re(a);
    re(Q);
    F0R(i,Q) {
        int L,R; re(L,R); 
        query.pb({L-1,R-1});
        ans[i] = -1;
    }
}

template<int SZ> struct LazySegTree { // set SZ to a power of 2
    int d[2*SZ], c[2*SZ], lazy[2*SZ]; 
    
    LazySegTree() {
        F0R(i,2*SZ) d[i] = -1, c[i] = 0, lazy[i] = MOD;
    }
    
    void push(int ind, int L, int R) {
        if (lazy[ind] == MOD) return;
        ckmax(d[ind],c[ind]-lazy[ind]);
        if (L != R) {
            ckmin(lazy[2*ind],lazy[ind]);
            ckmin(lazy[2*ind+1],lazy[ind]);
        }
        lazy[ind] = MOD;
    }
    
    void pull(int ind) {
        d[ind] = max(d[2*ind],d[2*ind+1]);
        c[ind] = max(c[2*ind],c[2*ind+1]);
    }
    
    void upd1(int pos, int val, int ind = 1, int L = 0, int R = SZ-1) {
        push(ind,L,R);
        if (pos < L || R < pos) return;
        if (pos <= L && R <= pos) {
            c[ind] = val;
            return;
        }
        int M = (L+R)/2;
        upd1(pos,val,2*ind,L,M); upd1(pos,val,2*ind+1,M+1,R);
        pull(ind);
    }
    void upd2(int lo, int hi, int inc, int ind = 1, int L = 0, int R = SZ-1) {
        push(ind,L,R);
        if (hi < L || R < lo) return;
        if (lo <= L && R <= hi) {
            lazy[ind] = inc;
            push(ind,L,R);
            return;
        }
        int M = (L+R)/2;
        upd2(lo,hi,inc,2*ind,L,M); upd2(lo,hi,inc,2*ind+1,M+1,R);
        pull(ind);
    }
    int query(int lo, int hi, int ind = 1, int L = 0, int R = SZ-1) {
        push(ind,L,R);
        if (hi < L || R < lo) return -MOD;
        if (lo <= L && R <= hi) return d[ind];
        int M = (L+R)/2;
        return max(query(lo,hi,2*ind,L,M),query(lo,hi,2*ind+1,M+1,R));
    }
};

LazySegTree<MX> L;

void solve() {
    // d is -1's, c is -INF
    // change c[i] to h[i] or -INF 
    // ckmax(d[i],c[i]-lazy val);
    
    L = LazySegTree<MX>();
    F0R(i,MX) st[i].clear(), en[i].clear(), q[i].clear();
    F0R(i,sz(query)) q[query[i].s].pb({query[i].f,i});
    F0R(i,N) {
        if (i+a[i][1] < N) st[i+a[i][1]].pb(i);
        if (i+a[i][2] < N) en[i+a[i][2]].pb(i);
        trav(t,st[i]) L.upd1(t,a[t][0]);
        if (i-a[i][1] >= 0) L.upd2(max(i-a[i][2],0),i-a[i][1],a[i][0]);
        trav(t,q[i]) ckmax(ans[t.s],L.query(t.f,i));
        trav(t,en[i]) L.upd1(t,0);
    }
}

int main() {
    init();
    solve();
    reverse(all(a));
    trav(t,query) tie(t.f,t.s) = mp(N-1-t.s,N-1-t.f);
    solve();
    F0R(i,Q) ps(ans[i]);
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

antennas.cpp: In instantiation of 'void input::re(std::array<_Tp, _Nm>&) [with T = int; long unsigned int SZ = 3]':
antennas.cpp:77:62:   required from 'void input::re(std::vector<_Tp>&) [with T = std::array<int, 3>]'
antennas.cpp:198:36:   required from here
antennas.cpp:31:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define F0R(i, a) for (int i = 0; i < (a); i++)
                                     ^
antennas.cpp:78:60: note: in expansion of macro 'F0R'
     template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
                                                            ^~~
antennas.cpp: In function 'void io::setIn(std::__cxx11::string)':
antennas.cpp:117:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
antennas.cpp: In function 'void io::setOut(std::__cxx11::string)':
antennas.cpp:118:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 31096 KB Output is correct
2 Correct 37 ms 31104 KB Output is correct
3 Correct 37 ms 31104 KB Output is correct
4 Correct 37 ms 31232 KB Output is correct
5 Correct 36 ms 31096 KB Output is correct
6 Correct 37 ms 31096 KB Output is correct
7 Correct 39 ms 31224 KB Output is correct
8 Correct 40 ms 31232 KB Output is correct
9 Correct 38 ms 31224 KB Output is correct
10 Correct 38 ms 31104 KB Output is correct
11 Correct 37 ms 31224 KB Output is correct
12 Correct 38 ms 31224 KB Output is correct
13 Correct 38 ms 31104 KB Output is correct
14 Correct 37 ms 31104 KB Output is correct
15 Correct 38 ms 31104 KB Output is correct
16 Correct 39 ms 31096 KB Output is correct
17 Correct 39 ms 31096 KB Output is correct
18 Correct 38 ms 31096 KB Output is correct
19 Correct 38 ms 31156 KB Output is correct
20 Correct 38 ms 31088 KB Output is correct
21 Correct 39 ms 31104 KB Output is correct
22 Correct 38 ms 31096 KB Output is correct
23 Correct 40 ms 31100 KB Output is correct
24 Correct 39 ms 31232 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 31096 KB Output is correct
2 Correct 37 ms 31104 KB Output is correct
3 Correct 37 ms 31104 KB Output is correct
4 Correct 37 ms 31232 KB Output is correct
5 Correct 36 ms 31096 KB Output is correct
6 Correct 37 ms 31096 KB Output is correct
7 Correct 39 ms 31224 KB Output is correct
8 Correct 40 ms 31232 KB Output is correct
9 Correct 38 ms 31224 KB Output is correct
10 Correct 38 ms 31104 KB Output is correct
11 Correct 37 ms 31224 KB Output is correct
12 Correct 38 ms 31224 KB Output is correct
13 Correct 38 ms 31104 KB Output is correct
14 Correct 37 ms 31104 KB Output is correct
15 Correct 38 ms 31104 KB Output is correct
16 Correct 39 ms 31096 KB Output is correct
17 Correct 39 ms 31096 KB Output is correct
18 Correct 38 ms 31096 KB Output is correct
19 Correct 38 ms 31156 KB Output is correct
20 Correct 38 ms 31088 KB Output is correct
21 Correct 39 ms 31104 KB Output is correct
22 Correct 38 ms 31096 KB Output is correct
23 Correct 40 ms 31100 KB Output is correct
24 Correct 39 ms 31232 KB Output is correct
25 Correct 152 ms 37864 KB Output is correct
26 Correct 54 ms 31992 KB Output is correct
27 Correct 239 ms 40428 KB Output is correct
28 Correct 252 ms 40408 KB Output is correct
29 Correct 150 ms 38120 KB Output is correct
30 Correct 153 ms 37628 KB Output is correct
31 Correct 184 ms 39800 KB Output is correct
32 Correct 217 ms 40416 KB Output is correct
33 Correct 221 ms 40168 KB Output is correct
34 Correct 114 ms 35668 KB Output is correct
35 Correct 228 ms 40808 KB Output is correct
36 Correct 212 ms 40424 KB Output is correct
37 Correct 130 ms 36080 KB Output is correct
38 Correct 245 ms 39400 KB Output is correct
39 Correct 64 ms 32380 KB Output is correct
40 Correct 208 ms 39524 KB Output is correct
41 Correct 154 ms 37548 KB Output is correct
42 Correct 211 ms 39356 KB Output is correct
43 Correct 90 ms 34164 KB Output is correct
44 Correct 194 ms 39400 KB Output is correct
45 Correct 68 ms 32756 KB Output is correct
46 Correct 318 ms 39400 KB Output is correct
47 Correct 84 ms 33268 KB Output is correct
48 Correct 198 ms 39440 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 41208 KB Output is correct
2 Correct 497 ms 41876 KB Output is correct
3 Correct 352 ms 39544 KB Output is correct
4 Correct 521 ms 41900 KB Output is correct
5 Correct 213 ms 36700 KB Output is correct
6 Correct 505 ms 41872 KB Output is correct
7 Correct 432 ms 40824 KB Output is correct
8 Correct 478 ms 41872 KB Output is correct
9 Correct 91 ms 33016 KB Output is correct
10 Correct 531 ms 40544 KB Output is correct
11 Correct 318 ms 38852 KB Output is correct
12 Correct 520 ms 42036 KB Output is correct
13 Correct 279 ms 39796 KB Output is correct
14 Correct 274 ms 39676 KB Output is correct
15 Correct 247 ms 38900 KB Output is correct
16 Correct 243 ms 39016 KB Output is correct
17 Correct 304 ms 40308 KB Output is correct
18 Correct 257 ms 39160 KB Output is correct
19 Correct 267 ms 39192 KB Output is correct
20 Correct 249 ms 39464 KB Output is correct
21 Correct 282 ms 39772 KB Output is correct
22 Correct 247 ms 39564 KB Output is correct
23 Correct 263 ms 39432 KB Output is correct
24 Correct 246 ms 38772 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 31096 KB Output is correct
2 Correct 37 ms 31104 KB Output is correct
3 Correct 37 ms 31104 KB Output is correct
4 Correct 37 ms 31232 KB Output is correct
5 Correct 36 ms 31096 KB Output is correct
6 Correct 37 ms 31096 KB Output is correct
7 Correct 39 ms 31224 KB Output is correct
8 Correct 40 ms 31232 KB Output is correct
9 Correct 38 ms 31224 KB Output is correct
10 Correct 38 ms 31104 KB Output is correct
11 Correct 37 ms 31224 KB Output is correct
12 Correct 38 ms 31224 KB Output is correct
13 Correct 38 ms 31104 KB Output is correct
14 Correct 37 ms 31104 KB Output is correct
15 Correct 38 ms 31104 KB Output is correct
16 Correct 39 ms 31096 KB Output is correct
17 Correct 39 ms 31096 KB Output is correct
18 Correct 38 ms 31096 KB Output is correct
19 Correct 38 ms 31156 KB Output is correct
20 Correct 38 ms 31088 KB Output is correct
21 Correct 39 ms 31104 KB Output is correct
22 Correct 38 ms 31096 KB Output is correct
23 Correct 40 ms 31100 KB Output is correct
24 Correct 39 ms 31232 KB Output is correct
25 Correct 152 ms 37864 KB Output is correct
26 Correct 54 ms 31992 KB Output is correct
27 Correct 239 ms 40428 KB Output is correct
28 Correct 252 ms 40408 KB Output is correct
29 Correct 150 ms 38120 KB Output is correct
30 Correct 153 ms 37628 KB Output is correct
31 Correct 184 ms 39800 KB Output is correct
32 Correct 217 ms 40416 KB Output is correct
33 Correct 221 ms 40168 KB Output is correct
34 Correct 114 ms 35668 KB Output is correct
35 Correct 228 ms 40808 KB Output is correct
36 Correct 212 ms 40424 KB Output is correct
37 Correct 130 ms 36080 KB Output is correct
38 Correct 245 ms 39400 KB Output is correct
39 Correct 64 ms 32380 KB Output is correct
40 Correct 208 ms 39524 KB Output is correct
41 Correct 154 ms 37548 KB Output is correct
42 Correct 211 ms 39356 KB Output is correct
43 Correct 90 ms 34164 KB Output is correct
44 Correct 194 ms 39400 KB Output is correct
45 Correct 68 ms 32756 KB Output is correct
46 Correct 318 ms 39400 KB Output is correct
47 Correct 84 ms 33268 KB Output is correct
48 Correct 198 ms 39440 KB Output is correct
49 Correct 438 ms 41208 KB Output is correct
50 Correct 497 ms 41876 KB Output is correct
51 Correct 352 ms 39544 KB Output is correct
52 Correct 521 ms 41900 KB Output is correct
53 Correct 213 ms 36700 KB Output is correct
54 Correct 505 ms 41872 KB Output is correct
55 Correct 432 ms 40824 KB Output is correct
56 Correct 478 ms 41872 KB Output is correct
57 Correct 91 ms 33016 KB Output is correct
58 Correct 531 ms 40544 KB Output is correct
59 Correct 318 ms 38852 KB Output is correct
60 Correct 520 ms 42036 KB Output is correct
61 Correct 279 ms 39796 KB Output is correct
62 Correct 274 ms 39676 KB Output is correct
63 Correct 247 ms 38900 KB Output is correct
64 Correct 243 ms 39016 KB Output is correct
65 Correct 304 ms 40308 KB Output is correct
66 Correct 257 ms 39160 KB Output is correct
67 Correct 267 ms 39192 KB Output is correct
68 Correct 249 ms 39464 KB Output is correct
69 Correct 282 ms 39772 KB Output is correct
70 Correct 247 ms 39564 KB Output is correct
71 Correct 263 ms 39432 KB Output is correct
72 Correct 246 ms 38772 KB Output is correct
73 Correct 765 ms 49216 KB Output is correct
74 Correct 619 ms 43104 KB Output is correct
75 Correct 691 ms 49104 KB Output is correct
76 Correct 980 ms 52184 KB Output is correct
77 Correct 451 ms 44640 KB Output is correct
78 Correct 801 ms 49644 KB Output is correct
79 Correct 780 ms 51052 KB Output is correct
80 Correct 910 ms 52436 KB Output is correct
81 Correct 313 ms 43008 KB Output is correct
82 Correct 669 ms 47880 KB Output is correct
83 Correct 647 ms 48492 KB Output is correct
84 Correct 945 ms 52292 KB Output is correct
85 Correct 541 ms 46092 KB Output is correct
86 Correct 662 ms 48748 KB Output is correct
87 Correct 307 ms 40792 KB Output is correct
88 Correct 682 ms 48412 KB Output is correct
89 Correct 600 ms 47696 KB Output is correct
90 Correct 654 ms 48492 KB Output is correct
91 Correct 419 ms 43200 KB Output is correct
92 Correct 691 ms 48724 KB Output is correct
93 Correct 366 ms 42212 KB Output is correct
94 Correct 644 ms 48876 KB Output is correct
95 Correct 375 ms 42740 KB Output is correct
96 Correct 643 ms 47820 KB Output is correct