oj.uz

답안 #776734

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
776734 2023-07-08T08:08:15 Z bachhoangxuan Two Antennas (JOI19_antennas) C++17
100 / 100
 324 ms 44484 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9+1;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
int n,h[maxn],a[maxn],b[maxn],ans[maxn];
vector<pii> query[maxn],add[maxn];

struct node{
    int Max=0,Min=inf,res=-1,lMax=0,lMin=inf;
    node(){}
    friend node operator+(node a,node b){
        node res;
        res.Max=max(a.Max,b.Max);
        res.Min=min(a.Min,b.Min);
        res.res=max(a.res,b.res);
        return res;
    }
};
namespace Segtree{
    node tree[4*maxn];
    void getnew(int id,int Max,int Min){
        if(tree[id].Max==0) return;
        tree[id].lMax=max(tree[id].lMax,Max);
        tree[id].lMin=min(tree[id].lMin,Min);
        tree[id].res=max(tree[id].res,max(tree[id].Max-tree[id].lMin,tree[id].lMax-tree[id].Min));
    }
    void pushdown(int id){
        if(tree[id].lMax==0) return;
        getnew(id<<1,tree[id].lMax,tree[id].lMin);
        getnew(id<<1|1,tree[id].lMax,tree[id].lMin);
        tree[id].lMax=0;tree[id].lMin=inf;
    }
    void update_pos(int l,int r,int id,int p,int val){
        if(l==r){
            if(val) tree[id].Max=tree[id].Min=h[p];
            else tree[id].Max=0,tree[id].Min=inf;
            return;
        }
        pushdown(id);
        int mid=(l+r)>>1;
        if(p<=mid) update_pos(l,mid,id<<1,p,val);
        else update_pos(mid+1,r,id<<1|1,p,val);
        tree[id]=tree[id<<1]+tree[id<<1|1];
    }
    void update(int l,int r,int id,int tl,int tr,int val){
        if(tr<l || r<tl) return;
        if(tl<=l && r<=tr){
            getnew(id,val,val);
            return;
        }
        pushdown(id);
        int mid=(l+r)>>1;
        update(l,mid,id<<1,tl,tr,val);update(mid+1,r,id<<1|1,tl,tr,val);
        tree[id]=tree[id<<1]+tree[id<<1|1];
    }
    int query(int l,int r,int id,int tl,int tr){
        if(tr<l || r<tl) return -1;
        if(tl<=l && r<=tr) return tree[id].res;
        pushdown(id);
        int mid=(l+r)>>1;
        return max(query(l,mid,id<<1,tl,tr),query(mid+1,r,id<<1|1,tl,tr));
    }
}
void solve(){
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> h[i] >> a[i] >> b[i];
        int l=i+a[i],r=i+b[i];
        if(l<=n) add[l].push_back({i,1});
        if(r<n) add[r+1].push_back({i,0});
    }
    int q;cin >> q;
    for(int i=1;i<=q;i++){
        int l,r;cin >> l >> r;
        query[r].push_back({l,i});
    }
    for(int i=1;i<=n;i++){
        for(auto &[p,val]:add[i]) Segtree::update_pos(1,n,1,p,val);
        int lt=max(1,i-b[i]),rt=i-a[i];
        //cout << lt << ' ' << rt << ' ' << i << '\n';
        if(lt<=rt) Segtree::update(1,n,1,lt,rt,h[i]);
        for(auto &[l,id]:query[i]) ans[id]=Segtree::query(1,n,1,l,i);
    }
    for(int i=1;i<=q;i++) cout << ans[i] << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 25300 KB Output is correct
2 Correct 11 ms 25388 KB Output is correct
3 Correct 12 ms 25324 KB Output is correct
4 Correct 11 ms 25376 KB Output is correct
5 Correct 12 ms 25384 KB Output is correct
6 Correct 12 ms 25300 KB Output is correct
7 Correct 12 ms 25300 KB Output is correct
8 Correct 11 ms 25384 KB Output is correct
9 Correct 11 ms 25300 KB Output is correct
10 Correct 11 ms 25376 KB Output is correct
11 Correct 12 ms 25392 KB Output is correct
12 Correct 13 ms 25300 KB Output is correct
13 Correct 11 ms 25328 KB Output is correct
14 Correct 13 ms 25388 KB Output is correct
15 Correct 12 ms 25300 KB Output is correct
16 Correct 12 ms 25300 KB Output is correct
17 Correct 12 ms 25388 KB Output is correct
18 Correct 12 ms 25300 KB Output is correct
19 Correct 11 ms 25300 KB Output is correct
20 Correct 13 ms 25300 KB Output is correct
21 Correct 11 ms 25332 KB Output is correct
22 Correct 11 ms 25380 KB Output is correct
23 Correct 11 ms 25300 KB Output is correct
24 Correct 12 ms 25388 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 25300 KB Output is correct
2 Correct 11 ms 25388 KB Output is correct
3 Correct 12 ms 25324 KB Output is correct
4 Correct 11 ms 25376 KB Output is correct
5 Correct 12 ms 25384 KB Output is correct
6 Correct 12 ms 25300 KB Output is correct
7 Correct 12 ms 25300 KB Output is correct
8 Correct 11 ms 25384 KB Output is correct
9 Correct 11 ms 25300 KB Output is correct
10 Correct 11 ms 25376 KB Output is correct
11 Correct 12 ms 25392 KB Output is correct
12 Correct 13 ms 25300 KB Output is correct
13 Correct 11 ms 25328 KB Output is correct
14 Correct 13 ms 25388 KB Output is correct
15 Correct 12 ms 25300 KB Output is correct
16 Correct 12 ms 25300 KB Output is correct
17 Correct 12 ms 25388 KB Output is correct
18 Correct 12 ms 25300 KB Output is correct
19 Correct 11 ms 25300 KB Output is correct
20 Correct 13 ms 25300 KB Output is correct
21 Correct 11 ms 25332 KB Output is correct
22 Correct 11 ms 25380 KB Output is correct
23 Correct 11 ms 25300 KB Output is correct
24 Correct 12 ms 25388 KB Output is correct
25 Correct 57 ms 30128 KB Output is correct
26 Correct 17 ms 26008 KB Output is correct
27 Correct 83 ms 32244 KB Output is correct
28 Correct 83 ms 32304 KB Output is correct
29 Correct 67 ms 30176 KB Output is correct
30 Correct 59 ms 29900 KB Output is correct
31 Correct 65 ms 31360 KB Output is correct
32 Correct 83 ms 32304 KB Output is correct
33 Correct 74 ms 31760 KB Output is correct
34 Correct 47 ms 28628 KB Output is correct
35 Correct 80 ms 32076 KB Output is correct
36 Correct 82 ms 32208 KB Output is correct
37 Correct 51 ms 28828 KB Output is correct
38 Correct 79 ms 31308 KB Output is correct
39 Correct 21 ms 26280 KB Output is correct
40 Correct 78 ms 31240 KB Output is correct
41 Correct 61 ms 29644 KB Output is correct
42 Correct 79 ms 31272 KB Output is correct
43 Correct 35 ms 27328 KB Output is correct
44 Correct 79 ms 31360 KB Output is correct
45 Correct 23 ms 26468 KB Output is correct
46 Correct 79 ms 31348 KB Output is correct
47 Correct 34 ms 26924 KB Output is correct
48 Correct 80 ms 31328 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 148 ms 34380 KB Output is correct
2 Correct 168 ms 35284 KB Output is correct
3 Correct 118 ms 32372 KB Output is correct
4 Correct 167 ms 35404 KB Output is correct
5 Correct 78 ms 29876 KB Output is correct
6 Correct 170 ms 35388 KB Output is correct
7 Correct 145 ms 33948 KB Output is correct
8 Correct 174 ms 35412 KB Output is correct
9 Correct 32 ms 26836 KB Output is correct
10 Correct 184 ms 35460 KB Output is correct
11 Correct 107 ms 31564 KB Output is correct
12 Correct 168 ms 35396 KB Output is correct
13 Correct 111 ms 33980 KB Output is correct
14 Correct 104 ms 33948 KB Output is correct
15 Correct 105 ms 34020 KB Output is correct
16 Correct 95 ms 34588 KB Output is correct
17 Correct 112 ms 34172 KB Output is correct
18 Correct 104 ms 34580 KB Output is correct
19 Correct 107 ms 33876 KB Output is correct
20 Correct 104 ms 33972 KB Output is correct
21 Correct 100 ms 33428 KB Output is correct
22 Correct 107 ms 33888 KB Output is correct
23 Correct 130 ms 33868 KB Output is correct
24 Correct 100 ms 34116 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 25300 KB Output is correct
2 Correct 11 ms 25388 KB Output is correct
3 Correct 12 ms 25324 KB Output is correct
4 Correct 11 ms 25376 KB Output is correct
5 Correct 12 ms 25384 KB Output is correct
6 Correct 12 ms 25300 KB Output is correct
7 Correct 12 ms 25300 KB Output is correct
8 Correct 11 ms 25384 KB Output is correct
9 Correct 11 ms 25300 KB Output is correct
10 Correct 11 ms 25376 KB Output is correct
11 Correct 12 ms 25392 KB Output is correct
12 Correct 13 ms 25300 KB Output is correct
13 Correct 11 ms 25328 KB Output is correct
14 Correct 13 ms 25388 KB Output is correct
15 Correct 12 ms 25300 KB Output is correct
16 Correct 12 ms 25300 KB Output is correct
17 Correct 12 ms 25388 KB Output is correct
18 Correct 12 ms 25300 KB Output is correct
19 Correct 11 ms 25300 KB Output is correct
20 Correct 13 ms 25300 KB Output is correct
21 Correct 11 ms 25332 KB Output is correct
22 Correct 11 ms 25380 KB Output is correct
23 Correct 11 ms 25300 KB Output is correct
24 Correct 12 ms 25388 KB Output is correct
25 Correct 57 ms 30128 KB Output is correct
26 Correct 17 ms 26008 KB Output is correct
27 Correct 83 ms 32244 KB Output is correct
28 Correct 83 ms 32304 KB Output is correct
29 Correct 67 ms 30176 KB Output is correct
30 Correct 59 ms 29900 KB Output is correct
31 Correct 65 ms 31360 KB Output is correct
32 Correct 83 ms 32304 KB Output is correct
33 Correct 74 ms 31760 KB Output is correct
34 Correct 47 ms 28628 KB Output is correct
35 Correct 80 ms 32076 KB Output is correct
36 Correct 82 ms 32208 KB Output is correct
37 Correct 51 ms 28828 KB Output is correct
38 Correct 79 ms 31308 KB Output is correct
39 Correct 21 ms 26280 KB Output is correct
40 Correct 78 ms 31240 KB Output is correct
41 Correct 61 ms 29644 KB Output is correct
42 Correct 79 ms 31272 KB Output is correct
43 Correct 35 ms 27328 KB Output is correct
44 Correct 79 ms 31360 KB Output is correct
45 Correct 23 ms 26468 KB Output is correct
46 Correct 79 ms 31348 KB Output is correct
47 Correct 34 ms 26924 KB Output is correct
48 Correct 80 ms 31328 KB Output is correct
49 Correct 148 ms 34380 KB Output is correct
50 Correct 168 ms 35284 KB Output is correct
51 Correct 118 ms 32372 KB Output is correct
52 Correct 167 ms 35404 KB Output is correct
53 Correct 78 ms 29876 KB Output is correct
54 Correct 170 ms 35388 KB Output is correct
55 Correct 145 ms 33948 KB Output is correct
56 Correct 174 ms 35412 KB Output is correct
57 Correct 32 ms 26836 KB Output is correct
58 Correct 184 ms 35460 KB Output is correct
59 Correct 107 ms 31564 KB Output is correct
60 Correct 168 ms 35396 KB Output is correct
61 Correct 111 ms 33980 KB Output is correct
62 Correct 104 ms 33948 KB Output is correct
63 Correct 105 ms 34020 KB Output is correct
64 Correct 95 ms 34588 KB Output is correct
65 Correct 112 ms 34172 KB Output is correct
66 Correct 104 ms 34580 KB Output is correct
67 Correct 107 ms 33876 KB Output is correct
68 Correct 104 ms 33972 KB Output is correct
69 Correct 100 ms 33428 KB Output is correct
70 Correct 107 ms 33888 KB Output is correct
71 Correct 130 ms 33868 KB Output is correct
72 Correct 100 ms 34116 KB Output is correct
73 Correct 265 ms 41236 KB Output is correct
74 Correct 212 ms 36300 KB Output is correct
75 Correct 249 ms 41004 KB Output is correct
76 Correct 324 ms 44436 KB Output is correct
77 Correct 184 ms 36044 KB Output is correct
78 Correct 269 ms 41620 KB Output is correct
79 Correct 287 ms 42916 KB Output is correct
80 Correct 320 ms 44428 KB Output is correct
81 Correct 137 ms 34312 KB Output is correct
82 Correct 249 ms 40008 KB Output is correct
83 Correct 233 ms 40076 KB Output is correct
84 Correct 318 ms 44484 KB Output is correct
85 Correct 185 ms 38768 KB Output is correct
86 Correct 238 ms 41848 KB Output is correct
87 Correct 123 ms 35348 KB Output is correct
88 Correct 221 ms 42536 KB Output is correct
89 Correct 213 ms 40156 KB Output is correct
90 Correct 228 ms 42440 KB Output is correct
91 Correct 152 ms 36884 KB Output is correct
92 Correct 232 ms 41824 KB Output is correct
93 Correct 124 ms 35044 KB Output is correct
94 Correct 232 ms 41796 KB Output is correct
95 Correct 142 ms 36164 KB Output is correct
96 Correct 228 ms 42008 KB Output is correct