oj.uz

Submission #203749

# Submission time Handle Problem Language Result Execution time Memory
203749 2020-02-22T05:06:51 Z dimash241 Two Antennas (JOI19_antennas) C++17
13 / 100
 324 ms 46584 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
struct ana {
	int h, a, b;
} a[N];
int dp[2002][2002];


int main () {
   	SpeedForce;
	cin >> n;
	for (int i = 1; i <= n; i ++) {
		cin >> a[i].h >> a[i].a >> a[i].b;
	}
	for (int i = 0; i <= n; i ++)
		for (int j = 0; j <= n; j ++)
			dp[i][j] = -1;
	for (int j = 1; j <= n; ++j) {
		
		for (int k = j + a[j].a; k <= n && k <= j + a[j].b; ++k) if ((k - j) >= a[k].a && a[k].b >= (k - j)) {
			dp[j][k] = abs(a[j].h - a[k].h);
				
		}
	}

	for (int i = n; i >= 1; i --) {
		for (int j = i; j <= n; ++j) {
			dp[i][j] = max(dp[i][j], dp[i][j-1]);
			dp[i-1][j] = max(dp[i-1][j], dp[i][j]);
		}
	}

	cin >> m;
	for (int i = 1; i <= m; i ++) {
		int l, r;
		cin >> l >> r;
		

		cout << dp[l][r] << '\n';
	}

   	return Accepted;
}

// B...a

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 888 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 6 ms 1400 KB Output is correct
4 Correct 5 ms 1912 KB Output is correct
5 Correct 5 ms 1656 KB Output is correct
6 Correct 6 ms 1912 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 6 ms 1912 KB Output is correct
9 Correct 5 ms 892 KB Output is correct
10 Correct 6 ms 1916 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 6 ms 1912 KB Output is correct
13 Correct 5 ms 1528 KB Output is correct
14 Correct 6 ms 1656 KB Output is correct
15 Correct 5 ms 1528 KB Output is correct
16 Correct 5 ms 1528 KB Output is correct
17 Correct 5 ms 1656 KB Output is correct
18 Correct 5 ms 1528 KB Output is correct
19 Correct 5 ms 1656 KB Output is correct
20 Correct 6 ms 1656 KB Output is correct
21 Correct 6 ms 1652 KB Output is correct
22 Correct 6 ms 1656 KB Output is correct
23 Correct 5 ms 1656 KB Output is correct
24 Correct 6 ms 1656 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 888 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 6 ms 1400 KB Output is correct
4 Correct 5 ms 1912 KB Output is correct
5 Correct 5 ms 1656 KB Output is correct
6 Correct 6 ms 1912 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 6 ms 1912 KB Output is correct
9 Correct 5 ms 892 KB Output is correct
10 Correct 6 ms 1916 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 6 ms 1912 KB Output is correct
13 Correct 5 ms 1528 KB Output is correct
14 Correct 6 ms 1656 KB Output is correct
15 Correct 5 ms 1528 KB Output is correct
16 Correct 5 ms 1528 KB Output is correct
17 Correct 5 ms 1656 KB Output is correct
18 Correct 5 ms 1528 KB Output is correct
19 Correct 5 ms 1656 KB Output is correct
20 Correct 6 ms 1656 KB Output is correct
21 Correct 6 ms 1652 KB Output is correct
22 Correct 6 ms 1656 KB Output is correct
23 Correct 5 ms 1656 KB Output is correct
24 Correct 6 ms 1656 KB Output is correct
25 Correct 46 ms 8056 KB Output is correct
26 Correct 30 ms 16376 KB Output is correct
27 Correct 90 ms 16760 KB Output is correct
28 Correct 99 ms 19704 KB Output is correct
29 Correct 52 ms 10232 KB Output is correct
30 Correct 71 ms 18552 KB Output is correct
31 Correct 57 ms 4728 KB Output is correct
32 Correct 89 ms 19580 KB Output is correct
33 Correct 70 ms 13176 KB Output is correct
34 Correct 56 ms 17784 KB Output is correct
35 Correct 99 ms 15480 KB Output is correct
36 Correct 92 ms 19704 KB Output is correct
37 Correct 57 ms 17144 KB Output is correct
38 Correct 86 ms 18300 KB Output is correct
39 Correct 32 ms 16124 KB Output is correct
40 Correct 93 ms 18424 KB Output is correct
41 Correct 75 ms 17660 KB Output is correct
42 Correct 91 ms 18296 KB Output is correct
43 Correct 41 ms 16504 KB Output is correct
44 Correct 92 ms 18296 KB Output is correct
45 Correct 31 ms 16248 KB Output is correct
46 Correct 88 ms 18296 KB Output is correct
47 Correct 38 ms 16380 KB Output is correct
48 Correct 91 ms 18296 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 324 ms 46584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 888 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 6 ms 1400 KB Output is correct
4 Correct 5 ms 1912 KB Output is correct
5 Correct 5 ms 1656 KB Output is correct
6 Correct 6 ms 1912 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 6 ms 1912 KB Output is correct
9 Correct 5 ms 892 KB Output is correct
10 Correct 6 ms 1916 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 6 ms 1912 KB Output is correct
13 Correct 5 ms 1528 KB Output is correct
14 Correct 6 ms 1656 KB Output is correct
15 Correct 5 ms 1528 KB Output is correct
16 Correct 5 ms 1528 KB Output is correct
17 Correct 5 ms 1656 KB Output is correct
18 Correct 5 ms 1528 KB Output is correct
19 Correct 5 ms 1656 KB Output is correct
20 Correct 6 ms 1656 KB Output is correct
21 Correct 6 ms 1652 KB Output is correct
22 Correct 6 ms 1656 KB Output is correct
23 Correct 5 ms 1656 KB Output is correct
24 Correct 6 ms 1656 KB Output is correct
25 Correct 46 ms 8056 KB Output is correct
26 Correct 30 ms 16376 KB Output is correct
27 Correct 90 ms 16760 KB Output is correct
28 Correct 99 ms 19704 KB Output is correct
29 Correct 52 ms 10232 KB Output is correct
30 Correct 71 ms 18552 KB Output is correct
31 Correct 57 ms 4728 KB Output is correct
32 Correct 89 ms 19580 KB Output is correct
33 Correct 70 ms 13176 KB Output is correct
34 Correct 56 ms 17784 KB Output is correct
35 Correct 99 ms 15480 KB Output is correct
36 Correct 92 ms 19704 KB Output is correct
37 Correct 57 ms 17144 KB Output is correct
38 Correct 86 ms 18300 KB Output is correct
39 Correct 32 ms 16124 KB Output is correct
40 Correct 93 ms 18424 KB Output is correct
41 Correct 75 ms 17660 KB Output is correct
42 Correct 91 ms 18296 KB Output is correct
43 Correct 41 ms 16504 KB Output is correct
44 Correct 92 ms 18296 KB Output is correct
45 Correct 31 ms 16248 KB Output is correct
46 Correct 88 ms 18296 KB Output is correct
47 Correct 38 ms 16380 KB Output is correct
48 Correct 91 ms 18296 KB Output is correct
49 Runtime error 324 ms 46584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Halted 0 ms 0 KB -