Submission #290725

#	Time	Username	Problem	Language	Result	Execution time	Memory
290725		Atill83	Wombats (IOI13_wombats)	C++14	55 / 100	20054 ms	17120 KiB

wombats

#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
long long dp[205][2][205];
int h[5000][200], v[5000][200];
int lastdid[205];
int cur = 0;
int r, c;
void clc(int i){
    lastdid[i] = cur;
    memset(dp[i], 0x7f, sizeof(dp[i]));
    dp[i][0][i] = 0;
    int bas = 1;
    for(int j = 0; j < r; j++){
        if(!bas){
            for(int k = 0; k < c; k++){
                dp[i][j&1][k] = dp[i][j&1^1][k] + v[j - 1][k];
            }
        }
        bas = 0;

        for(int k = 1; k < c; k++){
            dp[i][j&1][k] = min(dp[i][j&1][k], dp[i][j&1][k - 1] + h[j][k - 1]);
        }
        for(int k = c - 2; k >= 0; k--){
            dp[i][j&1][k] = min(dp[i][j&1][k], dp[i][j&1][k + 1] + h[j][k]);
        }
    }
}
int gt(int a, int b){
    if(lastdid[a] < cur) clc(a);
    return dp[a][(r - 1) & 1][b];
}

void init(int R, int C, int H[5000][200], int V[5000][200]) {
    r = R;
    c = C;
    for(int i = 0; i < R; i++){
        for(int j = 0; j < C; j++){
            if(i != R - 1) v[i][j] = V[i][j];
            if(j != C - 1) h[i][j] = H[i][j];
        }
    }
    for(int i = 0; i < c; i++)
        clc(i);
}

void changeH(int P, int Q, int W) {
    cur++;
    h[P][Q] = W;
}

void changeV(int P, int Q, int W) {
    cur++;
    v[P][Q] = W;
}

int escape(int V1, int V2) {
    return gt(V1, V2);
}

Compilation message (stderr)

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
   15 |  int res;
      |      ^~~
wombats.cpp: In function 'void clc(int)':
wombats.cpp:17:40: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   17 |                 dp[i][j&1][k] = dp[i][j&1^1][k] + v[j - 1][k];
      |                                       ~^~

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 0 / 21
• Subtask 6: 0 / 24