Submission #22947

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
22947	2017-04-30 16:27:10	sampriti	Aliens (IOI16_aliens)	C++14	0 / 100	0 ms	7792 KiB

aliens

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "aliens.h"
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int N, M, K;
vector<long long> R, C;
int R_map[1000000];
long long dp[500][500];
long long solve(int i, int j) {
  if(i == N) return 0;
  if(j == K && i < N) return LLONG_MAX/2;
  if(dp[i][j] != -1) return dp[i][j];
  dp[i][j] = LLONG_MAX/2;
  for(int k = i; k < N; k++) {
    long long width = max(C[i], max(R[k], C[k])) - R[i] + 1;
    dp[i][j] = min(dp[i][j], width * width + solve(k + 1, j + 1));
  }
  return dp[i][j];
}
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {
  N = n, M = m, K = k;
  for(int i = 0; i < N; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 4
• Subtask 2: 0 / 12
• Subtask 3: 0 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40