oj.uz

답안 #706865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
706865 2023-03-07T23:23:44 Z Antekb Two Antennas (JOI19_antennas) C++14
100 / 100
 415 ms 41852 KB 
    #include<bits/stdc++.h>
     
    //#pragma GCC optimize("Ofast")
    //#pragma GCC optimize("trapv")
     
    #define st first
    #define nd second
    #define pb push_back
    #define eb emplace_back
    #define pp(x) pop_back(x)
    #define mp(a, b) make_pair(a, b)
    #define all(x) (x).begin(), (x).end()
    #define rev(x) reverse(all(x))
    #define sor(x) sort(all(x))
    #define sz(x) (int)(x).size()
    #define rsz(x) resize(x)
     
    using namespace std;
     
    ///~~~~~~~~~~~~~~~~~~~~~~~~~~
     
    template <typename H, typename T> 
    ostream& operator<<(ostream& os, pair<H, T> m){
    	return os <<"("<< m.st<<", "<<m.nd<<")";
    }
    template <typename H> 
    ostream& operator<<(ostream& os, vector<H> V){
    	os<<"{";
    	for(int i=0; i<V.size(); i++){
    		if(i)os<<" ";
    		os<<V[i];
    	}
    	os<<"}";
    	return os;
    }
     
    void debug(){cerr<<"\n";}
    template <typename H, typename... T>
    void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
    #define deb(x...) cerr<<#x<<" = ";debug(x);
    //#define deb(x...) ;
     
    ///~~~~~~~~~~~~~~~~~~~~~~~~~
     
    typedef long long ll;
    typedef long double ld;
    typedef pair<int, int> pii;
    typedef pair<ll, ll> pll;
    typedef vector<int> vi;
    typedef vector<pii > vii;
    typedef vector<ll> vl;
    typedef vector<pll> vll;
    typedef string str;
     
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace __gnu_pbds;
    template <typename T>
    using ordered_set =
        tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
     
     
    #define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
     
    mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
     
    const int K=18, N=1<<K, INF=1e9+5, mod2=1e9+7, mod=998244353;
     
    struct modint{
    	int n=0;
    	modint(){}
    	modint(ll x){
    		n=x%mod;
    		if(n<0)n+=mod;
    	}
    	operator int(){
    		return n;
    	}
    	modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
    	modint operator+=(modint a){return (*this)=(*this)+a;}
    	modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
    	modint operator-=(modint a){return (*this)=(*this)-a;}
    	modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
    	modint operator*=(modint a){return (*this)=(*this)*a;}
    	modint operator^(const ll &m)const{
    		modint a(1);
    		if(m==0)return a;
    		if(m==1)return (*this);
    		a=(*this)^(m/2);
    		a*=a;
    		return a*((*this)^(m&1));
    	}
    	modint odw(){
    		return (*this)^((ll)mod-2);
    	}
    	modint operator/(modint a){return (*this)*a.odw();}
    	modint operator/=(modint a){return (*this)=(*this)/a;}
    	bool operator==(modint a){return a.n==n;}
    	friend ostream& operator<<(ostream& os, modint m) {
    		return os << m.n; 
    	}
    };
    modint fact[N], fact2[N];
    typedef vector<modint> vm;
    void factinit(){
        fact[0]=1;
        for(int i=1; i<N; i++){
            fact[i]=(fact[i-1]*modint(i))%mod;
        }
        fact2[N-1]=fact[N-1].odw();
        for(int i=N-2; i>=0; i--){
        	fact2[i]=(fact2[i+1]*modint(i+1))%mod;
        }
    }
    modint npok(int _n, int _k){
        return fact[_n]*fact2[_k]*fact2[_n-_k];
    }
    int ama[N+N], ami[N+N], ans[N+N], res[N], A[N], B[N], H[N], la[N+N], li[N+N];
    vi todo[N], toundo[N];
    void init(){
    	for(int i=0; i<N+N; i++){
    		ama[i]=la[i]=-INF;
    		ami[i]=li[i]=INF;
    		ans[i]=-1;
    	}
    }
    void prop(int v){
    	if(v<N && la[v]!=-INF){
    	int l=v+v, r=l+1;
    	//deb(v, l, ans[l], r, ans[r])
    	la[l]=max(la[l], la[v]);
    	li[l]=min(li[l], li[v]);
    	ans[l]=max(ans[l], ama[l]-li[v]);
    	ans[l]=max(ans[l], la[v]-ami[l]);
     
    	la[r]=max(la[r], la[v]);
    	li[r]=min(li[r], li[v]);
    	ans[r]=max(ans[r], ama[r]-li[v]);
    	ans[r]=max(ans[r], la[v]-ami[r]);
    	//deb(v, l, ans[l], r, ans[r], ama[r], ami[r])
    	}
    	li[v]=INF;
    	la[v]=-INF;
    }
    void propup(int v){
    	if(v/2)propup(v/2);
    	prop(v);
    }
    void act(int i, int czy){
    	//deb(i, czy);
    	i+=N;
    	propup(i);
    	if(czy==-1)ama[i]=-INF, ami[i]=INF;
    	else ama[i]=ami[i]=H[i-N];
    	for(i>>=1; i; i>>=1){
    		ama[i]=max(ama[i+i], ama[i+i+1]);
    		ami[i]=min(ami[i+i], ami[i+i+1]);
    	}
    }
    void upd(int v, int L, int R, int l, int r, int c){
    	if(L==l && r==R){
    		//deb(v, ama[v], ami[v], c);
    		la[v]=max(la[v], c);
    		li[v]=min(li[v], c);
    		ans[v]=max(ans[v], ama[v]-c);
    		ans[v]=max(ans[v], c-ami[v]);
    		//deb(v, ans[v]);
    		return;
    	}
    	int M=(L+R)>>1;
    	prop(v);
    	if(l<=M)upd(v+v, L, M, l, min(r, M), c);
    	if(r>M)upd(v+v+1, M+1, R, max(M+1, l), r, c);
    	ans[v]=max(ans[v], ans[v+v]);
    	ans[v]=max(ans[v], ans[v+v+1]);
    }
    int quer(int v, int L, int R, int l, int r){
    	if(L==l && R==r){
    		//deb(v, la[v], li[v], ama[v], ami[v], ans[v]);
    		//deb(ans[v+v], ans[v+v+1])
    		return ans[v];
    	}
    	int M=(L+R)>>1;
    	prop(v);
    	int x=-1;
    	if(l<=M)x=max(x ,quer(v+v, L, M, l, min(r, M)));
    	if(r>M)x=max(x, quer(v+v+1, M+1, R, max(M+1, l), r));
    	return x;
    }
    int main(){
    	init();
    	//factinit();
    	BOOST;
    	int n;
    	cin>>n;
    	for(int i=0; i<n; i++){
    		cin>>H[i]>>A[i]>>B[i];
    		if(i+A[i]<n)todo[i+A[i]].pb(i);
    		if(i+B[i]<n)toundo[i+B[i]].pb(i);
    	}
    	int q;
    	cin>>q;
    	vector<pair<pii, int> > Q(q);
    	for(int i=0; i<q; i++){
    		Q[i].nd=i;
    		cin>>Q[i].st.nd>>Q[i].st.st;
    		Q[i].st.nd--;
    		Q[i].st.st--;
    	}
    	sor(Q);
    	int wsk=0;
    	for(int i=0; i<n; i++){
    		for(int j:todo[i])act(j, 1);
    		//deb(max(i-B[i], 0), i-A[i], H[i])
    		if(A[i]<=i)upd(1, 0, N-1, max(i-B[i], 0), i-A[i], H[i]);
    		while(wsk<q && Q[wsk].st.st==i){
    			//deb(Q[wsk]);
    			res[Q[wsk].nd]=quer(1 ,0, N-1, Q[wsk].st.nd, Q[wsk].st.st);
    			wsk++;
    		}
    		for(int j:toundo[i])act(j, -1);
    	}
    	for(int i=0; i<q; i++){
    		cout<<res[i]<<"\n";
    	}
    }

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24920 KB Output is correct
2 Correct 18 ms 24948 KB Output is correct
3 Correct 13 ms 24960 KB Output is correct
4 Correct 13 ms 24916 KB Output is correct
5 Correct 13 ms 24916 KB Output is correct
6 Correct 13 ms 24916 KB Output is correct
7 Correct 13 ms 24916 KB Output is correct
8 Correct 15 ms 24916 KB Output is correct
9 Correct 14 ms 24904 KB Output is correct
10 Correct 15 ms 24916 KB Output is correct
11 Correct 15 ms 24884 KB Output is correct
12 Correct 16 ms 24916 KB Output is correct
13 Correct 13 ms 24972 KB Output is correct
14 Correct 14 ms 24960 KB Output is correct
15 Correct 13 ms 24948 KB Output is correct
16 Correct 14 ms 24968 KB Output is correct
17 Correct 16 ms 24956 KB Output is correct
18 Correct 13 ms 24916 KB Output is correct
19 Correct 13 ms 24916 KB Output is correct
20 Correct 13 ms 24916 KB Output is correct
21 Correct 13 ms 24916 KB Output is correct
22 Correct 13 ms 24916 KB Output is correct
23 Correct 14 ms 24876 KB Output is correct
24 Correct 13 ms 24964 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24920 KB Output is correct
2 Correct 18 ms 24948 KB Output is correct
3 Correct 13 ms 24960 KB Output is correct
4 Correct 13 ms 24916 KB Output is correct
5 Correct 13 ms 24916 KB Output is correct
6 Correct 13 ms 24916 KB Output is correct
7 Correct 13 ms 24916 KB Output is correct
8 Correct 15 ms 24916 KB Output is correct
9 Correct 14 ms 24904 KB Output is correct
10 Correct 15 ms 24916 KB Output is correct
11 Correct 15 ms 24884 KB Output is correct
12 Correct 16 ms 24916 KB Output is correct
13 Correct 13 ms 24972 KB Output is correct
14 Correct 14 ms 24960 KB Output is correct
15 Correct 13 ms 24948 KB Output is correct
16 Correct 14 ms 24968 KB Output is correct
17 Correct 16 ms 24956 KB Output is correct
18 Correct 13 ms 24916 KB Output is correct
19 Correct 13 ms 24916 KB Output is correct
20 Correct 13 ms 24916 KB Output is correct
21 Correct 13 ms 24916 KB Output is correct
22 Correct 13 ms 24916 KB Output is correct
23 Correct 14 ms 24876 KB Output is correct
24 Correct 13 ms 24964 KB Output is correct
25 Correct 88 ms 29672 KB Output is correct
26 Correct 22 ms 25572 KB Output is correct
27 Correct 114 ms 31612 KB Output is correct
28 Correct 118 ms 31668 KB Output is correct
29 Correct 86 ms 29672 KB Output is correct
30 Correct 81 ms 29448 KB Output is correct
31 Correct 103 ms 31016 KB Output is correct
32 Correct 118 ms 31704 KB Output is correct
33 Correct 123 ms 31312 KB Output is correct
34 Correct 63 ms 28180 KB Output is correct
35 Correct 115 ms 31556 KB Output is correct
36 Correct 120 ms 31708 KB Output is correct
37 Correct 77 ms 28284 KB Output is correct
38 Correct 114 ms 30760 KB Output is correct
39 Correct 27 ms 25768 KB Output is correct
40 Correct 116 ms 30796 KB Output is correct
41 Correct 102 ms 29132 KB Output is correct
42 Correct 116 ms 30756 KB Output is correct
43 Correct 58 ms 26908 KB Output is correct
44 Correct 121 ms 30748 KB Output is correct
45 Correct 30 ms 25932 KB Output is correct
46 Correct 111 ms 30688 KB Output is correct
47 Correct 39 ms 26372 KB Output is correct
48 Correct 111 ms 30744 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 194 ms 31692 KB Output is correct
2 Correct 223 ms 32368 KB Output is correct
3 Correct 147 ms 30192 KB Output is correct
4 Correct 223 ms 32208 KB Output is correct
5 Correct 108 ms 28808 KB Output is correct
6 Correct 219 ms 32176 KB Output is correct
7 Correct 197 ms 31248 KB Output is correct
8 Correct 225 ms 32348 KB Output is correct
9 Correct 39 ms 26512 KB Output is correct
10 Correct 245 ms 35248 KB Output is correct
11 Correct 147 ms 31388 KB Output is correct
12 Correct 221 ms 35360 KB Output is correct
13 Correct 138 ms 32800 KB Output is correct
14 Correct 143 ms 32988 KB Output is correct
15 Correct 130 ms 33072 KB Output is correct
16 Correct 143 ms 33472 KB Output is correct
17 Correct 140 ms 33024 KB Output is correct
18 Correct 141 ms 33468 KB Output is correct
19 Correct 130 ms 32788 KB Output is correct
20 Correct 135 ms 32984 KB Output is correct
21 Correct 135 ms 32860 KB Output is correct
22 Correct 151 ms 33060 KB Output is correct
23 Correct 136 ms 32888 KB Output is correct
24 Correct 129 ms 32984 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24920 KB Output is correct
2 Correct 18 ms 24948 KB Output is correct
3 Correct 13 ms 24960 KB Output is correct
4 Correct 13 ms 24916 KB Output is correct
5 Correct 13 ms 24916 KB Output is correct
6 Correct 13 ms 24916 KB Output is correct
7 Correct 13 ms 24916 KB Output is correct
8 Correct 15 ms 24916 KB Output is correct
9 Correct 14 ms 24904 KB Output is correct
10 Correct 15 ms 24916 KB Output is correct
11 Correct 15 ms 24884 KB Output is correct
12 Correct 16 ms 24916 KB Output is correct
13 Correct 13 ms 24972 KB Output is correct
14 Correct 14 ms 24960 KB Output is correct
15 Correct 13 ms 24948 KB Output is correct
16 Correct 14 ms 24968 KB Output is correct
17 Correct 16 ms 24956 KB Output is correct
18 Correct 13 ms 24916 KB Output is correct
19 Correct 13 ms 24916 KB Output is correct
20 Correct 13 ms 24916 KB Output is correct
21 Correct 13 ms 24916 KB Output is correct
22 Correct 13 ms 24916 KB Output is correct
23 Correct 14 ms 24876 KB Output is correct
24 Correct 13 ms 24964 KB Output is correct
25 Correct 88 ms 29672 KB Output is correct
26 Correct 22 ms 25572 KB Output is correct
27 Correct 114 ms 31612 KB Output is correct
28 Correct 118 ms 31668 KB Output is correct
29 Correct 86 ms 29672 KB Output is correct
30 Correct 81 ms 29448 KB Output is correct
31 Correct 103 ms 31016 KB Output is correct
32 Correct 118 ms 31704 KB Output is correct
33 Correct 123 ms 31312 KB Output is correct
34 Correct 63 ms 28180 KB Output is correct
35 Correct 115 ms 31556 KB Output is correct
36 Correct 120 ms 31708 KB Output is correct
37 Correct 77 ms 28284 KB Output is correct
38 Correct 114 ms 30760 KB Output is correct
39 Correct 27 ms 25768 KB Output is correct
40 Correct 116 ms 30796 KB Output is correct
41 Correct 102 ms 29132 KB Output is correct
42 Correct 116 ms 30756 KB Output is correct
43 Correct 58 ms 26908 KB Output is correct
44 Correct 121 ms 30748 KB Output is correct
45 Correct 30 ms 25932 KB Output is correct
46 Correct 111 ms 30688 KB Output is correct
47 Correct 39 ms 26372 KB Output is correct
48 Correct 111 ms 30744 KB Output is correct
49 Correct 194 ms 31692 KB Output is correct
50 Correct 223 ms 32368 KB Output is correct
51 Correct 147 ms 30192 KB Output is correct
52 Correct 223 ms 32208 KB Output is correct
53 Correct 108 ms 28808 KB Output is correct
54 Correct 219 ms 32176 KB Output is correct
55 Correct 197 ms 31248 KB Output is correct
56 Correct 225 ms 32348 KB Output is correct
57 Correct 39 ms 26512 KB Output is correct
58 Correct 245 ms 35248 KB Output is correct
59 Correct 147 ms 31388 KB Output is correct
60 Correct 221 ms 35360 KB Output is correct
61 Correct 138 ms 32800 KB Output is correct
62 Correct 143 ms 32988 KB Output is correct
63 Correct 130 ms 33072 KB Output is correct
64 Correct 143 ms 33472 KB Output is correct
65 Correct 140 ms 33024 KB Output is correct
66 Correct 141 ms 33468 KB Output is correct
67 Correct 130 ms 32788 KB Output is correct
68 Correct 135 ms 32984 KB Output is correct
69 Correct 135 ms 32860 KB Output is correct
70 Correct 151 ms 33060 KB Output is correct
71 Correct 136 ms 32888 KB Output is correct
72 Correct 129 ms 32984 KB Output is correct
73 Correct 325 ms 39872 KB Output is correct
74 Correct 239 ms 35824 KB Output is correct
75 Correct 300 ms 39740 KB Output is correct
76 Correct 394 ms 41852 KB Output is correct
77 Correct 203 ms 35076 KB Output is correct
78 Correct 341 ms 39924 KB Output is correct
79 Correct 380 ms 40952 KB Output is correct
80 Correct 415 ms 41684 KB Output is correct
81 Correct 165 ms 33572 KB Output is correct
82 Correct 316 ms 39040 KB Output is correct
83 Correct 315 ms 38928 KB Output is correct
84 Correct 402 ms 41532 KB Output is correct
85 Correct 246 ms 36036 KB Output is correct
86 Correct 278 ms 37712 KB Output is correct
87 Correct 161 ms 33864 KB Output is correct
88 Correct 281 ms 38276 KB Output is correct
89 Correct 250 ms 36736 KB Output is correct
90 Correct 278 ms 38180 KB Output is correct
91 Correct 199 ms 34692 KB Output is correct
92 Correct 288 ms 37724 KB Output is correct
93 Correct 178 ms 33848 KB Output is correct
94 Correct 282 ms 37428 KB Output is correct
95 Correct 177 ms 34288 KB Output is correct
96 Correct 282 ms 37228 KB Output is correct