oj.uz

Submission #962515

# Submission time Handle Problem Language Result Execution time Memory
962515 2024-04-13T18:16:23 Z MinaRagy06 Aliens (IOI16_aliens) C++17
12 / 100
 141 ms 2396 KB 
#include <bits/stdc++.h>
#include "aliens.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long
#define sz(x) (int) x.size()

ll take_photos(int n, int crap, int m, vector<int> R, vector<int> C) {
	array<ll, 2> a[n + 1];
	vector<ll> v;
	for (int i = 1; i <= n; i++) {
		a[i] = {R[i - 1], C[i - 1]};
		if (a[i][0] > a[i][1]) swap(a[i][0], a[i][1]);
	}
	sort(a + 1, a + n + 1);
	ll dp[m + 1][n + 1];
	memset(dp, '?', sizeof dp);
	for (int j = 0; j <= m; j++) {
		dp[j][0] = 0;
	}
	for (int j = 1; j <= m; j++) {
		for (int i = 1; i <= n; i++) {
			ll mx = -1e18;
			for (int k = i; k >= 1; k--) {
				mx = max(mx, a[k][1]);
				ll c = (mx - a[k][0] + 1) * (mx - a[k][0] + 1);
				if (i + 1 <= n && mx >= a[i + 1][0]) {
					c -= (mx - a[i + 1][0] + 1) * (mx - a[i + 1][0] + 1);
				}
				dp[j][i] = min(dp[j][i], dp[j - 1][k - 1] + c);
//				cout << k << " to " << i << ": " << c << '\n';
			}
		}
	}
	return dp[m][n];
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 348 KB Correct answer: answer = 4
4 Incorrect 0 ms 344 KB Wrong answer: output = 9, expected = 12
5 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 1
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 344 KB Correct answer: answer = 1
4 Correct 1 ms 348 KB Correct answer: answer = 5
5 Correct 1 ms 348 KB Correct answer: answer = 41
6 Correct 0 ms 344 KB Correct answer: answer = 71923
7 Correct 1 ms 344 KB Correct answer: answer = 77137
8 Correct 58 ms 1404 KB Correct answer: answer = 764
9 Correct 1 ms 348 KB Correct answer: answer = 250000
10 Correct 107 ms 2396 KB Correct answer: answer = 500
11 Correct 0 ms 348 KB Correct answer: answer = 32
12 Correct 1 ms 348 KB Correct answer: answer = 130050
13 Correct 13 ms 640 KB Correct answer: answer = 5110
14 Correct 2 ms 344 KB Correct answer: answer = 2626
15 Correct 5 ms 604 KB Correct answer: answer = 796
16 Correct 8 ms 576 KB Correct answer: answer = 7580
17 Correct 29 ms 860 KB Correct answer: answer = 1904
18 Correct 1 ms 344 KB Correct answer: answer = 996004
19 Correct 5 ms 344 KB Correct answer: answer = 38817
20 Correct 24 ms 604 KB Correct answer: answer = 4096
21 Correct 1 ms 584 KB Correct answer: answer = 1
22 Correct 141 ms 2392 KB Correct answer: answer = 1
23 Correct 27 ms 856 KB Correct answer: answer = 2040
24 Correct 141 ms 2396 KB Correct answer: answer = 2

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 348 KB Correct answer: answer = 4
4 Incorrect 0 ms 344 KB Wrong answer: output = 9, expected = 12
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 348 KB Correct answer: answer = 4
4 Incorrect 0 ms 344 KB Wrong answer: output = 9, expected = 12
5 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 348 KB Correct answer: answer = 4
4 Incorrect 0 ms 344 KB Wrong answer: output = 9, expected = 12
5 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 348 KB Correct answer: answer = 4
4 Incorrect 0 ms 344 KB Wrong answer: output = 9, expected = 12
5 Halted 0 ms 0 KB -