#include <bits/stdc++.h>
#ifndef ARTHUR_LOCAL
#include "aliens.h"
#endif
using namespace std;
using ll = long long;
const int MAXN = 501;
ll dp[MAXN][MAXN];
ll take_photos(int n, int m, int k_in_question, vector<int> R, vector<int> C)
{
for(int i=0; i<MAXN; i++)
{
for(int j=0; j<MAXN; j++)
{
dp[i][j]=1e18;
}
}
dp[0][0]=0;
for(int i=0; i<n; i++) R[i]=R[i]+1;
R.push_back(0);
sort(R.begin(),R.end());
for(int i=1; i<=n; i++) // covering the first i things
{
for(int j=1; j<=i; j++) // with j intervals
{
for(int k=i; k>=1; k--) // the last thing considered was k (so k--i square)
{
dp[i][j] = min(dp[i][j], ll(R[i]-R[k]+1)*ll(R[i]-R[k]+1) + dp[k-1][j-1]);
}
// cout << i << " " << j << " " << dp[i][j] << endl;
}
}
ll ans = 1e18;
for(int j=1; j<=k_in_question; j++)
{
ans = min(ans,dp[n][j]);
}
return ans;
}
#ifdef ARTHUR_LOCAL
int main()
{
vector<int> V = {1,2};
cout << take_photos(2,10,1,V,V) << endl;
}
#endif
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
2296 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
2296 KB |
Correct answer: answer = 1 |
2 |
Correct |
3 ms |
2296 KB |
Correct answer: answer = 4 |
3 |
Correct |
3 ms |
2296 KB |
Correct answer: answer = 1 |
4 |
Correct |
4 ms |
2296 KB |
Correct answer: answer = 5 |
5 |
Correct |
3 ms |
2296 KB |
Correct answer: answer = 41 |
6 |
Correct |
3 ms |
2296 KB |
Correct answer: answer = 71923 |
7 |
Correct |
10 ms |
2296 KB |
Correct answer: answer = 77137 |
8 |
Correct |
111 ms |
2300 KB |
Correct answer: answer = 764 |
9 |
Correct |
111 ms |
2296 KB |
Correct answer: answer = 250000 |
10 |
Correct |
108 ms |
2296 KB |
Correct answer: answer = 500 |
11 |
Correct |
4 ms |
2296 KB |
Correct answer: answer = 32 |
12 |
Correct |
109 ms |
2296 KB |
Correct answer: answer = 130050 |
13 |
Correct |
110 ms |
2368 KB |
Correct answer: answer = 5110 |
14 |
Correct |
18 ms |
2296 KB |
Correct answer: answer = 2626 |
15 |
Correct |
18 ms |
2296 KB |
Correct answer: answer = 796 |
16 |
Correct |
108 ms |
2296 KB |
Correct answer: answer = 7580 |
17 |
Correct |
115 ms |
2296 KB |
Correct answer: answer = 1904 |
18 |
Correct |
108 ms |
2296 KB |
Correct answer: answer = 996004 |
19 |
Correct |
108 ms |
2296 KB |
Correct answer: answer = 38817 |
20 |
Correct |
115 ms |
2296 KB |
Correct answer: answer = 4096 |
21 |
Correct |
112 ms |
2296 KB |
Correct answer: answer = 1 |
22 |
Correct |
109 ms |
2296 KB |
Correct answer: answer = 1 |
23 |
Correct |
113 ms |
2296 KB |
Correct answer: answer = 2040 |
24 |
Correct |
118 ms |
2332 KB |
Correct answer: answer = 2 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
2296 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
2296 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
2296 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
2296 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |