Submission #521712

#TimeUsernameProblemLanguageResultExecution timeMemory
521712blueTwo Antennas (JOI19_antennas)C++17
2 / 100
3067 ms2380 KiB
#include <iostream> using namespace std; int main() { int N; cin >> N; int H[1+N], A[1+N], B[1+N]; for(int i = 1; i <= N; i++) cin >> H[i] >> A[i] >> B[i]; int Q; cin >> Q; for(int j = 1; j <= Q; j++) { int L, R; cin >> L >> R; int ans = -1; for(int i = L; i <= R; i++) for(int j = i+1; j <= R; j++) if(i + A[i] <= j && j <= i + B[i]) if(j - B[j] <= i && i <= j - A[j]) ans = max(ans, abs(H[i] - H[j])); cout << ans << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...