Submission #249995

#	Time	Username	Problem	Language	Result	Execution time	Memory
249995		MarcoMeijer	Wombats (IOI13_wombats)	C++14	100 / 100	15809 ms	229008 KiB

wombats

#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()

const int MX = 6000, DIV=20;
int r, c;
int h[MX][200], v[MX][200];

int SEG[200][200][1300];
int dp[200][200][2];
int best[200][200];
int n;

void createSeg(int x, int p) {
    int bg=x*DIV;
    int ed=min(x*DIV+DIV, r);

    int m = ed-bg;

    RE(y,m) {
        bool cur=y%2;
        if(y == 0) {
            RE(i,c) RE(j,c) dp[i][j][0] = INF;
            RE(i,c) dp[i][i][0] = 0;
        } else {
            RE(i,c) RE(j,c) dp[i][j][cur] = dp[i][j][!cur]+v[bg+y-1][j];
        }
        RE(i,c) {
            REP(j,1,c  ) dp[i][j][cur] = min(dp[i][j][cur], dp[i][j-1][cur]+h[bg+y][j-1]);
            REV(j,0,c-1) dp[i][j][cur] = min(dp[i][j][cur], dp[i][j+1][cur]+h[bg+y][j]);
        }
    }
    bool cur=!(m%2);
    RE(i,c) RE(j,c) SEG[i][j][p] = dp[i][j][cur];
}
void combineSeg(int x, int p) {
    x = (x+1)*DIV-1;

    RE(i,c) RE(j,c) SEG[i][j][p] = INF;
    RE(i,c) {
        int j = 0;
        RE(k,c) {
            int val = SEG[i][k][p*2+1]+SEG[k][j][p*2+2]+v[x][k];
            if(val < SEG[i][j][p]) {
                SEG[i][j][p] = val;
                best[i][j] = k;
            }
        }
    }
    RE(j,c) {
        int i = c-1;
        RE(k,c) {
            int val = SEG[i][k][p*2+1]+SEG[k][j][p*2+2]+v[x][k];
            if(val < SEG[i][j][p]) {
                SEG[i][j][p] = val;
                best[i][j] = k;
            }
        }
    }
    REV(i,0,c-1) {
        REP(j,1,c) {
            REI(k,best[i][j-1],best[i+1][j]) {
                int val = SEG[i][k][p*2+1]+SEG[k][j][p*2+2]+v[x][k];
                if(val < SEG[i][j][p]) {
                    SEG[i][j][p] = val;
                    best[i][j] = k;
                }
            }
        }
    }
}
void buildSeg(int p=0, int l=0, int r=n-1) {
    if(l == r) {
        createSeg(l, p);
        return;
    }
    int m=(l+r)/2;
    buildSeg(p*2+1,l,m);
    buildSeg(p*2+2,m+1,r);
    combineSeg(m,p);
}
void updateSeg(int i, int p=0, int l=0, int r=n-1) {
    if(i < l || i > r) return;
    if(l == r) {
        createSeg(i,p);
        return;
    }
    int m=(l+r)/2;
    updateSeg(i,p*2+1,l,m);
    updateSeg(i,p*2+2,m+1,r);
    combineSeg(m,p);
}

void init(int R, int C, int H[5000][200], int V[5000][200]) {
    r=R, c=C;
    RE(i,r) RE(j,c) h[i][j]=H[i][j]; 
    RE(i,r) RE(j,c) v[i][j]=V[i][j];
    n = (r+DIV-1)/DIV;
    buildSeg();
}

void changeH(int P, int Q, int W) {
    h[P][Q] = W;
    updateSeg(P/DIV);
}

void changeV(int P, int Q, int W) {
    v[P][Q] = W;
    updateSeg(P/DIV);
}

int escape(int V1, int V2) {
    return SEG[V1][V2][0];
}

Compilation message (stderr)

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

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