제출 #720037

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
720037	2023-04-07 10:01:35	a_aguilo	건포도 (IOI09_raisins)	C++14	100 / 100	1612 ms	29376 KiB

raisins

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>
using namespace std;
int N, M;
vector<vector<vector<vector<int>>>> DP;
//DP[x1][x2][y1][y2];
vector<vector<int>> preSum, raisinsMap;
int getSum(int x1, int x2, int y1, int y2){
  int ans;
  if(x1 <= 0){
    if(y1 <= 0) ans = preSum[x2][y2];
    else ans = preSum[x2][y2] - preSum[x2][y1-1];
  }else{
    if(y1 <= 0) ans = preSum[x2][y2]-preSum[x1-1][y2];
    else{
      ans = preSum[x2][y2] + preSum[x1-1][y1-1] - preSum[x2][y1-1] - preSum[x1-1][y2];
    }
  }
  return ans;
}
int solve(int x1, int x2, int y1, int y2){
  if(x1 == x2 && y1 == y2) return 0;
  if(DP[x1][x2][y1][y2] != -1) return DP[x1][x2][y1][y2];
  int payNow = getSum(x1, x2, y1, y2);
  if(x1 == x2){
    int ans = solve(x1, x2, y1+1, y2);
    for(int dist = 1; (y1 + dist + 1) <= y2; ++dist){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100