Submission #962938

# Submission time Handle Problem Language Result Execution time Memory
962938 2024-04-14T09:58:16 Z penguin133 Aliens (IOI16_aliens) C++17
12 / 100
92 ms 5608 KB
#include <bits/stdc++.h>
using namespace std;
#include "aliens.h"
//#define int long long
typedef long long ll;
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll dp[505][505], mn[1000005];
pi stuf[1000005];
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {
	for(int i = 0; i <= m; i++)mn[i] = 1e18;
	for(int i = 0; i < n; i++){
		if(r[i] > c[i])swap(r[i], c[i]);
		mn[c[i]] = min(mn[c[i]], (ll)r[i]);
		stuf[i] = {c[i], r[i]};
	}
	sort(stuf, stuf + n);
	for(int i = m - 1; i >= 0; i--)mn[i] = min(mn[i], mn[i + 1]);
	//return 0;
	for(int i = 0; i <= n; i++)dp[i][0] = 1e18;
	for(int i = 0; i < n; i++){
		for(int j = 1; j <= k; j++){
			dp[i][j] = 1e18;
			for(int a = i; a >= 0; a--){
				if(j)dp[i][j] = min(dp[i][j], (a ? dp[a - 1][j - 1] : 0) + (stuf[i].fi - mn[stuf[a].fi] + 1) * (stuf[i].fi - mn[stuf[a].fi] + 1) );
			}
		}
	}
    return dp[n - 1][k];
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Correct answer: answer = 4
2 Correct 1 ms 4444 KB Correct answer: answer = 4
3 Correct 1 ms 4444 KB Correct answer: answer = 4
4 Incorrect 1 ms 4444 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4544 KB Correct answer: answer = 1
2 Correct 1 ms 4444 KB Correct answer: answer = 4
3 Correct 1 ms 4444 KB Correct answer: answer = 1
4 Correct 1 ms 4444 KB Correct answer: answer = 5
5 Correct 1 ms 4544 KB Correct answer: answer = 41
6 Correct 1 ms 4444 KB Correct answer: answer = 71923
7 Correct 1 ms 4444 KB Correct answer: answer = 77137
8 Correct 51 ms 5576 KB Correct answer: answer = 764
9 Correct 2 ms 5464 KB Correct answer: answer = 250000
10 Correct 92 ms 5580 KB Correct answer: answer = 500
11 Correct 1 ms 4444 KB Correct answer: answer = 32
12 Correct 1 ms 5468 KB Correct answer: answer = 130050
13 Correct 9 ms 5468 KB Correct answer: answer = 5110
14 Correct 2 ms 4444 KB Correct answer: answer = 2626
15 Correct 6 ms 4444 KB Correct answer: answer = 796
16 Correct 10 ms 5468 KB Correct answer: answer = 7580
17 Correct 24 ms 5608 KB Correct answer: answer = 1904
18 Correct 1 ms 5468 KB Correct answer: answer = 996004
19 Correct 5 ms 5468 KB Correct answer: answer = 38817
20 Correct 19 ms 5468 KB Correct answer: answer = 4096
21 Correct 1 ms 5464 KB Correct answer: answer = 1
22 Correct 85 ms 5580 KB Correct answer: answer = 1
23 Correct 23 ms 5464 KB Correct answer: answer = 2040
24 Correct 91 ms 5576 KB Correct answer: answer = 2
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Correct answer: answer = 4
2 Correct 1 ms 4444 KB Correct answer: answer = 4
3 Correct 1 ms 4444 KB Correct answer: answer = 4
4 Incorrect 1 ms 4444 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Correct answer: answer = 4
2 Correct 1 ms 4444 KB Correct answer: answer = 4
3 Correct 1 ms 4444 KB Correct answer: answer = 4
4 Incorrect 1 ms 4444 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Correct answer: answer = 4
2 Correct 1 ms 4444 KB Correct answer: answer = 4
3 Correct 1 ms 4444 KB Correct answer: answer = 4
4 Incorrect 1 ms 4444 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Correct answer: answer = 4
2 Correct 1 ms 4444 KB Correct answer: answer = 4
3 Correct 1 ms 4444 KB Correct answer: answer = 4
4 Incorrect 1 ms 4444 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -