Submission #585298

#	Time	Username	Problem	Language	Result	Execution time	Memory
585298		Dan4Life	Wombats (IOI13_wombats)	C++17	39 / 100	20098 ms	20892 KiB

wombats

#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
const int INF = (int)1e9;
int h[5002][202], v[5002][202], dp[5002][202]; bool ok;
pii segTree[800], r_segTree[800];
int ans[204][204], n, m;

inline int mir(int x){return m-x-1;}

int pref(int i, int j, int k){
    if(j==k) return 0; int ans = 0;
    if(j>k) swap(j,k);
    for(int l = j; l < k; l++) ans+=h[i][l];
    return ans;
}

pii combine(pii left, pii right){
    pii temp; temp.fi = left.fi+right.fi;
    temp.se = min(left.se, left.fi+right.se);
    return temp;
}

void update(int x, int val, int i, pii segTree[], int p=1, int l=0, int r=m-1){
    if(l==r){ segTree[p]={val,val+v[i][l]}; return; }
    int mid = (l+r)/2;
    if(x<=mid) update(x,val,i,segTree,p*2,l,mid);
    else update(x,val,i,segTree,p*2+1,mid+1,r);
    segTree[p] = combine(segTree[p*2], segTree[p*2+1]);
}

int query(int i, int j, pii segTree[], int p=1, int l=0, int r=m-1){
    if(i>r or j<l or i>j) return INF;
    return INF;/*
    if(l==r){segTree[p]=v; return; }
    int mid = (l+r)/2;


    if(x<=mid) update(x,v,segTree,p*2,l,mid);
    else update(x,v,segTree,p*2+1,mid+1,r);*/
}

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

void update(int V1){

    dp[0][V1] = 0;
    for(int x = V1-1; x>=0; x--) dp[0][x] = dp[0][x+1]+h[0][x];
    for(int x = V1+1; x<m; x++) dp[0][x] = dp[0][x-1]+h[0][x-1];
    for(int i = 1; i < n; i++){
        for(int j = 0; j < m; j++){
            dp[i][j] = INF;
            for(int k = 0; k < m; k++)
                dp[i][j] = min(dp[i][j], dp[i-1][k]+pref(i,j,k)+v[i-1][k]);
        }
    }
    for(int i = 0; i < m; i++) ans[V1][i] = dp[n-1][i];
    return;



    dp[0][V1] = 0;
    for(int x = V1-1; x>=0; x--) dp[0][x] = dp[0][x+1]+h[0][x];
    for(int x = V1+1; x<m; x++) dp[0][x] = dp[0][x-1]+h[0][x-1];
    for(int i = 1; i < n; i++){
        for(int j = 0; j < m; j++)
            update(j, dp[i-1][j], i-1, segTree),
            update(mir(j), dp[i-1][j], i-1, r_segTree);
        for(int j = 0; j < m; j++)
            dp[i][j] = min({dp[i-1][j]+v[i-1][j],
                query(j+1,m-1,segTree), query(mir(j-1),mir(0),r_segTree)});
    }
    for(int i = 0; i < m; i++) ans[V1][i] = dp[n-1][i];
}

void changeH(int P, int Q, int W) {
    h[P][Q]=W; for(int i = 0; i < m; i++) update(i);
}

void changeV(int P, int Q, int W) {
    v[P][Q]=W; for(int i = 0; i < m; i++) update(i);
}

int escape(int V1, int V2) {
    if(ok) for(int i = 0; i < m; i++) update(i);
    ok=0; return ans[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 'int pref(int, int, int)':
wombats.cpp:16:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   16 |     if(j==k) return 0; int ans = 0;
      |     ^~
wombats.cpp:16:24: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   16 |     if(j==k) return 0; int ans = 0;
      |                        ^~~

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