oj.uz

Submission #117609

# Submission time Handle Problem Language Result Execution time Memory
117609 2019-06-16T18:54:36 Z duality Two Antennas (JOI19_antennas) C++11
13 / 100
 118 ms 17784 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int H[200000],A[200000],B[200000];
int ans[2000][2000];
int main() {
    int i;
    int N,Q;
    scanf("%d",&N);
    for (i = 0; i < N; i++) scanf("%d %d %d",&H[i],&A[i],&B[i]);
    if (N <= 2000) {
        int j;
        for (i = 0; i < N; i++) {
            for (j = i+1; j < N; j++) {
                if (((j-i) >= max(A[i],A[j])) && ((j-i) <= min(B[i],B[j]))) ans[i][j] = abs(H[i]-H[j]);
                else ans[i][j] = -1;
            }
        }
        for (i = 3; i <= N; i++) {
            for (j = 0; j <= N-i; j++) ans[j][j+i-1] = max(ans[j][j+i-1],max(ans[j][j+i-2],ans[j+1][j+i-1]));
        }
        int L,R;
        scanf("%d",&Q);
        for (i = 0; i < Q; i++) {
            scanf("%d %d",&L,&R);
            printf("%d\n",ans[L-1][R-1]);
        }
    }

    return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
antennas.cpp:64:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d %d %d",&H[i],&A[i],&B[i]);
                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:77:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&Q);
         ~~~~~^~~~~~~~~
antennas.cpp:79:18: 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 2 ms 768 KB Output is correct
2 Correct 3 ms 1664 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 3 ms 1652 KB Output is correct
5 Correct 3 ms 1536 KB Output is correct
6 Correct 4 ms 1664 KB Output is correct
7 Correct 3 ms 1536 KB Output is correct
8 Correct 3 ms 1664 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 1792 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 3 ms 1664 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct
14 Correct 3 ms 1536 KB Output is correct
15 Correct 3 ms 1536 KB Output is correct
16 Correct 2 ms 1536 KB Output is correct
17 Correct 3 ms 1408 KB Output is correct
18 Correct 3 ms 1536 KB Output is correct
19 Correct 3 ms 1408 KB Output is correct
20 Correct 3 ms 1536 KB Output is correct
21 Correct 3 ms 1536 KB Output is correct
22 Correct 3 ms 1536 KB Output is correct
23 Correct 3 ms 1408 KB Output is correct
24 Correct 3 ms 1536 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 3 ms 1664 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 3 ms 1652 KB Output is correct
5 Correct 3 ms 1536 KB Output is correct
6 Correct 4 ms 1664 KB Output is correct
7 Correct 3 ms 1536 KB Output is correct
8 Correct 3 ms 1664 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 1792 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 3 ms 1664 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct
14 Correct 3 ms 1536 KB Output is correct
15 Correct 3 ms 1536 KB Output is correct
16 Correct 2 ms 1536 KB Output is correct
17 Correct 3 ms 1408 KB Output is correct
18 Correct 3 ms 1536 KB Output is correct
19 Correct 3 ms 1408 KB Output is correct
20 Correct 3 ms 1536 KB Output is correct
21 Correct 3 ms 1536 KB Output is correct
22 Correct 3 ms 1536 KB Output is correct
23 Correct 3 ms 1408 KB Output is correct
24 Correct 3 ms 1536 KB Output is correct
25 Correct 56 ms 7672 KB Output is correct
26 Correct 35 ms 14436 KB Output is correct
27 Correct 101 ms 14968 KB Output is correct
28 Correct 106 ms 17784 KB Output is correct
29 Correct 59 ms 8380 KB Output is correct
30 Correct 78 ms 16476 KB Output is correct
31 Correct 60 ms 4472 KB Output is correct
32 Correct 118 ms 17688 KB Output is correct
33 Correct 86 ms 11256 KB Output is correct
34 Correct 64 ms 15812 KB Output is correct
35 Correct 100 ms 13520 KB Output is correct
36 Correct 104 ms 17656 KB Output is correct
37 Correct 74 ms 15360 KB Output is correct
38 Correct 101 ms 16396 KB Output is correct
39 Correct 32 ms 14200 KB Output is correct
40 Correct 107 ms 16384 KB Output is correct
41 Correct 80 ms 15736 KB Output is correct
42 Correct 108 ms 16384 KB Output is correct
43 Correct 53 ms 14688 KB Output is correct
44 Correct 98 ms 16376 KB Output is correct
45 Correct 34 ms 14328 KB Output is correct
46 Correct 99 ms 16356 KB Output is correct
47 Correct 42 ms 14456 KB Output is correct
48 Correct 99 ms 16452 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 67 ms 6520 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 3 ms 1664 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 3 ms 1652 KB Output is correct
5 Correct 3 ms 1536 KB Output is correct
6 Correct 4 ms 1664 KB Output is correct
7 Correct 3 ms 1536 KB Output is correct
8 Correct 3 ms 1664 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 1792 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 3 ms 1664 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct
14 Correct 3 ms 1536 KB Output is correct
15 Correct 3 ms 1536 KB Output is correct
16 Correct 2 ms 1536 KB Output is correct
17 Correct 3 ms 1408 KB Output is correct
18 Correct 3 ms 1536 KB Output is correct
19 Correct 3 ms 1408 KB Output is correct
20 Correct 3 ms 1536 KB Output is correct
21 Correct 3 ms 1536 KB Output is correct
22 Correct 3 ms 1536 KB Output is correct
23 Correct 3 ms 1408 KB Output is correct
24 Correct 3 ms 1536 KB Output is correct
25 Correct 56 ms 7672 KB Output is correct
26 Correct 35 ms 14436 KB Output is correct
27 Correct 101 ms 14968 KB Output is correct
28 Correct 106 ms 17784 KB Output is correct
29 Correct 59 ms 8380 KB Output is correct
30 Correct 78 ms 16476 KB Output is correct
31 Correct 60 ms 4472 KB Output is correct
32 Correct 118 ms 17688 KB Output is correct
33 Correct 86 ms 11256 KB Output is correct
34 Correct 64 ms 15812 KB Output is correct
35 Correct 100 ms 13520 KB Output is correct
36 Correct 104 ms 17656 KB Output is correct
37 Correct 74 ms 15360 KB Output is correct
38 Correct 101 ms 16396 KB Output is correct
39 Correct 32 ms 14200 KB Output is correct
40 Correct 107 ms 16384 KB Output is correct
41 Correct 80 ms 15736 KB Output is correct
42 Correct 108 ms 16384 KB Output is correct
43 Correct 53 ms 14688 KB Output is correct
44 Correct 98 ms 16376 KB Output is correct
45 Correct 34 ms 14328 KB Output is correct
46 Correct 99 ms 16356 KB Output is correct
47 Correct 42 ms 14456 KB Output is correct
48 Correct 99 ms 16452 KB Output is correct
49 Incorrect 67 ms 6520 KB Output isn't correct
50 Halted 0 ms 0 KB -