Submission #169081

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
169081	2019-12-18 10:45:52	mohammad_kilani	Aliens (IOI16_aliens)	C++17	12 / 100	255 ms	126360 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 <bits/stdc++.h>
#include "aliens.h"
using namespace std;
const int N = 4010 , K = 4010;
vector< pair<int,int> > arr , tmp;
long long dp[N][K];
int n , m , k;
long long solve(int i,int cur){
  if(i == n)
    return 0;
  if(cur == k)
    return (long long)1e18;
  if(dp[i][cur] != -1)
    return dp[i][cur];
  dp[i][cur] = (long long)1e18;
  int mx = -1;
  for(int j = i ;j < n;j++){
    mx = max(mx,arr[j].second);
    dp[i][cur] = min(dp[i][cur] , (long long)(mx - arr[i].first + 1) * (long long)(mx - arr[i].first + 1) + solve(j + 1, cur + 1));
  }
  return dp[i][cur];
}
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++){
    arr.push_back(make_pair(min(r[i] , c[i]) , max(r[i] , c[i])));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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