oj.uz

답안 #1100977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100977 2024-10-15T07:04:43 Z alexander707070 웜뱃 (IOI13_wombats) C++14
12 / 100
 16997 ms 25680 KB 
#include<bits/stdc++.h>
#include "wombats.h"
using namespace std;

const int inf=1e9;

int n,m;
int rows[5007][207];
int cols[207][5007];

int dp[207][2][207];

int getsum(int row,int l,int r){
    return rows[row][r]-rows[row][l-1];
}

void calcdp(){
    for(int fin=1;fin<=m;fin++){

        for(int r=n;r>=1;r--){
            for(int c=1;c<=m;c++){
                
                dp[fin][r%2][c]=inf;
                
                if(r==n)dp[fin][r%2][c]=getsum(r,min(c,fin),max(c,fin)-1);
                else{
                    for(int k=1;k<=m;k++){
                        dp[fin][r%2][c]=min(dp[fin][r%2][c],dp[fin][1-r%2][k]+getsum(r,min(k,c),max(k,c)-1)+cols[k][r]);
                    }
                }
            }
        }

    }
}

void init(int R, int C, int H[5000][200], int V[5000][200]) {
//void init(int R,int C,vector< vector<int> > H,vector< vector<int> > V){
    n=R; m=C;

    for(int i=1;i<=n;i++){
        for(int f=1;f<=m-1;f++){
            rows[i][f]=H[i-1][f-1];
            rows[i][f]+=rows[i][f-1];
        }
    }

    for(int i=1;i<=m;i++){
        for(int f=1;f<=n-1;f++){
            cols[i][f]=V[f-1][i-1];
        }
    }

    calcdp();
}

void changeH(int P, int Q, int W) {
    P++; Q++;

    int dif=W-(rows[P][Q]-rows[P][Q-1]);
    for(int i=Q;i<=m-1;i++){
        rows[P][i]+=dif;
    }

    calcdp();
}

void changeV(int P, int Q, int W) {
    P++; Q++;
    cols[P][Q]=W;

    calcdp();
}

int escape(int V1, int V2) {
    V1++; V2++;

    return dp[V2][1][V1];
}


/*int main(){

    init(3,4,{{0,2,5},{7,1,1},{0,4,0}},{{0,0,0,2},{0,3,4,7}});

    cout<<escape(2,1)<<"\n";
    cout<<escape(3,3)<<"\n";

    changeV(0,0,5);
    changeH(1,1,6);

    cout<<escape(2,1)<<"\n";

 
	return 0;
}*/

Compilation message

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
   15 |  int res;
      |      ^~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 11 ms 13392 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2552 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 2 ms 6480 KB Output is correct
6 Correct 2 ms 6480 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 2 ms 6480 KB Output is correct
11 Correct 40 ms 7472 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16997 ms 6756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 25 ms 25680 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16921 ms 6748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16840 ms 6748 KB Output isn't correct
2 Halted 0 ms 0 KB -