240052026-02-03 13:43:47ercseferencDinamitcpp17Accepted 50/507ms1520 KiB
#include <bits/stdc++.h>
using namespace std;
int a[101][101][102];
int main()
{
    //ifstream f("szamok.txt");
    int n,m,l; cin>>n>>m>>l;
    for(int k=0; k<101; k++){
        for(int i=2; i<101; i++){
            a[i][0][k]=INT_MAX;
            a[0][i][k]=INT_MAX;}}
    a[1][0][0]=0;  a[0][1][0];
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            cin>>a[i][j][l+1];
    for(int k=0; k<=l; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=m; j++){
                int t=a[i][j][l+1];
                for(int p=0; p<=k; p++){
                    int u=t+min(a[i][j-1][k-p],a[i-1][j][k-p]);
                    if(p==0)a[i][j][k]=u;
                    else a[i][j][k]=min(a[i][j][k],u);
                    t/=2;}}
    cout<<a[n][m][l];
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms824 KiB
2Accepted0/06ms1332 KiB
3Accepted2/22ms1332 KiB
4Accepted2/23ms1332 KiB
5Accepted3/32ms1332 KiB
6Accepted3/32ms1332 KiB
7Accepted2/26ms1332 KiB
8Accepted3/37ms1516 KiB
9Accepted2/22ms824 KiB
10Accepted2/22ms820 KiB
11Accepted3/32ms820 KiB
12Accepted3/31ms820 KiB
13Accepted2/22ms820 KiB
14Accepted3/33ms824 KiB
15Accepted2/26ms1500 KiB
16Accepted3/36ms1520 KiB
17Accepted2/26ms1516 KiB
18Accepted3/36ms1376 KiB
19Accepted2/26ms1516 KiB
20Accepted3/36ms1512 KiB
21Accepted2/26ms1332 KiB
22Accepted3/36ms1508 KiB