oj.uz

Submission #133251

# Submission time Handle Problem Language Result Execution time Memory
133251 2019-07-20T09:59:35 Z Kewo Cake 3 (JOI19_cake3) C++17
5 / 100
 23 ms 18808 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mid ((x + y) / 2)
#define left (ind * 2)
#define right (ind * 2 + 1)
#define mp make_pair
#define timer ((double)clock() / CLOCKS_PER_SEC)
#define endl "\n"
#define spc " "
#define d1(x) cerr<<#x<<":"<<x<<endl
#define d2(x, y) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<endl
#define d3(x, y, z) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<" "<<#z<<":"<<z<<endl
#define fast_io() ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;

typedef long long int lli;
typedef pair<lli, lli> ii;
typedef pair<ii, int> iii;
typedef pair<double, double> dd;

const int N = (int)(1e2 + 5);
const int LOG = (int)(20);
const lli inf = (lli)(1e15);

lli n, m, ans = -inf, dp[N][N][N];
ii p[N];

lli f(int x, int y, int z) {
	if(z < 0)
		return -inf;
	if(x == y + 1) {
		if(z == 0)
			return 0;
		else
			return -inf;
	}
	if(dp[x][y][z] != -1)
		return dp[x][y][z];
	return dp[x][y][z] = max(f(x + 1, y, z), f(x + 1, y, z - 1) + p[x].se);
}

int main() {
	fast_io();
	// freopen("inp.in", "r", stdin);

	memset(dp, -1, sizeof dp);
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
		cin >> p[i].se >> p[i].fi;
	sort(p + 1, p + n + 1);
	for(int i = 1; i <= n; i++)
		for(int j = i + m - 1; j <= n; j++)
			ans = max(ans, f(i + 1, j - 1, m - 2) + p[i].se + p[j].se - 2 * (p[j].fi - p[i].fi));
	cout << ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9336 KB Output is correct
2 Correct 11 ms 9336 KB Output is correct
3 Correct 11 ms 9340 KB Output is correct
4 Correct 11 ms 9336 KB Output is correct
5 Correct 11 ms 9336 KB Output is correct
6 Correct 10 ms 9436 KB Output is correct
7 Correct 11 ms 9336 KB Output is correct
8 Correct 11 ms 9468 KB Output is correct
9 Correct 10 ms 9464 KB Output is correct
10 Correct 11 ms 9464 KB Output is correct
11 Correct 11 ms 9336 KB Output is correct
12 Correct 12 ms 9464 KB Output is correct
13 Correct 11 ms 9336 KB Output is correct
14 Correct 11 ms 9464 KB Output is correct
15 Correct 12 ms 9336 KB Output is correct
16 Correct 11 ms 9464 KB Output is correct
17 Correct 11 ms 9464 KB Output is correct
18 Correct 11 ms 9336 KB Output is correct
19 Correct 12 ms 9336 KB Output is correct
20 Correct 11 ms 9336 KB Output is correct
21 Correct 11 ms 9464 KB Output is correct
22 Correct 11 ms 9464 KB Output is correct
23 Correct 11 ms 9336 KB Output is correct
24 Correct 11 ms 9464 KB Output is correct
25 Correct 12 ms 9464 KB Output is correct
26 Correct 11 ms 9336 KB Output is correct
27 Correct 11 ms 9336 KB Output is correct
28 Correct 11 ms 9464 KB Output is correct
29 Correct 10 ms 9336 KB Output is correct
30 Correct 11 ms 9504 KB Output is correct
31 Correct 11 ms 9464 KB Output is correct
32 Correct 11 ms 9336 KB Output is correct
33 Correct 11 ms 9436 KB Output is correct
34 Correct 11 ms 9464 KB Output is correct
35 Correct 11 ms 9464 KB Output is correct
36 Correct 11 ms 9336 KB Output is correct
37 Correct 10 ms 9336 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9336 KB Output is correct
2 Correct 11 ms 9336 KB Output is correct
3 Correct 11 ms 9340 KB Output is correct
4 Correct 11 ms 9336 KB Output is correct
5 Correct 11 ms 9336 KB Output is correct
6 Correct 10 ms 9436 KB Output is correct
7 Correct 11 ms 9336 KB Output is correct
8 Correct 11 ms 9468 KB Output is correct
9 Correct 10 ms 9464 KB Output is correct
10 Correct 11 ms 9464 KB Output is correct
11 Correct 11 ms 9336 KB Output is correct
12 Correct 12 ms 9464 KB Output is correct
13 Correct 11 ms 9336 KB Output is correct
14 Correct 11 ms 9464 KB Output is correct
15 Correct 12 ms 9336 KB Output is correct
16 Correct 11 ms 9464 KB Output is correct
17 Correct 11 ms 9464 KB Output is correct
18 Correct 11 ms 9336 KB Output is correct
19 Correct 12 ms 9336 KB Output is correct
20 Correct 11 ms 9336 KB Output is correct
21 Correct 11 ms 9464 KB Output is correct
22 Correct 11 ms 9464 KB Output is correct
23 Correct 11 ms 9336 KB Output is correct
24 Correct 11 ms 9464 KB Output is correct
25 Correct 12 ms 9464 KB Output is correct
26 Correct 11 ms 9336 KB Output is correct
27 Correct 11 ms 9336 KB Output is correct
28 Correct 11 ms 9464 KB Output is correct
29 Correct 10 ms 9336 KB Output is correct
30 Correct 11 ms 9504 KB Output is correct
31 Correct 11 ms 9464 KB Output is correct
32 Correct 11 ms 9336 KB Output is correct
33 Correct 11 ms 9436 KB Output is correct
34 Correct 11 ms 9464 KB Output is correct
35 Correct 11 ms 9464 KB Output is correct
36 Correct 11 ms 9336 KB Output is correct
37 Correct 10 ms 9336 KB Output is correct
38 Runtime error 23 ms 18808 KB Execution killed with signal 11 (could be triggered by violating memory limits)
39 Halted 0 ms 0 KB -

Subtask #3
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9336 KB Output is correct
2 Correct 11 ms 9336 KB Output is correct
3 Correct 11 ms 9340 KB Output is correct
4 Correct 11 ms 9336 KB Output is correct
5 Correct 11 ms 9336 KB Output is correct
6 Correct 10 ms 9436 KB Output is correct
7 Correct 11 ms 9336 KB Output is correct
8 Correct 11 ms 9468 KB Output is correct
9 Correct 10 ms 9464 KB Output is correct
10 Correct 11 ms 9464 KB Output is correct
11 Correct 11 ms 9336 KB Output is correct
12 Correct 12 ms 9464 KB Output is correct
13 Correct 11 ms 9336 KB Output is correct
14 Correct 11 ms 9464 KB Output is correct
15 Correct 12 ms 9336 KB Output is correct
16 Correct 11 ms 9464 KB Output is correct
17 Correct 11 ms 9464 KB Output is correct
18 Correct 11 ms 9336 KB Output is correct
19 Correct 12 ms 9336 KB Output is correct
20 Correct 11 ms 9336 KB Output is correct
21 Correct 11 ms 9464 KB Output is correct
22 Correct 11 ms 9464 KB Output is correct
23 Correct 11 ms 9336 KB Output is correct
24 Correct 11 ms 9464 KB Output is correct
25 Correct 12 ms 9464 KB Output is correct
26 Correct 11 ms 9336 KB Output is correct
27 Correct 11 ms 9336 KB Output is correct
28 Correct 11 ms 9464 KB Output is correct
29 Correct 10 ms 9336 KB Output is correct
30 Correct 11 ms 9504 KB Output is correct
31 Correct 11 ms 9464 KB Output is correct
32 Correct 11 ms 9336 KB Output is correct
33 Correct 11 ms 9436 KB Output is correct
34 Correct 11 ms 9464 KB Output is correct
35 Correct 11 ms 9464 KB Output is correct
36 Correct 11 ms 9336 KB Output is correct
37 Correct 10 ms 9336 KB Output is correct
38 Runtime error 23 ms 18808 KB Execution killed with signal 11 (could be triggered by violating memory limits)
39 Halted 0 ms 0 KB -