oj.uz

Submission #554019

# Submission time Handle Problem Language Result Execution time Memory
554019 2022-04-27T14:47:48 Z MilosMilutinovic Two Antennas (JOI19_antennas) C++14
100 / 100
 728 ms 59268 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=200050;
const ll inf=(ll)1e18;
int n,q,h[N],a[N],b[N],ql[N],qr[N];
ll ans[N];
vector<PII> Qs[N][2];

struct node{
	ll val,mx,lzy;
}nd[8*N];
void upd(int p,ll x) {
	nd[p].val=max(nd[p].val,nd[p].mx+x);
	nd[p].lzy=max(nd[p].lzy,x);
}
void push(int p) {
	if (nd[p].lzy==-inf) return;
	upd(p*2,nd[p].lzy);
	upd(p*2+1,nd[p].lzy);
	nd[p].lzy=-inf;
}
void build(int p,int l,int r) {
	nd[p].val=nd[p].mx=nd[p].lzy=-inf;
	if (l==r) return;
	int mid=(l+r)/2;
	build(p*2,l,mid);
	build(p*2+1,mid+1,r);
}
void modify(int p,int l,int r,int tl,ll x) {
	if (l==r) {
		nd[p].mx=x;
		return;
	}
	push(p);
	int mid=(l+r)/2;
	if (tl<=mid) modify(p*2,l,mid,tl,x);
	else modify(p*2+1,mid+1,r,tl,x);
	nd[p].mx=max(nd[p*2].mx,nd[p*2+1].mx);
}
void update(int p,int l,int r,int tl,int tr,ll x) {
	if (tl>tr||l>r||l>tr||r<tl) return;
	if (tl<=l&&r<=tr) {
		upd(p,x);
		push(p);
		return;
	}
	push(p);
	int mid=(l+r)/2;
	update(p*2,l,mid,tl,tr,x);
	update(p*2+1,mid+1,r,tl,tr,x);
	nd[p].val=max(nd[p*2].val,nd[p*2+1].val);
}
ll query(int p,int l,int r,int tl,int tr) {
	if (tl>tr||l>r||l>tr||r<tl) return -inf;
	if (tl<=l&&r<=tr) return nd[p].val;
	push(p);
	int mid=(l+r)/2;
	return max(query(p*2,l,mid,tl,tr),query(p*2+1,mid+1,r,tl,tr));
}

void solve() {
	rep(i,1,n+1) {
		Qs[i][0].clear();
		Qs[i][1].clear();
	}
	rep(i,1,n+1) {
		Qs[min(n+1,i+a[i])][0].pb(mp(i,0));
		Qs[min(n+1,i+b[i])][0].pb(mp(i,1));
	}
	rep(i,1,q+1) Qs[qr[i]][1].pb(mp(i,ql[i]));
	build(1,1,n);
	rep(i,1,n+1) {
		for (auto qs:Qs[i][0]) if (qs.se==0) modify(1,1,n,qs.fi,h[qs.fi]);
		update(1,1,n,i-b[i],i-a[i],-h[i]);
		for (auto qs:Qs[i][1]) ans[qs.fi]=max(ans[qs.fi],query(1,1,n,qs.se,i));
		for (auto qs:Qs[i][0]) if (qs.se==1) modify(1,1,n,qs.fi,-inf);
	}
}

int main() {
	scanf("%d",&n);
	rep(i,1,n+1) scanf("%d%d%d",&h[i],&a[i],&b[i]);
	scanf("%d",&q);
	rep(i,1,q+1) scanf("%d%d",&ql[i],&qr[i]),ans[i]=-1;
	solve();
	rep(i,1,n+1) h[i]=-h[i];
	solve();
	rep(i,1,q+1) printf("%lld\n",ans[i]);
	return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:101:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
antennas.cpp:102:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |  rep(i,1,n+1) scanf("%d%d%d",&h[i],&a[i],&b[i]);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:103:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |  scanf("%d",&q);
      |  ~~~~~^~~~~~~~~
antennas.cpp:104:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |  rep(i,1,q+1) scanf("%d%d",&ql[i],&qr[i]),ans[i]=-1;
      |               ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 7 ms 9812 KB Output is correct
3 Correct 7 ms 9724 KB Output is correct
4 Correct 6 ms 9812 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 6 ms 9812 KB Output is correct
8 Correct 6 ms 9724 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9812 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 6 ms 9724 KB Output is correct
13 Correct 6 ms 9736 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 6 ms 9744 KB Output is correct
20 Correct 6 ms 9880 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 6 ms 9736 KB Output is correct
25 Correct 95 ms 16332 KB Output is correct
26 Correct 18 ms 10708 KB Output is correct
27 Correct 145 ms 19244 KB Output is correct
28 Correct 146 ms 19288 KB Output is correct
29 Correct 94 ms 16408 KB Output is correct
30 Correct 94 ms 16048 KB Output is correct
31 Correct 107 ms 17976 KB Output is correct
32 Correct 147 ms 19144 KB Output is correct
33 Correct 126 ms 18680 KB Output is correct
34 Correct 74 ms 14412 KB Output is correct
35 Correct 139 ms 19112 KB Output is correct
36 Correct 137 ms 19148 KB Output is correct
37 Correct 80 ms 14636 KB Output is correct
38 Correct 139 ms 18124 KB Output is correct
39 Correct 24 ms 11044 KB Output is correct
40 Correct 137 ms 18160 KB Output is correct
41 Correct 104 ms 15872 KB Output is correct
42 Correct 152 ms 18268 KB Output is correct
43 Correct 54 ms 12712 KB Output is correct
44 Correct 133 ms 18140 KB Output is correct
45 Correct 29 ms 11340 KB Output is correct
46 Correct 132 ms 18212 KB Output is correct
47 Correct 39 ms 11980 KB Output is correct
48 Correct 133 ms 18176 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 42676 KB Output is correct
2 Correct 375 ms 43544 KB Output is correct
3 Correct 268 ms 39096 KB Output is correct
4 Correct 375 ms 43320 KB Output is correct
5 Correct 148 ms 26232 KB Output is correct
6 Correct 371 ms 43392 KB Output is correct
7 Correct 317 ms 42348 KB Output is correct
8 Correct 366 ms 43396 KB Output is correct
9 Correct 44 ms 14584 KB Output is correct
10 Correct 376 ms 43512 KB Output is correct
11 Correct 206 ms 29388 KB Output is correct
12 Correct 369 ms 43420 KB Output is correct
13 Correct 243 ms 35888 KB Output is correct
14 Correct 227 ms 35284 KB Output is correct
15 Correct 222 ms 33108 KB Output is correct
16 Correct 173 ms 32536 KB Output is correct
17 Correct 234 ms 37192 KB Output is correct
18 Correct 206 ms 34340 KB Output is correct
19 Correct 216 ms 34256 KB Output is correct
20 Correct 221 ms 35372 KB Output is correct
21 Correct 233 ms 35660 KB Output is correct
22 Correct 239 ms 35568 KB Output is correct
23 Correct 227 ms 35264 KB Output is correct
24 Correct 177 ms 32340 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 7 ms 9812 KB Output is correct
3 Correct 7 ms 9724 KB Output is correct
4 Correct 6 ms 9812 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 6 ms 9812 KB Output is correct
8 Correct 6 ms 9724 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9812 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 6 ms 9724 KB Output is correct
13 Correct 6 ms 9736 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 6 ms 9744 KB Output is correct
20 Correct 6 ms 9880 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 6 ms 9736 KB Output is correct
25 Correct 95 ms 16332 KB Output is correct
26 Correct 18 ms 10708 KB Output is correct
27 Correct 145 ms 19244 KB Output is correct
28 Correct 146 ms 19288 KB Output is correct
29 Correct 94 ms 16408 KB Output is correct
30 Correct 94 ms 16048 KB Output is correct
31 Correct 107 ms 17976 KB Output is correct
32 Correct 147 ms 19144 KB Output is correct
33 Correct 126 ms 18680 KB Output is correct
34 Correct 74 ms 14412 KB Output is correct
35 Correct 139 ms 19112 KB Output is correct
36 Correct 137 ms 19148 KB Output is correct
37 Correct 80 ms 14636 KB Output is correct
38 Correct 139 ms 18124 KB Output is correct
39 Correct 24 ms 11044 KB Output is correct
40 Correct 137 ms 18160 KB Output is correct
41 Correct 104 ms 15872 KB Output is correct
42 Correct 152 ms 18268 KB Output is correct
43 Correct 54 ms 12712 KB Output is correct
44 Correct 133 ms 18140 KB Output is correct
45 Correct 29 ms 11340 KB Output is correct
46 Correct 132 ms 18212 KB Output is correct
47 Correct 39 ms 11980 KB Output is correct
48 Correct 133 ms 18176 KB Output is correct
49 Correct 346 ms 42676 KB Output is correct
50 Correct 375 ms 43544 KB Output is correct
51 Correct 268 ms 39096 KB Output is correct
52 Correct 375 ms 43320 KB Output is correct
53 Correct 148 ms 26232 KB Output is correct
54 Correct 371 ms 43392 KB Output is correct
55 Correct 317 ms 42348 KB Output is correct
56 Correct 366 ms 43396 KB Output is correct
57 Correct 44 ms 14584 KB Output is correct
58 Correct 376 ms 43512 KB Output is correct
59 Correct 206 ms 29388 KB Output is correct
60 Correct 369 ms 43420 KB Output is correct
61 Correct 243 ms 35888 KB Output is correct
62 Correct 227 ms 35284 KB Output is correct
63 Correct 222 ms 33108 KB Output is correct
64 Correct 173 ms 32536 KB Output is correct
65 Correct 234 ms 37192 KB Output is correct
66 Correct 206 ms 34340 KB Output is correct
67 Correct 216 ms 34256 KB Output is correct
68 Correct 221 ms 35372 KB Output is correct
69 Correct 233 ms 35660 KB Output is correct
70 Correct 239 ms 35568 KB Output is correct
71 Correct 227 ms 35264 KB Output is correct
72 Correct 177 ms 32340 KB Output is correct
73 Correct 576 ms 54780 KB Output is correct
74 Correct 410 ms 48740 KB Output is correct
75 Correct 538 ms 51848 KB Output is correct
76 Correct 728 ms 59228 KB Output is correct
77 Correct 340 ms 35948 KB Output is correct
78 Correct 585 ms 55704 KB Output is correct
79 Correct 635 ms 56796 KB Output is correct
80 Correct 696 ms 59268 KB Output is correct
81 Correct 244 ms 24640 KB Output is correct
82 Correct 553 ms 53508 KB Output is correct
83 Correct 494 ms 41392 KB Output is correct
84 Correct 721 ms 59124 KB Output is correct
85 Correct 410 ms 45856 KB Output is correct
86 Correct 523 ms 49072 KB Output is correct
87 Correct 266 ms 38848 KB Output is correct
88 Correct 475 ms 46460 KB Output is correct
89 Correct 466 ms 48176 KB Output is correct
90 Correct 512 ms 48112 KB Output is correct
91 Correct 316 ms 41992 KB Output is correct
92 Correct 526 ms 48732 KB Output is correct
93 Correct 290 ms 41820 KB Output is correct
94 Correct 533 ms 49044 KB Output is correct
95 Correct 327 ms 42268 KB Output is correct
96 Correct 477 ms 46092 KB Output is correct