#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]-1,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]--;
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3034 ms |
18992 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
