답안 #375802

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
375802	2021-03-10T02:37:20 Z	fhvirus	Two Antennas (JOI19_antennas)	C++17	13 / 100	136 ms	23552 KB

antennas

// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOO(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) begin(x),end(x)
template<typename I> bool chmax(I &a, I b){ return a < b ? ( a = b, true ) : false;}
template<typename I> bool chmin(I &a, I b){ return a > b ? ( a = b, true ) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){cerr<<endl;}
template<class I, class...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<class I> void DE(I a, I b){ while(a < b) cerr<<*a<<" \n"[next(a) == b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif
const int N = 2002;
int n, q;
int h[N];
bool g[N][N];
int dp[N][N];
int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n;

	assert(n < N);

	FOR(i,n){
		int l, r; cin >> h[i] >> l >> r;
		FOR(j,n){
			int d = abs(i - j);
			if(l <= d and d <= r) g[i][j] = true;
		}
	}

	FOR(i,n) FOO(j,i+1,n-1){
		if(!g[i][j] or !g[j][i]){
			dp[i][j] = dp[j][i] = -1;
			continue;
		}
		dp[i][j] = abs(h[i] - h[j]);
	}
	FOO(len,3,n){
		FOR(l,n){
			int r = l + len - 1;
			if(r >= n) continue;
			chmax(dp[l][r], dp[l+1][r]);
			chmax(dp[l][r], dp[l][r-1]);
		}
	}

	cin >> q;
	FOR(_,q){
		int l, r; cin >> l >> r;
		--l, --r;
		cout << dp[l][r] << '\n';
	}

	return 0;
}

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1004 KB	Output is correct
2	Correct	2 ms	2412 KB	Output is correct
3	Correct	2 ms	1900 KB	Output is correct
4	Correct	2 ms	2412 KB	Output is correct
5	Correct	2 ms	2028 KB	Output is correct
6	Correct	3 ms	2412 KB	Output is correct
7	Correct	2 ms	2284 KB	Output is correct
8	Correct	3 ms	2412 KB	Output is correct
9	Correct	1 ms	1004 KB	Output is correct
10	Correct	3 ms	2560 KB	Output is correct
11	Correct	1 ms	748 KB	Output is correct
12	Correct	2 ms	2412 KB	Output is correct
13	Correct	2 ms	2028 KB	Output is correct
14	Correct	2 ms	2156 KB	Output is correct
15	Correct	2 ms	2028 KB	Output is correct
16	Correct	2 ms	2028 KB	Output is correct
17	Correct	2 ms	2156 KB	Output is correct
18	Correct	2 ms	2028 KB	Output is correct
19	Correct	2 ms	2176 KB	Output is correct
20	Correct	2 ms	2156 KB	Output is correct
21	Correct	2 ms	2028 KB	Output is correct
22	Correct	2 ms	2156 KB	Output is correct
23	Correct	2 ms	2028 KB	Output is correct
24	Correct	2 ms	2156 KB	Output is correct

Subtask #2
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1004 KB	Output is correct
2	Correct	2 ms	2412 KB	Output is correct
3	Correct	2 ms	1900 KB	Output is correct
4	Correct	2 ms	2412 KB	Output is correct
5	Correct	2 ms	2028 KB	Output is correct
6	Correct	3 ms	2412 KB	Output is correct
7	Correct	2 ms	2284 KB	Output is correct
8	Correct	3 ms	2412 KB	Output is correct
9	Correct	1 ms	1004 KB	Output is correct
10	Correct	3 ms	2560 KB	Output is correct
11	Correct	1 ms	748 KB	Output is correct
12	Correct	2 ms	2412 KB	Output is correct
13	Correct	2 ms	2028 KB	Output is correct
14	Correct	2 ms	2156 KB	Output is correct
15	Correct	2 ms	2028 KB	Output is correct
16	Correct	2 ms	2028 KB	Output is correct
17	Correct	2 ms	2156 KB	Output is correct
18	Correct	2 ms	2028 KB	Output is correct
19	Correct	2 ms	2176 KB	Output is correct
20	Correct	2 ms	2156 KB	Output is correct
21	Correct	2 ms	2028 KB	Output is correct
22	Correct	2 ms	2156 KB	Output is correct
23	Correct	2 ms	2028 KB	Output is correct
24	Correct	2 ms	2156 KB	Output is correct
25	Correct	59 ms	9580 KB	Output is correct
26	Correct	58 ms	19868 KB	Output is correct
27	Correct	109 ms	17968 KB	Output is correct
28	Correct	121 ms	23276 KB	Output is correct
29	Correct	53 ms	12012 KB	Output is correct
30	Correct	97 ms	22176 KB	Output is correct
31	Correct	62 ms	5100 KB	Output is correct
32	Correct	117 ms	23404 KB	Output is correct
33	Correct	82 ms	15340 KB	Output is correct
34	Correct	81 ms	21456 KB	Output is correct
35	Correct	96 ms	18284 KB	Output is correct
36	Correct	136 ms	23552 KB	Output is correct
37	Correct	84 ms	20972 KB	Output is correct
38	Correct	111 ms	22124 KB	Output is correct
39	Correct	55 ms	19948 KB	Output is correct
40	Correct	111 ms	22252 KB	Output is correct
41	Correct	98 ms	21484 KB	Output is correct
42	Correct	124 ms	22252 KB	Output is correct
43	Correct	64 ms	20460 KB	Output is correct
44	Correct	114 ms	22124 KB	Output is correct
45	Correct	52 ms	20076 KB	Output is correct
46	Correct	110 ms	22124 KB	Output is correct
47	Correct	61 ms	20204 KB	Output is correct
48	Correct	116 ms	22156 KB	Output is correct

Subtask #3
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	2 ms	492 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1004 KB	Output is correct
2	Correct	2 ms	2412 KB	Output is correct
3	Correct	2 ms	1900 KB	Output is correct
4	Correct	2 ms	2412 KB	Output is correct
5	Correct	2 ms	2028 KB	Output is correct
6	Correct	3 ms	2412 KB	Output is correct
7	Correct	2 ms	2284 KB	Output is correct
8	Correct	3 ms	2412 KB	Output is correct
9	Correct	1 ms	1004 KB	Output is correct
10	Correct	3 ms	2560 KB	Output is correct
11	Correct	1 ms	748 KB	Output is correct
12	Correct	2 ms	2412 KB	Output is correct
13	Correct	2 ms	2028 KB	Output is correct
14	Correct	2 ms	2156 KB	Output is correct
15	Correct	2 ms	2028 KB	Output is correct
16	Correct	2 ms	2028 KB	Output is correct
17	Correct	2 ms	2156 KB	Output is correct
18	Correct	2 ms	2028 KB	Output is correct
19	Correct	2 ms	2176 KB	Output is correct
20	Correct	2 ms	2156 KB	Output is correct
21	Correct	2 ms	2028 KB	Output is correct
22	Correct	2 ms	2156 KB	Output is correct
23	Correct	2 ms	2028 KB	Output is correct
24	Correct	2 ms	2156 KB	Output is correct
25	Correct	59 ms	9580 KB	Output is correct
26	Correct	58 ms	19868 KB	Output is correct
27	Correct	109 ms	17968 KB	Output is correct
28	Correct	121 ms	23276 KB	Output is correct
29	Correct	53 ms	12012 KB	Output is correct
30	Correct	97 ms	22176 KB	Output is correct
31	Correct	62 ms	5100 KB	Output is correct
32	Correct	117 ms	23404 KB	Output is correct
33	Correct	82 ms	15340 KB	Output is correct
34	Correct	81 ms	21456 KB	Output is correct
35	Correct	96 ms	18284 KB	Output is correct
36	Correct	136 ms	23552 KB	Output is correct
37	Correct	84 ms	20972 KB	Output is correct
38	Correct	111 ms	22124 KB	Output is correct
39	Correct	55 ms	19948 KB	Output is correct
40	Correct	111 ms	22252 KB	Output is correct
41	Correct	98 ms	21484 KB	Output is correct
42	Correct	124 ms	22252 KB	Output is correct
43	Correct	64 ms	20460 KB	Output is correct
44	Correct	114 ms	22124 KB	Output is correct
45	Correct	52 ms	20076 KB	Output is correct
46	Correct	110 ms	22124 KB	Output is correct
47	Correct	61 ms	20204 KB	Output is correct
48	Correct	116 ms	22156 KB	Output is correct
49	Runtime error	2 ms	492 KB	Execution killed with signal 6
50	Halted	0 ms	0 KB	-

답안 #375802

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 11.0 / 11.0

Subtask #3 0 / 22.0

Subtask #4 0 / 65.0

Subtask #1
2.0 / 2.0

Subtask #2
11.0 / 11.0

Subtask #3
0 / 22.0

Subtask #4
0 / 65.0