oj.uz

답안 #934185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
934185 2024-02-26T23:20:24 Z AdamGS Two Antennas (JOI19_antennas) C++17
100 / 100
 595 ms 58604 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll INF=1e18+7;
const int LIM=2e5+7;
struct Node {
  ll val, lazy, mi;
};
Node tr[4*LIM];
vector<ll>V[LIM], wlacz[LIM], wylacz[LIM];
ll T[LIM], wynik[LIM], A[LIM], B[LIM], N=1;
pair<ll,ll>pyt[LIM];
void spl(int v) {
  tr[2*v].lazy=max(tr[2*v].lazy, tr[v].lazy);
  tr[2*v+1].lazy=max(tr[2*v+1].lazy, tr[v].lazy);
  tr[2*v].val=max(tr[2*v].val, tr[2*v].lazy-tr[2*v].mi);
  tr[2*v+1].val=max(tr[2*v+1].val, tr[2*v+1].lazy-tr[2*v+1].mi);
  tr[v].lazy=-INF;
}
void maxuj(int v, int l, int r, int a, int b, ll x) {
  if(r<a || b<l) return;
  if(a<=l && r<=b) {
    tr[v].lazy=max(tr[v].lazy, x);
    tr[v].val=max(tr[v].val, tr[v].lazy-tr[v].mi);
    return;
  }
  if(tr[v].lazy!=-INF) spl(v);
  int mid=(l+r)/2;
  maxuj(2*v, l, mid, a, b, x);
  maxuj(2*v+1, mid+1, r, a, b, x);
  tr[v].val=max(tr[2*v].val, tr[2*v+1].val);
  tr[v].mi=min(tr[2*v].mi, tr[2*v+1].mi);
}
void upd(int v, int l, int r, int a, ll x) {
  if(r<a || a<l) return;
  if(l==r) {
    tr[v].mi=x;
    tr[v].lazy=-INF;
    return;
  }
  if(tr[v].lazy!=-INF) spl(v);
  int mid=(l+r)/2;
  upd(2*v, l, mid, a, x);
  upd(2*v+1, mid+1, r, a, x);
  tr[v].val=max(tr[2*v].val, tr[2*v+1].val);
  tr[v].mi=min(tr[2*v].mi, tr[2*v+1].mi);
}
ll cnt(int v, int l, int r, int a, int b) {
  if(r<a || b<l) return -INF;
  if(a<=l && r<=b) return tr[v].val;
  if(tr[v].lazy!=-INF) spl(v);
  int mid=(l+r)/2;
  return max(cnt(2*v, l, mid, a, b), cnt(2*v+1, mid+1, r, a, b));
}
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  ll n;
  cin >> n;
  while(N<n) N*=2;
  rep(i, 2*N) {
    tr[i].val=tr[i].lazy=-INF;
    tr[i].mi=INF;
  }
  rep(i, n) {
    cin >> T[i] >> A[i] >> B[i];
    if(i+A[i]<n) wlacz[i+A[i]].pb(i);
    if(i+B[i]+1<n) wylacz[i+B[i]+1].pb(i);
  }
  ll q;
  cin >> q;
  rep(i, q) {
    cin >> pyt[i].st >> pyt[i].nd; --pyt[i].st; --pyt[i].nd;
    wynik[i]=-1;
    V[pyt[i].nd].pb(i);
  }
  rep(i, n) {
    for(auto j : wlacz[i]) upd(1, 0, N-1, j, T[j]);
    for(auto j : wylacz[i]) upd(1, 0, N-1, j, INF);
    maxuj(1, 0, N-1, i-B[i], i-A[i], T[i]);
    for(auto j : V[i]) wynik[j]=max(wynik[j], cnt(1, 0, N-1, pyt[j].st, pyt[j].nd));
  }
  rep(i, n) {
    V[i].clear();
    wlacz[i].clear();
    wylacz[i].clear();
  }
  rep(i, 2*N) {
    tr[i].val=tr[i].lazy=-INF;
    tr[i].mi=INF;
  }
  rep(i, n/2) {
    swap(T[i], T[n-i-1]);
    swap(A[i], A[n-i-1]);
    swap(B[i], B[n-i-1]);
  }
  rep(i, q) {
    pyt[i].st=n-pyt[i].st-1;
    pyt[i].nd=n-pyt[i].nd-1;
    swap(pyt[i].st, pyt[i].nd);
  }
  rep(i, n) {
    if(i+A[i]<n) wlacz[i+A[i]].pb(i);
    if(i+B[i]+1<n) wylacz[i+B[i]+1].pb(i);
  }
  rep(i, q) V[pyt[i].nd].pb(i);
  rep(i, n) {
    for(auto j : wlacz[i]) upd(1, 0, N-1, j, T[j]);
    for(auto j : wylacz[i]) upd(1, 0, N-1, j, INF);
    maxuj(1, 0, N-1, i-B[i], i-A[i], T[i]);
    for(auto j : V[i]) wynik[j]=max(wynik[j], cnt(1, 0, N-1, pyt[j].st, pyt[j].nd));
  }
  rep(i, q) cout << wynik[i] << '\n';
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 22876 KB Output is correct
2 Correct 5 ms 22876 KB Output is correct
3 Correct 5 ms 22876 KB Output is correct
4 Correct 5 ms 22876 KB Output is correct
5 Correct 5 ms 22876 KB Output is correct
6 Correct 6 ms 22872 KB Output is correct
7 Correct 5 ms 22876 KB Output is correct
8 Correct 5 ms 22876 KB Output is correct
9 Correct 6 ms 22876 KB Output is correct
10 Correct 5 ms 22984 KB Output is correct
11 Correct 5 ms 23028 KB Output is correct
12 Correct 5 ms 22876 KB Output is correct
13 Correct 5 ms 22876 KB Output is correct
14 Correct 6 ms 22876 KB Output is correct
15 Correct 5 ms 22876 KB Output is correct
16 Correct 5 ms 22876 KB Output is correct
17 Correct 5 ms 23032 KB Output is correct
18 Correct 5 ms 22876 KB Output is correct
19 Correct 4 ms 22876 KB Output is correct
20 Correct 4 ms 22876 KB Output is correct
21 Correct 4 ms 23128 KB Output is correct
22 Correct 5 ms 22876 KB Output is correct
23 Correct 6 ms 22876 KB Output is correct
24 Correct 6 ms 22876 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 22876 KB Output is correct
2 Correct 5 ms 22876 KB Output is correct
3 Correct 5 ms 22876 KB Output is correct
4 Correct 5 ms 22876 KB Output is correct
5 Correct 5 ms 22876 KB Output is correct
6 Correct 6 ms 22872 KB Output is correct
7 Correct 5 ms 22876 KB Output is correct
8 Correct 5 ms 22876 KB Output is correct
9 Correct 6 ms 22876 KB Output is correct
10 Correct 5 ms 22984 KB Output is correct
11 Correct 5 ms 23028 KB Output is correct
12 Correct 5 ms 22876 KB Output is correct
13 Correct 5 ms 22876 KB Output is correct
14 Correct 6 ms 22876 KB Output is correct
15 Correct 5 ms 22876 KB Output is correct
16 Correct 5 ms 22876 KB Output is correct
17 Correct 5 ms 23032 KB Output is correct
18 Correct 5 ms 22876 KB Output is correct
19 Correct 4 ms 22876 KB Output is correct
20 Correct 4 ms 22876 KB Output is correct
21 Correct 4 ms 23128 KB Output is correct
22 Correct 5 ms 22876 KB Output is correct
23 Correct 6 ms 22876 KB Output is correct
24 Correct 6 ms 22876 KB Output is correct
25 Correct 78 ms 29956 KB Output is correct
26 Correct 15 ms 25692 KB Output is correct
27 Correct 110 ms 31980 KB Output is correct
28 Correct 119 ms 32068 KB Output is correct
29 Correct 80 ms 30324 KB Output is correct
30 Correct 75 ms 29980 KB Output is correct
31 Correct 82 ms 31220 KB Output is correct
32 Correct 107 ms 31824 KB Output is correct
33 Correct 107 ms 31836 KB Output is correct
34 Correct 56 ms 28504 KB Output is correct
35 Correct 106 ms 32220 KB Output is correct
36 Correct 111 ms 31824 KB Output is correct
37 Correct 66 ms 28564 KB Output is correct
38 Correct 105 ms 30804 KB Output is correct
39 Correct 24 ms 26408 KB Output is correct
40 Correct 111 ms 30800 KB Output is correct
41 Correct 90 ms 29720 KB Output is correct
42 Correct 105 ms 30944 KB Output is correct
43 Correct 40 ms 27220 KB Output is correct
44 Correct 104 ms 31060 KB Output is correct
45 Correct 24 ms 26204 KB Output is correct
46 Correct 126 ms 30928 KB Output is correct
47 Correct 32 ms 26648 KB Output is correct
48 Correct 124 ms 30800 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 240 ms 42708 KB Output is correct
2 Correct 287 ms 45396 KB Output is correct
3 Correct 185 ms 42324 KB Output is correct
4 Correct 366 ms 45560 KB Output is correct
5 Correct 115 ms 33620 KB Output is correct
6 Correct 309 ms 45628 KB Output is correct
7 Correct 235 ms 44156 KB Output is correct
8 Correct 356 ms 45476 KB Output is correct
9 Correct 45 ms 26832 KB Output is correct
10 Correct 278 ms 45648 KB Output is correct
11 Correct 157 ms 35444 KB Output is correct
12 Correct 294 ms 45612 KB Output is correct
13 Correct 187 ms 44704 KB Output is correct
14 Correct 171 ms 44272 KB Output is correct
15 Correct 173 ms 43704 KB Output is correct
16 Correct 176 ms 43432 KB Output is correct
17 Correct 194 ms 45236 KB Output is correct
18 Correct 184 ms 44156 KB Output is correct
19 Correct 182 ms 44228 KB Output is correct
20 Correct 176 ms 44256 KB Output is correct
21 Correct 175 ms 44404 KB Output is correct
22 Correct 175 ms 44212 KB Output is correct
23 Correct 176 ms 44352 KB Output is correct
24 Correct 161 ms 42836 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 22876 KB Output is correct
2 Correct 5 ms 22876 KB Output is correct
3 Correct 5 ms 22876 KB Output is correct
4 Correct 5 ms 22876 KB Output is correct
5 Correct 5 ms 22876 KB Output is correct
6 Correct 6 ms 22872 KB Output is correct
7 Correct 5 ms 22876 KB Output is correct
8 Correct 5 ms 22876 KB Output is correct
9 Correct 6 ms 22876 KB Output is correct
10 Correct 5 ms 22984 KB Output is correct
11 Correct 5 ms 23028 KB Output is correct
12 Correct 5 ms 22876 KB Output is correct
13 Correct 5 ms 22876 KB Output is correct
14 Correct 6 ms 22876 KB Output is correct
15 Correct 5 ms 22876 KB Output is correct
16 Correct 5 ms 22876 KB Output is correct
17 Correct 5 ms 23032 KB Output is correct
18 Correct 5 ms 22876 KB Output is correct
19 Correct 4 ms 22876 KB Output is correct
20 Correct 4 ms 22876 KB Output is correct
21 Correct 4 ms 23128 KB Output is correct
22 Correct 5 ms 22876 KB Output is correct
23 Correct 6 ms 22876 KB Output is correct
24 Correct 6 ms 22876 KB Output is correct
25 Correct 78 ms 29956 KB Output is correct
26 Correct 15 ms 25692 KB Output is correct
27 Correct 110 ms 31980 KB Output is correct
28 Correct 119 ms 32068 KB Output is correct
29 Correct 80 ms 30324 KB Output is correct
30 Correct 75 ms 29980 KB Output is correct
31 Correct 82 ms 31220 KB Output is correct
32 Correct 107 ms 31824 KB Output is correct
33 Correct 107 ms 31836 KB Output is correct
34 Correct 56 ms 28504 KB Output is correct
35 Correct 106 ms 32220 KB Output is correct
36 Correct 111 ms 31824 KB Output is correct
37 Correct 66 ms 28564 KB Output is correct
38 Correct 105 ms 30804 KB Output is correct
39 Correct 24 ms 26408 KB Output is correct
40 Correct 111 ms 30800 KB Output is correct
41 Correct 90 ms 29720 KB Output is correct
42 Correct 105 ms 30944 KB Output is correct
43 Correct 40 ms 27220 KB Output is correct
44 Correct 104 ms 31060 KB Output is correct
45 Correct 24 ms 26204 KB Output is correct
46 Correct 126 ms 30928 KB Output is correct
47 Correct 32 ms 26648 KB Output is correct
48 Correct 124 ms 30800 KB Output is correct
49 Correct 240 ms 42708 KB Output is correct
50 Correct 287 ms 45396 KB Output is correct
51 Correct 185 ms 42324 KB Output is correct
52 Correct 366 ms 45560 KB Output is correct
53 Correct 115 ms 33620 KB Output is correct
54 Correct 309 ms 45628 KB Output is correct
55 Correct 235 ms 44156 KB Output is correct
56 Correct 356 ms 45476 KB Output is correct
57 Correct 45 ms 26832 KB Output is correct
58 Correct 278 ms 45648 KB Output is correct
59 Correct 157 ms 35444 KB Output is correct
60 Correct 294 ms 45612 KB Output is correct
61 Correct 187 ms 44704 KB Output is correct
62 Correct 171 ms 44272 KB Output is correct
63 Correct 173 ms 43704 KB Output is correct
64 Correct 176 ms 43432 KB Output is correct
65 Correct 194 ms 45236 KB Output is correct
66 Correct 184 ms 44156 KB Output is correct
67 Correct 182 ms 44228 KB Output is correct
68 Correct 176 ms 44256 KB Output is correct
69 Correct 175 ms 44404 KB Output is correct
70 Correct 175 ms 44212 KB Output is correct
71 Correct 176 ms 44352 KB Output is correct
72 Correct 161 ms 42836 KB Output is correct
73 Correct 445 ms 54940 KB Output is correct
74 Correct 321 ms 49144 KB Output is correct
75 Correct 422 ms 54292 KB Output is correct
76 Correct 581 ms 58220 KB Output is correct
77 Correct 277 ms 42780 KB Output is correct
78 Correct 506 ms 55512 KB Output is correct
79 Correct 512 ms 56644 KB Output is correct
80 Correct 595 ms 58604 KB Output is correct
81 Correct 187 ms 36436 KB Output is correct
82 Correct 488 ms 53744 KB Output is correct
83 Correct 401 ms 47116 KB Output is correct
84 Correct 568 ms 58392 KB Output is correct
85 Correct 331 ms 52928 KB Output is correct
86 Correct 441 ms 56004 KB Output is correct
87 Correct 208 ms 47752 KB Output is correct
88 Correct 466 ms 55104 KB Output is correct
89 Correct 368 ms 54684 KB Output is correct
90 Correct 453 ms 55604 KB Output is correct
91 Correct 270 ms 50612 KB Output is correct
92 Correct 414 ms 56020 KB Output is correct
93 Correct 242 ms 48816 KB Output is correct
94 Correct 411 ms 55728 KB Output is correct
95 Correct 271 ms 49868 KB Output is correct
96 Correct 398 ms 54476 KB Output is correct