oj.uz

Submission #105842

# Submission time Handle Problem Language Result Execution time Memory
105842 2019-04-15T10:32:49 Z Pro_ktmr Two Antennas (JOI19_antennas) C++14
13 / 100
 205 ms 10288 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair

struct RMQ{
private:
	int N;
	vector<LL> node;
public:
	void init(int n){
		N = 1;
		while(N < n) N *= 2;
		for(int i=0; i<2*N-1; i++) node.PB(-1);
	}
	void update(int k, LL x){
		k += N-1;
		node[k] = max(node[k], x);
		while(k > 0){
			k = (k-1)/2;
			node[k] = max(node[2*k+1],node[2*k+2]);
		}
	}
	LL sum(int a, int b, int k=0, int l=0, int r=-1){
		if(r == -1) r = N;
		if(r <= a || b <= l) return -1;
		if(a <= l && r <= b) return node[k];
		return max(sum(a, b, 2*k+1, l, (l+r)/2),sum(a, b, 2*k+2, (l+r)/2, r));
	}
};

int N,H[200000],A[200000],B[200000],Q,L[200000],R[200000];
vector<pair<pair<int,int>,int>> v,q;
int ans[200000];
int main(){
	scanf("%d", &N);
	if(N > 2000) return -1;
	for(int i=0; i<N; i++){
		scanf("%d%d%d", H+i, A+i, B+i);
	}
	
	for(int i=0; i<N; i++){
		for(int j=i+1; j<N; j++){
			int d = j-i;
			if(d < A[i] || d < A[j] || B[i] < d || B[j] < d) continue;
			v.PB(MP(MP(i+1,j+1),abs(H[i]-H[j])));
		}
	}
	sort(v.begin(), v.end());
	
	scanf("%d", &Q);
	for(int i=0; i<Q; i++){
		scanf("%d%d", L+i, R+i);
		q.PB(MP(MP(L[i],R[i]),i));
	}
	sort(q.begin(), q.end());
	
	RMQ rsq;
	rsq.init(N+1);
	
	int now = v.size()-1;
	for(int i=Q-1; i>=0; i--){
		while(now >= 0 && v[now].first.first >= q[i].first.first){
			rsq.update(v[now].first.second, v[now].second);
			now--;
		}
		ans[q[i].second] = rsq.sum(q[i].first.first, q[i].first.second+1);
	}
	
	for(int i=0; i<Q; i++) printf("%d\n", ans[i]);
	
	return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
antennas.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", H+i, A+i, B+i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:55:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
  ~~~~~^~~~~~~~~~
antennas.cpp:57:8: 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

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 123 ms 6600 KB Output is correct
26 Correct 31 ms 2536 KB Output is correct
27 Correct 205 ms 9700 KB Output is correct
28 Correct 171 ms 10204 KB Output is correct
29 Correct 82 ms 6728 KB Output is correct
30 Correct 109 ms 7524 KB Output is correct
31 Correct 108 ms 8160 KB Output is correct
32 Correct 154 ms 10084 KB Output is correct
33 Correct 130 ms 8808 KB Output is correct
34 Correct 72 ms 5860 KB Output is correct
35 Correct 124 ms 9408 KB Output is correct
36 Correct 142 ms 10288 KB Output is correct
37 Correct 67 ms 4752 KB Output is correct
38 Correct 118 ms 8100 KB Output is correct
39 Correct 33 ms 1572 KB Output is correct
40 Correct 163 ms 8048 KB Output is correct
41 Correct 118 ms 6040 KB Output is correct
42 Correct 150 ms 8008 KB Output is correct
43 Correct 45 ms 3120 KB Output is correct
44 Correct 137 ms 7924 KB Output is correct
45 Correct 42 ms 1972 KB Output is correct
46 Correct 168 ms 7840 KB Output is correct
47 Correct 54 ms 2480 KB Output is correct
48 Correct 126 ms 7920 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 123 ms 6600 KB Output is correct
26 Correct 31 ms 2536 KB Output is correct
27 Correct 205 ms 9700 KB Output is correct
28 Correct 171 ms 10204 KB Output is correct
29 Correct 82 ms 6728 KB Output is correct
30 Correct 109 ms 7524 KB Output is correct
31 Correct 108 ms 8160 KB Output is correct
32 Correct 154 ms 10084 KB Output is correct
33 Correct 130 ms 8808 KB Output is correct
34 Correct 72 ms 5860 KB Output is correct
35 Correct 124 ms 9408 KB Output is correct
36 Correct 142 ms 10288 KB Output is correct
37 Correct 67 ms 4752 KB Output is correct
38 Correct 118 ms 8100 KB Output is correct
39 Correct 33 ms 1572 KB Output is correct
40 Correct 163 ms 8048 KB Output is correct
41 Correct 118 ms 6040 KB Output is correct
42 Correct 150 ms 8008 KB Output is correct
43 Correct 45 ms 3120 KB Output is correct
44 Correct 137 ms 7924 KB Output is correct
45 Correct 42 ms 1972 KB Output is correct
46 Correct 168 ms 7840 KB Output is correct
47 Correct 54 ms 2480 KB Output is correct
48 Correct 126 ms 7920 KB Output is correct
49 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
50 Halted 0 ms 0 KB -