oj.uz

Submission #281928

# Submission time Handle Problem Language Result Execution time Memory
281928 2020-08-23T15:53:03 Z rqi Two Antennas (JOI19_antennas) C++14
100 / 100
 1043 ms 29424 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

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

typedef vector<int> vi; 
typedef vector<bool> vb; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

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

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }

template<class T, class U> T fstTrue(T lo, T hi, U f) { 
    // note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi);
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
    lo --; assert(lo <= hi); // assuming f is decreasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi+1);
        f(mid) ? lo = mid : hi = mid-1;
    } 
    return lo;
}
template<class T> void remDup(vector<T>& v) { 
    sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
    #ifdef LOCAL
        return b ? "true" : "false"; 
    #else 
        return ts((int)b);
    #endif
}
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    #ifdef LOCAL
        bool fst = 1; str res = "{";
        for (const auto& x: v) {
            if (!fst) res += ", ";
            fst = 0; res += ts(x);
        }
        res += "}"; return res;
    #else
        bool fst = 1; str res = "";
        for (const auto& x: v) {
            if (!fst) res += " ";
            fst = 0; res += ts(x);
        }
        return res;

    #endif
}
template<class A, class B> str ts(pair<A,B> p) {
    #ifdef LOCAL
        return "("+ts(p.f)+", "+ts(p.s)+")"; 
    #else
        return ts(p.f)+" "+ts(p.s);
    #endif
}

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
    #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
    #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
         << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
    #define dbg(...) 0
    #define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

const int mx = 200005;
int N, Q;
int H[mx];
int A[mx];
int B[mx];
int L[mx];
int R[mx];
int ans[mx];
/**
 * Description: 1D range increment and sum query.
 * Source: USACO Counting Haybales
 * Verification: SPOJ Horrible
 */

template<int SZ> struct LazySeg { 
    static_assert(pct(SZ) == 1); // SZ must be power of 2
    array<int, 2> comb(array<int, 2>  a, array<int, 2>  b) { 
        array<int, 2> c;
        c[0] = max(a[0], b[0]);
        c[1] = max(a[1], b[1]);
        return c;
    }
    array<int, 2> seg[2*SZ];
    int lazy[2*SZ]; //max update the y values 
    LazySeg() { 
        F0R(i,2*SZ){
            seg[i][0] = -MOD;
            seg[i][1] = -2*MOD;
            lazy[i] = -MOD;
        }
    }
    void push(int ind, int L, int R) { /// modify values for current node
        ckmax(seg[ind][1], seg[ind][0]+lazy[ind]);
        if (L != R) F0R(i,2) ckmax(lazy[2*ind+i], lazy[ind]); /// prop to children
        lazy[ind] = -MOD; 
    } // recalc values for current node
    void pull(int ind) { seg[ind] = comb(seg[2*ind],seg[2*ind+1]); }
    void build() { ROF(i,1,SZ) pull(i); }
    void updmaxy(int lo, int hi, int val, 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] = val; push(ind,L,R); return; }
        int M = (L+R)/2; updmaxy(lo,hi,val,2*ind,L,M); 
        updmaxy(lo,hi,val,2*ind+1,M+1,R); pull(ind);
    }
    void updx(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(L == R){
            seg[ind][0] = val;
            return;
        }
        int M = (L+R)/2;
        updx(pos, val, 2*ind, L, M);
        updx(pos, val, 2*ind+1, M+1, R);
        pull(ind);
    }
    // void activate(int pos, int ind = 1, int L = 0, int R = SZ-1){
    //     push(ind, L, R); if(pos < L || R < pos) return;
    //     if(L == R){
    //         seg[ind][0] = H[pos]; 
    //         return;
    //     }
    //     pull(ind);
    // }
    // void deactivate(int pos, ind = 1, int L = 0, int R = SZ-1){
    //     push(ind, L, R); if(pos < L || R < pos) return;
    //     if(L == R){
    //         seg[ind][0] = -MOD;
    //         return;
    //     }
    //     pull(ind);
    // }
    int query(int lo, int hi, int ind=1, int L=0, int R=SZ-1) {
        push(ind,L,R); if (lo > R || L > hi) return -MOD;
        if (lo <= L && R <= hi) return seg[ind][1];
        int M = (L+R)/2; 
        return max(query(lo,hi,2*ind,L,M),query(lo,hi,2*ind+1,M+1,R));
    }
};

void solve(){
    // for(int i = 1; i <= N; i++){
    //     dbg(i, H[i], A[i], B[i]);
    // }
    // for(int i = 1; i <= Q; i++){
    //     dbg(i, L[i], R[i]);
    // }
    LazySeg<262144> lseg;
    vector<pair<int, pi>> upds; //position, upd position, val
    vpi queries; //R value, index
    for(int i = 1; i <= N; i++){
        upds.pb(mp(i+A[i], mp(i, H[i])));
        upds.pb(mp(i+B[i]+1, mp(i, -MOD)));
    }
    for(int i = 1; i <= Q; i++){
        queries.pb(mp(R[i], i));
    }
    sort(all(upds));
    sort(all(queries));
    //dbg(upds);
    //dbg(queries);
    int uind = 0;
    int yind = 1;
    for(auto u: queries){
        while(uind < sz(upds) && upds[uind].f <= R[u.s]){
            while(yind < upds[uind].f){
                lseg.updmaxy(yind-B[yind], yind-A[yind], -H[yind]);
                //dbg("updmaxy", yind-B[yind], yind-A[yind], -H[yind]);
                yind++;
            }
            lseg.updx(upds[uind].s.f, upds[uind].s.s);
            //dbg("updx", upds[uind].s.f, upds[uind].s.s);
            uind++;
        }
        while(yind <= R[u.s]){
            lseg.updmaxy(yind-B[yind], yind-A[yind], -H[yind]);
            //dbg("updmaxy", yind-B[yind], yind-A[yind], -H[yind]);
            yind++;
        }
        //dbg("query", L[u.s], R[u.s], lseg.query(L[u.s], R[u.s]));
        ckmax(ans[u.s], lseg.query(L[u.s], R[u.s]));
    }
}

int main() {
    setIO();
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> H[i] >> A[i] >> B[i];
    }
    cin >> Q;
    for(int i = 1; i <= Q; i++){
        cin >> L[i] >> R[i];
    }

    for(int i = 1; i <= Q; i++){
        ans[i] = -1;
    }

    solve();
    for(int i = 1; i <= N/2; i++){
        swap(H[i], H[N+1-i]);
        swap(A[i], A[N+1-i]);
        swap(B[i], B[N+1-i]);
    }
    for(int i = 1; i <= Q; i++){
        swap(L[i], R[i]);
        L[i] = N+1-L[i];
        R[i] = N+1-R[i];
    }
    solve();
    for(int i = 1; i <= Q; i++){
        ps(ans[i]);
    }
    // you should actually read the stuff at the bottom
}

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

Compilation message

antennas.cpp: In function 'void setIn(str)':
antennas.cpp:168:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  168 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
antennas.cpp: In function 'void setOut(str)':
antennas.cpp:169:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  169 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6528 KB Output is correct
2 Correct 7 ms 6528 KB Output is correct
3 Correct 8 ms 6528 KB Output is correct
4 Correct 8 ms 6528 KB Output is correct
5 Correct 6 ms 6528 KB Output is correct
6 Correct 7 ms 6528 KB Output is correct
7 Correct 7 ms 6528 KB Output is correct
8 Correct 8 ms 6528 KB Output is correct
9 Correct 7 ms 6528 KB Output is correct
10 Correct 7 ms 6528 KB Output is correct
11 Correct 7 ms 6528 KB Output is correct
12 Correct 7 ms 6528 KB Output is correct
13 Correct 7 ms 6528 KB Output is correct
14 Correct 7 ms 6528 KB Output is correct
15 Correct 7 ms 6528 KB Output is correct
16 Correct 8 ms 6528 KB Output is correct
17 Correct 7 ms 6528 KB Output is correct
18 Correct 7 ms 6528 KB Output is correct
19 Correct 7 ms 6528 KB Output is correct
20 Correct 7 ms 6528 KB Output is correct
21 Correct 7 ms 6528 KB Output is correct
22 Correct 7 ms 6528 KB Output is correct
23 Correct 7 ms 6528 KB Output is correct
24 Correct 7 ms 6528 KB Output is correct
25 Correct 221 ms 12896 KB Output is correct
26 Correct 32 ms 7212 KB Output is correct
27 Correct 308 ms 14436 KB Output is correct
28 Correct 309 ms 14560 KB Output is correct
29 Correct 216 ms 12660 KB Output is correct
30 Correct 207 ms 12612 KB Output is correct
31 Correct 278 ms 14032 KB Output is correct
32 Correct 311 ms 14520 KB Output is correct
33 Correct 313 ms 14076 KB Output is correct
34 Correct 148 ms 10548 KB Output is correct
35 Correct 317 ms 14280 KB Output is correct
36 Correct 323 ms 14520 KB Output is correct
37 Correct 188 ms 10984 KB Output is correct
38 Correct 338 ms 14408 KB Output is correct
39 Correct 47 ms 7716 KB Output is correct
40 Correct 339 ms 14536 KB Output is correct
41 Correct 233 ms 13024 KB Output is correct
42 Correct 301 ms 14536 KB Output is correct
43 Correct 98 ms 9072 KB Output is correct
44 Correct 295 ms 14408 KB Output is correct
45 Correct 56 ms 8168 KB Output is correct
46 Correct 307 ms 14408 KB Output is correct
47 Correct 83 ms 8548 KB Output is correct
48 Correct 311 ms 14408 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 517 ms 23136 KB Output is correct
2 Correct 547 ms 24228 KB Output is correct
3 Correct 404 ms 20728 KB Output is correct
4 Correct 545 ms 24328 KB Output is correct
5 Correct 230 ms 14824 KB Output is correct
6 Correct 543 ms 24328 KB Output is correct
7 Correct 456 ms 22772 KB Output is correct
8 Correct 533 ms 24328 KB Output is correct
9 Correct 75 ms 9092 KB Output is correct
10 Correct 538 ms 24328 KB Output is correct
11 Correct 326 ms 16744 KB Output is correct
12 Correct 536 ms 24356 KB Output is correct
13 Correct 376 ms 24208 KB Output is correct
14 Correct 351 ms 24132 KB Output is correct
15 Correct 332 ms 24304 KB Output is correct
16 Correct 358 ms 24252 KB Output is correct
17 Correct 373 ms 24200 KB Output is correct
18 Correct 389 ms 24132 KB Output is correct
19 Correct 349 ms 24204 KB Output is correct
20 Correct 347 ms 24200 KB Output is correct
21 Correct 346 ms 24116 KB Output is correct
22 Correct 349 ms 24356 KB Output is correct
23 Correct 341 ms 24200 KB Output is correct
24 Correct 328 ms 24204 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6528 KB Output is correct
2 Correct 7 ms 6528 KB Output is correct
3 Correct 8 ms 6528 KB Output is correct
4 Correct 8 ms 6528 KB Output is correct
5 Correct 6 ms 6528 KB Output is correct
6 Correct 7 ms 6528 KB Output is correct
7 Correct 7 ms 6528 KB Output is correct
8 Correct 8 ms 6528 KB Output is correct
9 Correct 7 ms 6528 KB Output is correct
10 Correct 7 ms 6528 KB Output is correct
11 Correct 7 ms 6528 KB Output is correct
12 Correct 7 ms 6528 KB Output is correct
13 Correct 7 ms 6528 KB Output is correct
14 Correct 7 ms 6528 KB Output is correct
15 Correct 7 ms 6528 KB Output is correct
16 Correct 8 ms 6528 KB Output is correct
17 Correct 7 ms 6528 KB Output is correct
18 Correct 7 ms 6528 KB Output is correct
19 Correct 7 ms 6528 KB Output is correct
20 Correct 7 ms 6528 KB Output is correct
21 Correct 7 ms 6528 KB Output is correct
22 Correct 7 ms 6528 KB Output is correct
23 Correct 7 ms 6528 KB Output is correct
24 Correct 7 ms 6528 KB Output is correct
25 Correct 221 ms 12896 KB Output is correct
26 Correct 32 ms 7212 KB Output is correct
27 Correct 308 ms 14436 KB Output is correct
28 Correct 309 ms 14560 KB Output is correct
29 Correct 216 ms 12660 KB Output is correct
30 Correct 207 ms 12612 KB Output is correct
31 Correct 278 ms 14032 KB Output is correct
32 Correct 311 ms 14520 KB Output is correct
33 Correct 313 ms 14076 KB Output is correct
34 Correct 148 ms 10548 KB Output is correct
35 Correct 317 ms 14280 KB Output is correct
36 Correct 323 ms 14520 KB Output is correct
37 Correct 188 ms 10984 KB Output is correct
38 Correct 338 ms 14408 KB Output is correct
39 Correct 47 ms 7716 KB Output is correct
40 Correct 339 ms 14536 KB Output is correct
41 Correct 233 ms 13024 KB Output is correct
42 Correct 301 ms 14536 KB Output is correct
43 Correct 98 ms 9072 KB Output is correct
44 Correct 295 ms 14408 KB Output is correct
45 Correct 56 ms 8168 KB Output is correct
46 Correct 307 ms 14408 KB Output is correct
47 Correct 83 ms 8548 KB Output is correct
48 Correct 311 ms 14408 KB Output is correct
49 Correct 517 ms 23136 KB Output is correct
50 Correct 547 ms 24228 KB Output is correct
51 Correct 404 ms 20728 KB Output is correct
52 Correct 545 ms 24328 KB Output is correct
53 Correct 230 ms 14824 KB Output is correct
54 Correct 543 ms 24328 KB Output is correct
55 Correct 456 ms 22772 KB Output is correct
56 Correct 533 ms 24328 KB Output is correct
57 Correct 75 ms 9092 KB Output is correct
58 Correct 538 ms 24328 KB Output is correct
59 Correct 326 ms 16744 KB Output is correct
60 Correct 536 ms 24356 KB Output is correct
61 Correct 376 ms 24208 KB Output is correct
62 Correct 351 ms 24132 KB Output is correct
63 Correct 332 ms 24304 KB Output is correct
64 Correct 358 ms 24252 KB Output is correct
65 Correct 373 ms 24200 KB Output is correct
66 Correct 389 ms 24132 KB Output is correct
67 Correct 349 ms 24204 KB Output is correct
68 Correct 347 ms 24200 KB Output is correct
69 Correct 346 ms 24116 KB Output is correct
70 Correct 349 ms 24356 KB Output is correct
71 Correct 341 ms 24200 KB Output is correct
72 Correct 328 ms 24204 KB Output is correct
73 Correct 849 ms 26824 KB Output is correct
74 Correct 581 ms 24688 KB Output is correct
75 Correct 824 ms 25828 KB Output is correct
76 Correct 1040 ms 29192 KB Output is correct
77 Correct 541 ms 19432 KB Output is correct
78 Correct 947 ms 27592 KB Output is correct
79 Correct 955 ms 27764 KB Output is correct
80 Correct 1043 ms 29244 KB Output is correct
81 Correct 468 ms 16720 KB Output is correct
82 Correct 788 ms 26632 KB Output is correct
83 Correct 792 ms 23324 KB Output is correct
84 Correct 1027 ms 29424 KB Output is correct
85 Correct 618 ms 27120 KB Output is correct
86 Correct 787 ms 29168 KB Output is correct
87 Correct 386 ms 24944 KB Output is correct
88 Correct 777 ms 29320 KB Output is correct
89 Correct 690 ms 27888 KB Output is correct
90 Correct 835 ms 29168 KB Output is correct
91 Correct 543 ms 25736 KB Output is correct
92 Correct 807 ms 29064 KB Output is correct
93 Correct 417 ms 24936 KB Output is correct
94 Correct 770 ms 29236 KB Output is correct
95 Correct 456 ms 25468 KB Output is correct
96 Correct 767 ms 29192 KB Output is correct