oj.uz

Submission #123342

# Submission time Handle Problem Language Result Execution time Memory
123342 2019-07-01T07:40:48 Z 김세빈(#3018) Two Antennas (JOI19_antennas) C++14
13 / 100
 207 ms 30000 KB 
#include <bits/stdc++.h>

using namespace std;

int H[2020], A[2020], B[2020];
int Q[2020][2020], chk[2020][2020];
int n, ans;

int f(int i, int j)
{
	if(i == j) return -1;
	if(chk[i][j]) return Q[i][j];
	
	chk[i][j] = 1;
	Q[i][j] = max(Q[i][j], f(i + 1, j));
	Q[i][j] = max(Q[i][j], f(i, j - 1));
	
	return Q[i][j];
}

int main()
{
	int q, i, j, l, r, x, y;
	
	scanf("%d", &n);
	
	for(i=1; i<=n; i++){
		scanf("%d%d%d", H + i, A + i, B + i);
	}
	
	for(i=1; i<=n; i++){
		for(j=i; j<=n; j++){
			if(i + A[i] <= j && j <= i + B[i] && i + A[j] <= j && j <= i + B[j]){
				Q[i][j] = abs(H[i] - H[j]);
			}
			else Q[i][j] = -1;
		}
	}
	
	for(i=1; i<=n; i++){
		for(j=i; j<=n; j++){
			f(i, j);
		}
	}
	
	scanf("%d", &q);
	
	for(; q--; ){
		scanf("%d%d", &i, &j);
		printf("%d\n", f(i, j));
	}
	
	return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:23:15: warning: unused variable 'l' [-Wunused-variable]
  int q, i, j, l, r, x, y;
               ^
antennas.cpp:23:18: warning: unused variable 'r' [-Wunused-variable]
  int q, i, j, l, r, x, y;
                  ^
antennas.cpp:23:21: warning: unused variable 'x' [-Wunused-variable]
  int q, i, j, l, r, x, y;
                     ^
antennas.cpp:23:24: warning: unused variable 'y' [-Wunused-variable]
  int q, i, j, l, r, x, y;
                        ^
antennas.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
antennas.cpp:28: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:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
antennas.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &i, &j);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1276 KB Output is correct
2 Correct 6 ms 3068 KB Output is correct
3 Correct 5 ms 2424 KB Output is correct
4 Correct 6 ms 3068 KB Output is correct
5 Correct 5 ms 2556 KB Output is correct
6 Correct 6 ms 3064 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 6 ms 3068 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 6 ms 3064 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 6 ms 3068 KB Output is correct
13 Correct 5 ms 2552 KB Output is correct
14 Correct 5 ms 2552 KB Output is correct
15 Correct 5 ms 2552 KB Output is correct
16 Correct 5 ms 2552 KB Output is correct
17 Correct 5 ms 2552 KB Output is correct
18 Correct 5 ms 2552 KB Output is correct
19 Correct 5 ms 2552 KB Output is correct
20 Correct 5 ms 2552 KB Output is correct
21 Correct 5 ms 2552 KB Output is correct
22 Correct 5 ms 2552 KB Output is correct
23 Correct 5 ms 2552 KB Output is correct
24 Correct 5 ms 2552 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1276 KB Output is correct
2 Correct 6 ms 3068 KB Output is correct
3 Correct 5 ms 2424 KB Output is correct
4 Correct 6 ms 3068 KB Output is correct
5 Correct 5 ms 2556 KB Output is correct
6 Correct 6 ms 3064 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 6 ms 3068 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 6 ms 3064 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 6 ms 3068 KB Output is correct
13 Correct 5 ms 2552 KB Output is correct
14 Correct 5 ms 2552 KB Output is correct
15 Correct 5 ms 2552 KB Output is correct
16 Correct 5 ms 2552 KB Output is correct
17 Correct 5 ms 2552 KB Output is correct
18 Correct 5 ms 2552 KB Output is correct
19 Correct 5 ms 2552 KB Output is correct
20 Correct 5 ms 2552 KB Output is correct
21 Correct 5 ms 2552 KB Output is correct
22 Correct 5 ms 2552 KB Output is correct
23 Correct 5 ms 2552 KB Output is correct
24 Correct 5 ms 2552 KB Output is correct
25 Correct 79 ms 11512 KB Output is correct
26 Correct 107 ms 28264 KB Output is correct
27 Correct 160 ms 24280 KB Output is correct
28 Correct 191 ms 29860 KB Output is correct
29 Correct 86 ms 12920 KB Output is correct
30 Correct 160 ms 29436 KB Output is correct
31 Correct 72 ms 4216 KB Output is correct
32 Correct 207 ms 30000 KB Output is correct
33 Correct 132 ms 17400 KB Output is correct
34 Correct 141 ms 28920 KB Output is correct
35 Correct 142 ms 21536 KB Output is correct
36 Correct 194 ms 29928 KB Output is correct
37 Correct 149 ms 27856 KB Output is correct
38 Correct 188 ms 28200 KB Output is correct
39 Correct 108 ms 27536 KB Output is correct
40 Correct 184 ms 28128 KB Output is correct
41 Correct 159 ms 28024 KB Output is correct
42 Correct 183 ms 28296 KB Output is correct
43 Correct 127 ms 27568 KB Output is correct
44 Correct 193 ms 28280 KB Output is correct
45 Correct 113 ms 27672 KB Output is correct
46 Correct 179 ms 28280 KB Output is correct
47 Correct 114 ms 27512 KB Output is correct
48 Correct 182 ms 28384 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4 ms 376 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1276 KB Output is correct
2 Correct 6 ms 3068 KB Output is correct
3 Correct 5 ms 2424 KB Output is correct
4 Correct 6 ms 3068 KB Output is correct
5 Correct 5 ms 2556 KB Output is correct
6 Correct 6 ms 3064 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 6 ms 3068 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 6 ms 3064 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 6 ms 3068 KB Output is correct
13 Correct 5 ms 2552 KB Output is correct
14 Correct 5 ms 2552 KB Output is correct
15 Correct 5 ms 2552 KB Output is correct
16 Correct 5 ms 2552 KB Output is correct
17 Correct 5 ms 2552 KB Output is correct
18 Correct 5 ms 2552 KB Output is correct
19 Correct 5 ms 2552 KB Output is correct
20 Correct 5 ms 2552 KB Output is correct
21 Correct 5 ms 2552 KB Output is correct
22 Correct 5 ms 2552 KB Output is correct
23 Correct 5 ms 2552 KB Output is correct
24 Correct 5 ms 2552 KB Output is correct
25 Correct 79 ms 11512 KB Output is correct
26 Correct 107 ms 28264 KB Output is correct
27 Correct 160 ms 24280 KB Output is correct
28 Correct 191 ms 29860 KB Output is correct
29 Correct 86 ms 12920 KB Output is correct
30 Correct 160 ms 29436 KB Output is correct
31 Correct 72 ms 4216 KB Output is correct
32 Correct 207 ms 30000 KB Output is correct
33 Correct 132 ms 17400 KB Output is correct
34 Correct 141 ms 28920 KB Output is correct
35 Correct 142 ms 21536 KB Output is correct
36 Correct 194 ms 29928 KB Output is correct
37 Correct 149 ms 27856 KB Output is correct
38 Correct 188 ms 28200 KB Output is correct
39 Correct 108 ms 27536 KB Output is correct
40 Correct 184 ms 28128 KB Output is correct
41 Correct 159 ms 28024 KB Output is correct
42 Correct 183 ms 28296 KB Output is correct
43 Correct 127 ms 27568 KB Output is correct
44 Correct 193 ms 28280 KB Output is correct
45 Correct 113 ms 27672 KB Output is correct
46 Correct 179 ms 28280 KB Output is correct
47 Correct 114 ms 27512 KB Output is correct
48 Correct 182 ms 28384 KB Output is correct
49 Execution timed out 4 ms 376 KB Time limit exceeded (wall clock)
50 Halted 0 ms 0 KB -