제출 #730074

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
730074		cig32	Two Antennas (JOI19_antennas)	C++17	2 / 100	3059 ms	8488 KiB

antennas

#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
void solve(int tc) {
  int n, q;
  cin >> n;
  int h[n+1], a[n+1], b[n+1];
  for(int i=1; i<=n; i++) cin >> h[i] >> a[i] >> b[i];
  cin >> q;
  while(q--) {
    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(a[i] <= abs(i-j) && abs(i-j) <= b[i] && a[j] <= abs(i-j) && abs(i-j) <= b[j]) ans = max(ans, abs(h[i] - h[j]));
      }
    }
    cout << ans << "\n";
  }
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 搏盡

• Subtask 1: 2 / 2
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 65