oj.uz

Submission #123330

# Submission time Handle Problem Language Result Execution time Memory
123330 2019-07-01T07:28:39 Z 송준혁(#3022) Two Antennas (JOI19_antennas) C++14
13 / 100
 136 ms 19948 KB 
#include <bits/stdc++.h>
using namespace std;

int N, Q;
int H[2020], A[2020], B[2020];
int ans[2020][2020];

int main(){
    int L, R;
    scanf("%d", &N);
    memset(ans, -1, sizeof ans);
    for (int i=1; i<=N; i++) scanf("%d %d %d", &H[i], &A[i], &B[i]);
    for (int i=1; i<=N; i++) for (int j=i+1; j<=N; j++) if (A[i] <= abs(i-j) && A[j] <= abs(i-j) && B[i] >= abs(i-j) && B[j] >= abs(i-j)) ans[i][j] = abs(H[i]-H[j]);
    for (int i=N; i>=1; i--) for (int j=i+1; j<=N; j++) ans[i][j] = max(ans[i][j], max(ans[i+1][j], ans[i][j-1]));
    scanf("%d", &Q);
    while (Q--){
        scanf("%d %d", &L, &R);
        printf("%d\n", ans[L][R]);
    }
    return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
antennas.cpp:12:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i=1; i<=N; i++) scanf("%d %d %d", &H[i], &A[i], &B[i]);
                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &Q);
     ~~~~~^~~~~~~~~~
antennas.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &L, &R);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16248 KB Output is correct
2 Correct 20 ms 16248 KB Output is correct
3 Correct 16 ms 16376 KB Output is correct
4 Correct 15 ms 16248 KB Output is correct
5 Correct 16 ms 16248 KB Output is correct
6 Correct 15 ms 16252 KB Output is correct
7 Correct 15 ms 16360 KB Output is correct
8 Correct 15 ms 16348 KB Output is correct
9 Correct 15 ms 16376 KB Output is correct
10 Correct 16 ms 16248 KB Output is correct
11 Correct 15 ms 16248 KB Output is correct
12 Correct 16 ms 16248 KB Output is correct
13 Correct 15 ms 16248 KB Output is correct
14 Correct 16 ms 16248 KB Output is correct
15 Correct 15 ms 16248 KB Output is correct
16 Correct 15 ms 16248 KB Output is correct
17 Correct 17 ms 16348 KB Output is correct
18 Correct 15 ms 16248 KB Output is correct
19 Correct 15 ms 16248 KB Output is correct
20 Correct 16 ms 16248 KB Output is correct
21 Correct 15 ms 16248 KB Output is correct
22 Correct 15 ms 16248 KB Output is correct
23 Correct 15 ms 16248 KB Output is correct
24 Correct 15 ms 16348 KB Output is correct
25 Correct 72 ms 18680 KB Output is correct
26 Correct 31 ms 16568 KB Output is correct
27 Correct 107 ms 19852 KB Output is correct
28 Correct 118 ms 19948 KB Output is correct
29 Correct 76 ms 18712 KB Output is correct
30 Correct 84 ms 18728 KB Output is correct
31 Correct 82 ms 19168 KB Output is correct
32 Correct 113 ms 19832 KB Output is correct
33 Correct 109 ms 19604 KB Output is correct
34 Correct 67 ms 18168 KB Output is correct
35 Correct 123 ms 19780 KB Output is correct
36 Correct 136 ms 19832 KB Output is correct
37 Correct 70 ms 17784 KB Output is correct
38 Correct 115 ms 19096 KB Output is correct
39 Correct 34 ms 16632 KB Output is correct
40 Correct 110 ms 18952 KB Output is correct
41 Correct 83 ms 18300 KB Output is correct
42 Correct 107 ms 18952 KB Output is correct
43 Correct 47 ms 17144 KB Output is correct
44 Correct 104 ms 18936 KB Output is correct
45 Correct 37 ms 16760 KB Output is correct
46 Correct 106 ms 18948 KB Output is correct
47 Correct 44 ms 17144 KB Output is correct
48 Correct 103 ms 18936 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 17 ms 16248 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 15 ms 16248 KB Output is correct
2 Correct 20 ms 16248 KB Output is correct
3 Correct 16 ms 16376 KB Output is correct
4 Correct 15 ms 16248 KB Output is correct
5 Correct 16 ms 16248 KB Output is correct
6 Correct 15 ms 16252 KB Output is correct
7 Correct 15 ms 16360 KB Output is correct
8 Correct 15 ms 16348 KB Output is correct
9 Correct 15 ms 16376 KB Output is correct
10 Correct 16 ms 16248 KB Output is correct
11 Correct 15 ms 16248 KB Output is correct
12 Correct 16 ms 16248 KB Output is correct
13 Correct 15 ms 16248 KB Output is correct
14 Correct 16 ms 16248 KB Output is correct
15 Correct 15 ms 16248 KB Output is correct
16 Correct 15 ms 16248 KB Output is correct
17 Correct 17 ms 16348 KB Output is correct
18 Correct 15 ms 16248 KB Output is correct
19 Correct 15 ms 16248 KB Output is correct
20 Correct 16 ms 16248 KB Output is correct
21 Correct 15 ms 16248 KB Output is correct
22 Correct 15 ms 16248 KB Output is correct
23 Correct 15 ms 16248 KB Output is correct
24 Correct 15 ms 16348 KB Output is correct
25 Correct 72 ms 18680 KB Output is correct
26 Correct 31 ms 16568 KB Output is correct
27 Correct 107 ms 19852 KB Output is correct
28 Correct 118 ms 19948 KB Output is correct
29 Correct 76 ms 18712 KB Output is correct
30 Correct 84 ms 18728 KB Output is correct
31 Correct 82 ms 19168 KB Output is correct
32 Correct 113 ms 19832 KB Output is correct
33 Correct 109 ms 19604 KB Output is correct
34 Correct 67 ms 18168 KB Output is correct
35 Correct 123 ms 19780 KB Output is correct
36 Correct 136 ms 19832 KB Output is correct
37 Correct 70 ms 17784 KB Output is correct
38 Correct 115 ms 19096 KB Output is correct
39 Correct 34 ms 16632 KB Output is correct
40 Correct 110 ms 18952 KB Output is correct
41 Correct 83 ms 18300 KB Output is correct
42 Correct 107 ms 18952 KB Output is correct
43 Correct 47 ms 17144 KB Output is correct
44 Correct 104 ms 18936 KB Output is correct
45 Correct 37 ms 16760 KB Output is correct
46 Correct 106 ms 18948 KB Output is correct
47 Correct 44 ms 17144 KB Output is correct
48 Correct 103 ms 18936 KB Output is correct
49 Execution timed out 17 ms 16248 KB Time limit exceeded (wall clock)
50 Halted 0 ms 0 KB -