oj.uz

Submission #117630

# Submission time Handle Problem Language Result Execution time Memory
117630 2019-06-16T20:48:33 Z duality Two Antennas (JOI19_antennas) C++11
13 / 100
 3000 ms 19036 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 ----------

struct event { int x,l,r,t; };
bool comp(event a,event b) {
    if (a.x == b.x) return a.t > b.t;
    else return a.x > b.x;
}
int H[200000],A[200000],B[200000],L[200000],R[200000];
int ans[200000];
vector<event> events;
int arr[200000],m[200000];
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]);
    scanf("%d",&Q);
    for (i = 0; i < Q; i++) scanf("%d %d",&L[i],&R[i]),L[i]--,R[i]--;

    int j,r;
    fill(ans,ans+Q,-1);
    for (r = 0; r < 2; r++) {
        for (i = 0; i < N; i++) {
            events.pb((event){i-A[i],i,i,1});
            events.pb((event){i-B[i],i,i,-1});
            events.pb((event){i,i+A[i],i+B[i],0});
        }
        for (i = 0; i < Q; i++) events.pb((event){L[i],i,R[i],-2});
        sort(events.begin(),events.end(),comp);
        fill(arr,arr+N,-1),fill(m,m+N,-1);
        for (i = 0; i < events.size(); i++) {
            if (events[i].t == 1) {
                arr[events[i].l] = H[events[i].l];
            }
            else if (events[i].t == -1) {
                arr[events[i].l] = -1;
            }
            else if (events[i].t == 0) {
                for (j = max(events[i].l,0); j <= min(events[i].r,N-1); j++) {
                    if (arr[j] != -1) m[j] = max(m[j],r ? (H[events[i].x]-arr[j]):(arr[j]-H[events[i].x]));
                }
            }
            else {
                for (j = 0; j <= events[i].r; j++) {
                    ans[events[i].l] = max(ans[events[i].l],m[j]);
                }
            }
        }
        events.clear();
    }
    for (i = 0; i < Q; i++) printf("%d\n",ans[i]);

    return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:86:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < events.size(); i++) {
                     ~~^~~~~~~~~~~~~~~
antennas.cpp:70:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
antennas.cpp:71: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:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&Q);
     ~~~~~^~~~~~~~~
antennas.cpp:73:62: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < Q; i++) scanf("%d %d",&L[i],&R[i]),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 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 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 2 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 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 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 2 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 612 ms 6376 KB Output is correct
26 Correct 253 ms 1148 KB Output is correct
27 Correct 1462 ms 7780 KB Output is correct
28 Correct 1757 ms 7864 KB Output is correct
29 Correct 683 ms 6376 KB Output is correct
30 Correct 1142 ms 6120 KB Output is correct
31 Correct 379 ms 7516 KB Output is correct
32 Correct 1785 ms 7772 KB Output is correct
33 Correct 1052 ms 7480 KB Output is correct
34 Correct 821 ms 4196 KB Output is correct
35 Correct 1310 ms 7900 KB Output is correct
36 Correct 1777 ms 8000 KB Output is correct
37 Correct 944 ms 4196 KB Output is correct
38 Correct 1672 ms 7004 KB Output is correct
39 Correct 235 ms 1912 KB Output is correct
40 Correct 1701 ms 6988 KB Output is correct
41 Correct 1222 ms 6504 KB Output is correct
42 Correct 1682 ms 7016 KB Output is correct
43 Correct 547 ms 3316 KB Output is correct
44 Correct 1783 ms 7016 KB Output is correct
45 Correct 281 ms 1912 KB Output is correct
46 Correct 1668 ms 7016 KB Output is correct
47 Correct 436 ms 2304 KB Output is correct
48 Correct 1693 ms 7016 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3038 ms 19036 KB Time limit exceeded
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 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 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 2 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 612 ms 6376 KB Output is correct
26 Correct 253 ms 1148 KB Output is correct
27 Correct 1462 ms 7780 KB Output is correct
28 Correct 1757 ms 7864 KB Output is correct
29 Correct 683 ms 6376 KB Output is correct
30 Correct 1142 ms 6120 KB Output is correct
31 Correct 379 ms 7516 KB Output is correct
32 Correct 1785 ms 7772 KB Output is correct
33 Correct 1052 ms 7480 KB Output is correct
34 Correct 821 ms 4196 KB Output is correct
35 Correct 1310 ms 7900 KB Output is correct
36 Correct 1777 ms 8000 KB Output is correct
37 Correct 944 ms 4196 KB Output is correct
38 Correct 1672 ms 7004 KB Output is correct
39 Correct 235 ms 1912 KB Output is correct
40 Correct 1701 ms 6988 KB Output is correct
41 Correct 1222 ms 6504 KB Output is correct
42 Correct 1682 ms 7016 KB Output is correct
43 Correct 547 ms 3316 KB Output is correct
44 Correct 1783 ms 7016 KB Output is correct
45 Correct 281 ms 1912 KB Output is correct
46 Correct 1668 ms 7016 KB Output is correct
47 Correct 436 ms 2304 KB Output is correct
48 Correct 1693 ms 7016 KB Output is correct
49 Execution timed out 3038 ms 19036 KB Time limit exceeded
50 Halted 0 ms 0 KB -