oj.uz

Submission #212540

# Submission time Handle Problem Language Result Execution time Memory
212540 2020-03-23T12:22:58 Z _7_7_ Two Antennas (JOI19_antennas) C++14
100 / 100
 823 ms 71128 KB 
#include <bits/stdc++.h>                                           
 
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 3e5 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;


vpii g[N];
vi add[N], del[N];
int n, h[N], a[N], b[N], q, l[N], r[N], mx[N << 2], res[N], mxC[N << 2], lz[N << 2];

void push (int v) {
	if (lz[v] < INF) {
		lz[v << 1] = min(lz[v << 1], lz[v]);
		mx[v << 1] = max(mx[v << 1], mxC[v << 1] - lz[v]);

		lz[v << 1 | 1] = min(lz[v << 1 | 1], lz[v]);
		mx[v << 1 | 1] = max(mx[v << 1 | 1], mxC[v << 1 | 1] - lz[v]);
		lz[v] = INF;
	}
}

void upd (int pos, int x, int v = 1, int tl = 1, int tr = n) {
	if (tl == tr) {
		lz[v] = INF;
		mxC[v] = x;
		return;
	}

	push(v);
	int tm = (tl + tr) >> 1;
	if (pos <= tm)
		upd(pos, x, v << 1, tl, tm);
	else
		upd(pos, x, v << 1 | 1, tm + 1, tr);

	mxC[v] = max(mxC[v << 1], mxC[v << 1 | 1]);
	mx[v] = max(mx[v << 1], mx[v << 1 | 1]);
}

void upd1 (int l, int r, int x, int v = 1, int tl = 1, int tr = n) {
	if (l > r || l > tr || tl > r)
		return;

	if (l <= tl && tr <= r) {
		lz[v] = min(lz[v], x);
		mx[v] = max(mx[v], mxC[v] - lz[v]);
		return;
	}

	push(v);
	int tm = (tl + tr) >> 1;
	
	upd1(l, r, x, v << 1, tl, tm);
	upd1(l, r, x, v << 1 | 1, tm + 1, tr);

	mx[v] = max(mx[v << 1], mx[v << 1 | 1]);
}

int get (int l, int r, int v = 1, int tl = 1, int tr = n) {
	if (l > r || l > tr || tl > r)
		return -INF;
	if (l <= tl && tr <= r)
		return mx[v];
	
	push(v);
	int tm = (tl + tr) >> 1;
	return max(get(l, r, v << 1, tl, tm), get(l, r, v << 1 | 1, tm + 1, tr));
}

void build (int v = 1, int tl = 1, int tr = n) {
	lz[v] = INF;
	mx[v] = mxC[v] = -INF;
	if (tl == tr)	
		return;
	int tm = (tl + tr) >> 1;
	build(v << 1, tl, tm);
	build(v << 1 | 1, tm + 1, tr);
}



void solve () {
	build();
	
	for (int i = 1; i <= n; ++i) {
		add[i].clear();
		del[i].clear();
		g[i].clear();
	}


	for (int i = 1; i <= q; ++i) 
		g[r[i]].pb({l[i], i});
	
	
	for (int i = 1; i <= n; ++i) {
		add[min(n + 1, i + a[i])].pb(i);
		del[min(n + 1, i + b[i] + 1)].pb(i);
	}


	for (int i = 1; i <= n; ++i) {		
		for (auto j : add[i])  {
			upd(j, h[j]);  
//			cerr << j << ' ' << h[j] << endl;
		}
		
		for (auto j : del[i])  {
			upd(j, -INF); 		 
//			cerr << j << ' ' << -INF << endl;
		}

		upd1(max(1ll, i - b[i]), i - a[i], h[i]);
//		cerr << max(1ll, i - b[i]) << ' ' << i - a[i] << ' ' << h[i] << endl;
		for (auto j : g[i])  {
			res[j.s] = max(res[j.s], get(j.f, i)); 
//			cerr << "get " << j.f << ' ' << i << ' ' << get(j.f, i) << endl;
		}
/*
		for (int i = 1; i <= n; ++i)
			cerr << get(i, i) << ' ';
		cerr << endl << endl;*/

	}
//	cerr << endl;
}

main () {
	scanf("%lld", &n);
	for (int i = 1; i <= n; ++i) 
		scanf("%lld%lld%lld", &h[i], &a[i], &b[i]);

	scanf("%lld", &q);	
	for (int i = 1; i <= q; ++i) 
		scanf("%lld%lld", &l[i], &r[i]);

	memset(res, -1, sizeof(res));

	solve();
	for (int i = 1; i <= q; ++i) {
		l[i] = n + 1 - l[i];
		r[i] = n + 1 - r[i];
		swap(l[i], r[i]);
	}


	reverse(h + 1, h + 1 + n);
	reverse(a + 1, a + 1 + n);
	reverse(b + 1, b + 1 + n);
	solve();

	for (int i = 1; i <= q; ++i)
		printf("%lld\n", res[i]);
}

Compilation message

antennas.cpp:160:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
antennas.cpp: In function 'int main()':
antennas.cpp:161:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
antennas.cpp:163:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &h[i], &a[i], &b[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:165:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &q); 
  ~~~~~^~~~~~~~~~~~
antennas.cpp:167:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &l[i], &r[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 18 ms 23936 KB Output is correct
3 Correct 19 ms 23936 KB Output is correct
4 Correct 19 ms 23936 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 19 ms 23936 KB Output is correct
7 Correct 18 ms 23936 KB Output is correct
8 Correct 18 ms 23936 KB Output is correct
9 Correct 19 ms 23936 KB Output is correct
10 Correct 19 ms 23936 KB Output is correct
11 Correct 19 ms 23936 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 18 ms 23936 KB Output is correct
14 Correct 19 ms 23936 KB Output is correct
15 Correct 19 ms 23936 KB Output is correct
16 Correct 19 ms 23936 KB Output is correct
17 Correct 19 ms 23936 KB Output is correct
18 Correct 19 ms 23936 KB Output is correct
19 Correct 18 ms 23936 KB Output is correct
20 Correct 18 ms 23936 KB Output is correct
21 Correct 18 ms 23936 KB Output is correct
22 Correct 18 ms 23936 KB Output is correct
23 Correct 21 ms 23936 KB Output is correct
24 Correct 18 ms 23936 KB Output is correct
25 Correct 135 ms 33528 KB Output is correct
26 Correct 34 ms 25208 KB Output is correct
27 Correct 195 ms 37084 KB Output is correct
28 Correct 190 ms 36984 KB Output is correct
29 Correct 136 ms 33784 KB Output is correct
30 Correct 142 ms 33144 KB Output is correct
31 Correct 149 ms 35704 KB Output is correct
32 Correct 193 ms 36984 KB Output is correct
33 Correct 187 ms 36856 KB Output is correct
34 Correct 104 ms 30328 KB Output is correct
35 Correct 191 ms 37756 KB Output is correct
36 Correct 201 ms 37040 KB Output is correct
37 Correct 114 ms 31224 KB Output is correct
38 Correct 184 ms 35960 KB Output is correct
39 Correct 48 ms 26104 KB Output is correct
40 Correct 190 ms 36044 KB Output is correct
41 Correct 140 ms 33400 KB Output is correct
42 Correct 188 ms 35960 KB Output is correct
43 Correct 73 ms 28280 KB Output is correct
44 Correct 188 ms 35960 KB Output is correct
45 Correct 49 ms 26232 KB Output is correct
46 Correct 193 ms 36088 KB Output is correct
47 Correct 62 ms 27256 KB Output is correct
48 Correct 185 ms 35936 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 51048 KB Output is correct
2 Correct 446 ms 56548 KB Output is correct
3 Correct 296 ms 50400 KB Output is correct
4 Correct 420 ms 56544 KB Output is correct
5 Correct 183 ms 39524 KB Output is correct
6 Correct 431 ms 56544 KB Output is correct
7 Correct 370 ms 52836 KB Output is correct
8 Correct 423 ms 56544 KB Output is correct
9 Correct 60 ms 28404 KB Output is correct
10 Correct 442 ms 56700 KB Output is correct
11 Correct 258 ms 41828 KB Output is correct
12 Correct 452 ms 56544 KB Output is correct
13 Correct 268 ms 53976 KB Output is correct
14 Correct 271 ms 53844 KB Output is correct
15 Correct 249 ms 52636 KB Output is correct
16 Correct 228 ms 52888 KB Output is correct
17 Correct 294 ms 54508 KB Output is correct
18 Correct 248 ms 53300 KB Output is correct
19 Correct 281 ms 53220 KB Output is correct
20 Correct 268 ms 53408 KB Output is correct
21 Correct 245 ms 56276 KB Output is correct
22 Correct 259 ms 53868 KB Output is correct
23 Correct 251 ms 53604 KB Output is correct
24 Correct 237 ms 52152 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 18 ms 23936 KB Output is correct
3 Correct 19 ms 23936 KB Output is correct
4 Correct 19 ms 23936 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 19 ms 23936 KB Output is correct
7 Correct 18 ms 23936 KB Output is correct
8 Correct 18 ms 23936 KB Output is correct
9 Correct 19 ms 23936 KB Output is correct
10 Correct 19 ms 23936 KB Output is correct
11 Correct 19 ms 23936 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 18 ms 23936 KB Output is correct
14 Correct 19 ms 23936 KB Output is correct
15 Correct 19 ms 23936 KB Output is correct
16 Correct 19 ms 23936 KB Output is correct
17 Correct 19 ms 23936 KB Output is correct
18 Correct 19 ms 23936 KB Output is correct
19 Correct 18 ms 23936 KB Output is correct
20 Correct 18 ms 23936 KB Output is correct
21 Correct 18 ms 23936 KB Output is correct
22 Correct 18 ms 23936 KB Output is correct
23 Correct 21 ms 23936 KB Output is correct
24 Correct 18 ms 23936 KB Output is correct
25 Correct 135 ms 33528 KB Output is correct
26 Correct 34 ms 25208 KB Output is correct
27 Correct 195 ms 37084 KB Output is correct
28 Correct 190 ms 36984 KB Output is correct
29 Correct 136 ms 33784 KB Output is correct
30 Correct 142 ms 33144 KB Output is correct
31 Correct 149 ms 35704 KB Output is correct
32 Correct 193 ms 36984 KB Output is correct
33 Correct 187 ms 36856 KB Output is correct
34 Correct 104 ms 30328 KB Output is correct
35 Correct 191 ms 37756 KB Output is correct
36 Correct 201 ms 37040 KB Output is correct
37 Correct 114 ms 31224 KB Output is correct
38 Correct 184 ms 35960 KB Output is correct
39 Correct 48 ms 26104 KB Output is correct
40 Correct 190 ms 36044 KB Output is correct
41 Correct 140 ms 33400 KB Output is correct
42 Correct 188 ms 35960 KB Output is correct
43 Correct 73 ms 28280 KB Output is correct
44 Correct 188 ms 35960 KB Output is correct
45 Correct 49 ms 26232 KB Output is correct
46 Correct 193 ms 36088 KB Output is correct
47 Correct 62 ms 27256 KB Output is correct
48 Correct 185 ms 35936 KB Output is correct
49 Correct 403 ms 51048 KB Output is correct
50 Correct 446 ms 56548 KB Output is correct
51 Correct 296 ms 50400 KB Output is correct
52 Correct 420 ms 56544 KB Output is correct
53 Correct 183 ms 39524 KB Output is correct
54 Correct 431 ms 56544 KB Output is correct
55 Correct 370 ms 52836 KB Output is correct
56 Correct 423 ms 56544 KB Output is correct
57 Correct 60 ms 28404 KB Output is correct
58 Correct 442 ms 56700 KB Output is correct
59 Correct 258 ms 41828 KB Output is correct
60 Correct 452 ms 56544 KB Output is correct
61 Correct 268 ms 53976 KB Output is correct
62 Correct 271 ms 53844 KB Output is correct
63 Correct 249 ms 52636 KB Output is correct
64 Correct 228 ms 52888 KB Output is correct
65 Correct 294 ms 54508 KB Output is correct
66 Correct 248 ms 53300 KB Output is correct
67 Correct 281 ms 53220 KB Output is correct
68 Correct 268 ms 53408 KB Output is correct
69 Correct 245 ms 56276 KB Output is correct
70 Correct 259 ms 53868 KB Output is correct
71 Correct 251 ms 53604 KB Output is correct
72 Correct 237 ms 52152 KB Output is correct
73 Correct 657 ms 65760 KB Output is correct
74 Correct 460 ms 58016 KB Output is correct
75 Correct 638 ms 64860 KB Output is correct
76 Correct 823 ms 71124 KB Output is correct
77 Correct 427 ms 49760 KB Output is correct
78 Correct 666 ms 66272 KB Output is correct
79 Correct 734 ms 68448 KB Output is correct
80 Correct 811 ms 71004 KB Output is correct
81 Correct 324 ms 42116 KB Output is correct
82 Correct 615 ms 63840 KB Output is correct
83 Correct 574 ms 56928 KB Output is correct
84 Correct 788 ms 71128 KB Output is correct
85 Correct 476 ms 62572 KB Output is correct
86 Correct 632 ms 68048 KB Output is correct
87 Correct 308 ms 55192 KB Output is correct
88 Correct 683 ms 67580 KB Output is correct
89 Correct 550 ms 64952 KB Output is correct
90 Correct 635 ms 67632 KB Output is correct
91 Correct 381 ms 58340 KB Output is correct
92 Correct 654 ms 68000 KB Output is correct
93 Correct 311 ms 59100 KB Output is correct
94 Correct 628 ms 67932 KB Output is correct
95 Correct 372 ms 57700 KB Output is correct
96 Correct 602 ms 66784 KB Output is correct