Submission #312928

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
312928	2020-10-14 17:26:39	fergonzgut21	Raisins (IOI09_raisins)	C++14	100 / 100	1000 ms	28152 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 <iostream>
#define MAX 53
using namespace std;
int N, M, A[MAX][MAX], B[MAX][MAX], DP[MAX][MAX][MAX][MAX];
int solve (int x1, int y1, int x2, int y2)
{
    if (DP[x1][y1][x2][y2] > -1)
        return DP[x1][y1][x2][y2];
    if (x1 == x2 && y1 == y2)
    {
        DP[x1][y1][x2][y2] = 0;
        return 0;
    }
    int res = 1073741822;
    int n1 = 0;
    int n2 = 0;
    for (int i = x1; i < x2; i++)
    {
        n1 = solve(x1,y1,i,y2);
        n2 = solve(i + 1,y1,x2,y2);
        if (n1 + n2 < res)
            res = n1 + n2;
    }
    for (int i = y1; i < y2; i++)
    {
        n1 = solve(x1,y1,x2,i);
        n2 = solve(x1,i + 1,x2,y2);
        if (n1 + n2 < res)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100