Submission #375825

#	Time	Username	Problem	Language	Result	Execution time	Memory
375825		Kevin_Zhang_TW	Two Antennas (JOI19_antennas)	C++17	13 / 100	105 ms	31472 KiB

antennas

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif 
const int MAX_N = 2010, MAX_Q = 200010;

#define int ll

int n, h[MAX_N], a[MAX_N], b[MAX_N];
int q, ql[MAX_Q], qr[MAX_Q], res[MAX_Q];

int ans[MAX_N][MAX_N];
bool valid(int i, int j) {
	if (i == j) return false;
	int dis = abs(j - i);
	return a[i] <= dis && dis <= b[i]
		&& a[j] <= dis && dis <= b[j];
};

void precal() {
	for (int i = 1;i <= n;++i)
		for (int j = i;j <= n;++j) {
			ans[i][j] = -1;
			if (valid(i, j)) {
				DE(i, j);
				ans[i][j] = abs(h[i]-h[j]);
			}
		}

	for (int w = 0;w < n;++w)
		for (int l = 1;l + w <= n;++l) {
			int r = l + w;
			chmax(ans[l-1][r], ans[l][r]);
			chmax(ans[l][r+1], ans[l][r]);
		}
}

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n ;
	for (int i = 1;i <= n;++i)
		cin >> h[i] >> a[i] >> b[i];

	cin >> q;
	for (int i = 1;i <= q;++i) 
		cin >> ql[i] >> qr[i];

	if (n > 2000)  return -1;
		
	precal();

	for (int i = 1;i <= q;++i) 
		res[i] = ans[ ql[i] ][ qr[i] ];

	for (int i = 1;i <= q;++i)
		cout << res[i] << '\n';
}

Compilation message (stderr)

antennas.cpp: In function 'void precal()':
antennas.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
antennas.cpp:37:5: note: in expansion of macro 'DE'
   37 |     DE(i, j);
      |     ^~

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