제출 #660280

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
660280	2022-11-21 13:05:12	ivopav	Raisins (IOI09_raisins)	C++14	100 / 100	914 ms	29388 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 sum(const vector<vector<int>>& mat2,int x1,int y1,int x2,int y2){
    if (x1==0 && y1==0){
        return mat2[y2][x2];
    }
    else if(x1==0){
        return mat2[y2][x2]-mat2[y1-1][x2];
    }
    else if(y1==0){
        return mat2[y2][x2]-mat2[y2][x1-1];
    }
    else{
        return mat2[y2][x2]-mat2[y1-1][x2]-mat2[y2][x1-1]+mat2[y1-1][x1-1];
    }
}
int rek(const vector<vector<int>>& mat,const vector<vector<int>>& mat2,vector<vector<vector<vector<int>>>>& mem,int x1,int y1,int x2,int y2){
    if (x1==x2 && y1==y2){
        return 0;
    }
    if (mem[x1][y1][x2][y2]!=-1){
        return mem[x1][y1][x2][y2];
    }
    int najm=numeric_limits<int>::max(); 
    for (int i=x1;i<x2;i++){
        int pom=rek(mat,mat2,mem,x1,y1,i,y2);
        int pom2=rek(mat,mat2,mem,i+1,y1,x2,y2);
        najm=min(najm,pom+pom2);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100