oj.uz

답안 #103981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103981 2019-04-03T13:33:18 Z IOrtroiii Two Antennas (JOI19_antennas) C++14
100 / 100
 1348 ms 48724 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 200200;
const int inf = 1e9;

int n, q;
int a[N], from[N], to[N];
int L[N], R[N], ans[N];

int mx[N << 2];
int sub[N << 2];
int lz[N << 2];

vector<int> toadd[N];
vector<int> todel[N];
vector<int> toget[N];

#define md ((l + r) >> 1)

void push(int v,int l,int r) {
	if (lz[v] < inf) {
		sub[v] = max(sub[v], mx[v] - lz[v]);
		if (l < r) {
			lz[v << 1] = min(lz[v << 1], lz[v]);
			lz[v << 1 | 1] = min(lz[v << 1 | 1], lz[v]);
		}
		lz[v] = inf;
	}
}

void pull(int v) {
	mx[v] = max(mx[v << 1], mx[v << 1 | 1]);
	sub[v] = max(sub[v << 1], sub[v << 1 | 1]);
}

void upd(int v,int l,int r,int pos,int val) {
	push(v, l, r);
	if (l > pos || r < pos) return;
	if (l == r) {
		mx[v] = val;
		return;
	}
	upd(v << 1, l, md, pos, val);
	upd(v << 1 | 1, md + 1, r, pos, val);
	pull(v);
}

void upd(int v,int l,int r,int L,int R,int val) {
	push(v, l, r);
	if (L > r || R < l) return;
	if (L <= l && r <= R) {
		lz[v] = val;
		push(v, l, r);
		return;
	}
	upd(v << 1, l, md, L, R, val);
	upd(v << 1 | 1, md + 1, r, L, R, val);
	pull(v);
}

int get(int v,int l,int r,int L,int R) {
	push(v, l, r);
	if (L > r || R < l) return -1;
	if (L <= l && r <= R) return sub[v];
	return max(get(v << 1, l, md, L, R), get(v << 1 | 1, md + 1, r, L, R));
}

void go() {
	for (int v = 1; v <= (n << 2); ++v) {
		mx[v] = 0;
		sub[v] = -1;
		lz[v] = inf;
	}
	for (int i = 1; i <= n; ++i) {
		toadd[i].clear();
		todel[i].clear();
		toget[i].clear();
	}
	for (int i = 1; i <= q; ++i) {
		toget[R[i]].push_back(i);
	}
	for (int i = 1; i <= n; ++i) {
		if (i + from[i] <= n) toadd[i + from[i]].push_back(i);
		if (i + to[i] <= n) todel[i + to[i]].push_back(i);
		for (int id : toadd[i]) upd(1, 1, n, id, a[id]);
		if (i > from[i]) upd(1, 1, n, max(1, i - to[i]), i - from[i], a[i]);
		for (int id : toget[i]) ans[id] = max(ans[id], get(1, 1, n, L[id], R[id]));
		for (int id : todel[i]) upd(1, 1, n, id, 0);
	}
}

int main() {
	scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d %d %d", a + i, from + i, to + i);
  }
  scanf("%d", &q);
  for (int i = 1; i <= q; ++i) {
    ans[i] = -1;
    scanf("%d %d", L + i, R + i);
  }
  go();
  reverse(a + 1, a + 1 + n);
  reverse(from + 1, from + 1 + n);
  reverse(to + 1, to + 1 + n);
  for (int i = 1; i <= q; ++i) {
    L[i] = n + 1 - L[i];
    R[i] = n + 1 - R[i];
    swap(L[i], R[i]);
  }
  go();
  for (int i = 1; i <= q; ++i) {
    printf("%d\n", ans[i]);
  }
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:95:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
antennas.cpp:97:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", a + i, from + i, to + i);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:99:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &q);
   ~~~~~^~~~~~~~~~
antennas.cpp:102:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", L + i, R + i);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14464 KB Output is correct
2 Correct 17 ms 14584 KB Output is correct
3 Correct 18 ms 14464 KB Output is correct
4 Correct 18 ms 14592 KB Output is correct
5 Correct 16 ms 14588 KB Output is correct
6 Correct 19 ms 14592 KB Output is correct
7 Correct 16 ms 14464 KB Output is correct
8 Correct 17 ms 14464 KB Output is correct
9 Correct 16 ms 14464 KB Output is correct
10 Correct 17 ms 14592 KB Output is correct
11 Correct 19 ms 14464 KB Output is correct
12 Correct 17 ms 14588 KB Output is correct
13 Correct 16 ms 14464 KB Output is correct
14 Correct 17 ms 14504 KB Output is correct
15 Correct 17 ms 14464 KB Output is correct
16 Correct 17 ms 14592 KB Output is correct
17 Correct 19 ms 14464 KB Output is correct
18 Correct 20 ms 14564 KB Output is correct
19 Correct 18 ms 14464 KB Output is correct
20 Correct 16 ms 14592 KB Output is correct
21 Correct 17 ms 14532 KB Output is correct
22 Correct 18 ms 14592 KB Output is correct
23 Correct 17 ms 14500 KB Output is correct
24 Correct 19 ms 14464 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14464 KB Output is correct
2 Correct 17 ms 14584 KB Output is correct
3 Correct 18 ms 14464 KB Output is correct
4 Correct 18 ms 14592 KB Output is correct
5 Correct 16 ms 14588 KB Output is correct
6 Correct 19 ms 14592 KB Output is correct
7 Correct 16 ms 14464 KB Output is correct
8 Correct 17 ms 14464 KB Output is correct
9 Correct 16 ms 14464 KB Output is correct
10 Correct 17 ms 14592 KB Output is correct
11 Correct 19 ms 14464 KB Output is correct
12 Correct 17 ms 14588 KB Output is correct
13 Correct 16 ms 14464 KB Output is correct
14 Correct 17 ms 14504 KB Output is correct
15 Correct 17 ms 14464 KB Output is correct
16 Correct 17 ms 14592 KB Output is correct
17 Correct 19 ms 14464 KB Output is correct
18 Correct 20 ms 14564 KB Output is correct
19 Correct 18 ms 14464 KB Output is correct
20 Correct 16 ms 14592 KB Output is correct
21 Correct 17 ms 14532 KB Output is correct
22 Correct 18 ms 14592 KB Output is correct
23 Correct 17 ms 14500 KB Output is correct
24 Correct 19 ms 14464 KB Output is correct
25 Correct 199 ms 19972 KB Output is correct
26 Correct 65 ms 15352 KB Output is correct
27 Correct 283 ms 22264 KB Output is correct
28 Correct 234 ms 22136 KB Output is correct
29 Correct 170 ms 19960 KB Output is correct
30 Correct 207 ms 19676 KB Output is correct
31 Correct 220 ms 21296 KB Output is correct
32 Correct 248 ms 22264 KB Output is correct
33 Correct 215 ms 21784 KB Output is correct
34 Correct 105 ms 18248 KB Output is correct
35 Correct 234 ms 22280 KB Output is correct
36 Correct 260 ms 22136 KB Output is correct
37 Correct 188 ms 18552 KB Output is correct
38 Correct 339 ms 21112 KB Output is correct
39 Correct 43 ms 15608 KB Output is correct
40 Correct 259 ms 21212 KB Output is correct
41 Correct 188 ms 19576 KB Output is correct
42 Correct 244 ms 21112 KB Output is correct
43 Correct 84 ms 17016 KB Output is correct
44 Correct 255 ms 21288 KB Output is correct
45 Correct 48 ms 15864 KB Output is correct
46 Correct 235 ms 21200 KB Output is correct
47 Correct 67 ms 16424 KB Output is correct
48 Correct 249 ms 21112 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 592 ms 34136 KB Output is correct
2 Correct 677 ms 36344 KB Output is correct
3 Correct 421 ms 29816 KB Output is correct
4 Correct 640 ms 36704 KB Output is correct
5 Correct 259 ms 24568 KB Output is correct
6 Correct 643 ms 36364 KB Output is correct
7 Correct 498 ms 33400 KB Output is correct
8 Correct 574 ms 36484 KB Output is correct
9 Correct 67 ms 17912 KB Output is correct
10 Correct 617 ms 36444 KB Output is correct
11 Correct 383 ms 28152 KB Output is correct
12 Correct 602 ms 36472 KB Output is correct
13 Correct 333 ms 34124 KB Output is correct
14 Correct 304 ms 33908 KB Output is correct
15 Correct 355 ms 33100 KB Output is correct
16 Correct 253 ms 33264 KB Output is correct
17 Correct 338 ms 34720 KB Output is correct
18 Correct 301 ms 33656 KB Output is correct
19 Correct 299 ms 33736 KB Output is correct
20 Correct 350 ms 33728 KB Output is correct
21 Correct 360 ms 34240 KB Output is correct
22 Correct 299 ms 33880 KB Output is correct
23 Correct 320 ms 33908 KB Output is correct
24 Correct 266 ms 32856 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14464 KB Output is correct
2 Correct 17 ms 14584 KB Output is correct
3 Correct 18 ms 14464 KB Output is correct
4 Correct 18 ms 14592 KB Output is correct
5 Correct 16 ms 14588 KB Output is correct
6 Correct 19 ms 14592 KB Output is correct
7 Correct 16 ms 14464 KB Output is correct
8 Correct 17 ms 14464 KB Output is correct
9 Correct 16 ms 14464 KB Output is correct
10 Correct 17 ms 14592 KB Output is correct
11 Correct 19 ms 14464 KB Output is correct
12 Correct 17 ms 14588 KB Output is correct
13 Correct 16 ms 14464 KB Output is correct
14 Correct 17 ms 14504 KB Output is correct
15 Correct 17 ms 14464 KB Output is correct
16 Correct 17 ms 14592 KB Output is correct
17 Correct 19 ms 14464 KB Output is correct
18 Correct 20 ms 14564 KB Output is correct
19 Correct 18 ms 14464 KB Output is correct
20 Correct 16 ms 14592 KB Output is correct
21 Correct 17 ms 14532 KB Output is correct
22 Correct 18 ms 14592 KB Output is correct
23 Correct 17 ms 14500 KB Output is correct
24 Correct 19 ms 14464 KB Output is correct
25 Correct 199 ms 19972 KB Output is correct
26 Correct 65 ms 15352 KB Output is correct
27 Correct 283 ms 22264 KB Output is correct
28 Correct 234 ms 22136 KB Output is correct
29 Correct 170 ms 19960 KB Output is correct
30 Correct 207 ms 19676 KB Output is correct
31 Correct 220 ms 21296 KB Output is correct
32 Correct 248 ms 22264 KB Output is correct
33 Correct 215 ms 21784 KB Output is correct
34 Correct 105 ms 18248 KB Output is correct
35 Correct 234 ms 22280 KB Output is correct
36 Correct 260 ms 22136 KB Output is correct
37 Correct 188 ms 18552 KB Output is correct
38 Correct 339 ms 21112 KB Output is correct
39 Correct 43 ms 15608 KB Output is correct
40 Correct 259 ms 21212 KB Output is correct
41 Correct 188 ms 19576 KB Output is correct
42 Correct 244 ms 21112 KB Output is correct
43 Correct 84 ms 17016 KB Output is correct
44 Correct 255 ms 21288 KB Output is correct
45 Correct 48 ms 15864 KB Output is correct
46 Correct 235 ms 21200 KB Output is correct
47 Correct 67 ms 16424 KB Output is correct
48 Correct 249 ms 21112 KB Output is correct
49 Correct 592 ms 34136 KB Output is correct
50 Correct 677 ms 36344 KB Output is correct
51 Correct 421 ms 29816 KB Output is correct
52 Correct 640 ms 36704 KB Output is correct
53 Correct 259 ms 24568 KB Output is correct
54 Correct 643 ms 36364 KB Output is correct
55 Correct 498 ms 33400 KB Output is correct
56 Correct 574 ms 36484 KB Output is correct
57 Correct 67 ms 17912 KB Output is correct
58 Correct 617 ms 36444 KB Output is correct
59 Correct 383 ms 28152 KB Output is correct
60 Correct 602 ms 36472 KB Output is correct
61 Correct 333 ms 34124 KB Output is correct
62 Correct 304 ms 33908 KB Output is correct
63 Correct 355 ms 33100 KB Output is correct
64 Correct 253 ms 33264 KB Output is correct
65 Correct 338 ms 34720 KB Output is correct
66 Correct 301 ms 33656 KB Output is correct
67 Correct 299 ms 33736 KB Output is correct
68 Correct 350 ms 33728 KB Output is correct
69 Correct 360 ms 34240 KB Output is correct
70 Correct 299 ms 33880 KB Output is correct
71 Correct 320 ms 33908 KB Output is correct
72 Correct 266 ms 32856 KB Output is correct
73 Correct 1348 ms 43820 KB Output is correct
74 Correct 705 ms 37792 KB Output is correct
75 Correct 961 ms 40824 KB Output is correct
76 Correct 1096 ms 48504 KB Output is correct
77 Correct 584 ms 32348 KB Output is correct
78 Correct 972 ms 45340 KB Output is correct
79 Correct 1004 ms 45176 KB Output is correct
80 Correct 1162 ms 48688 KB Output is correct
81 Correct 449 ms 26232 KB Output is correct
82 Correct 934 ms 43256 KB Output is correct
83 Correct 862 ms 38848 KB Output is correct
84 Correct 1167 ms 48724 KB Output is correct
85 Correct 619 ms 41588 KB Output is correct
86 Correct 885 ms 44996 KB Output is correct
87 Correct 405 ms 35452 KB Output is correct
88 Correct 1002 ms 44360 KB Output is correct
89 Correct 794 ms 43460 KB Output is correct
90 Correct 857 ms 44704 KB Output is correct
91 Correct 524 ms 38352 KB Output is correct
92 Correct 848 ms 44760 KB Output is correct
93 Correct 406 ms 36828 KB Output is correct
94 Correct 780 ms 44980 KB Output is correct
95 Correct 509 ms 37748 KB Output is correct
96 Correct 883 ms 43876 KB Output is correct