Submission #286635

#	Time	Username	Problem	Language	Result	Execution time	Memory
286635		evpipis	Wombats (IOI13_wombats)	C++11	100 / 100	14499 ms	69784 KiB

wombats

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

const int len_n = 5005, len_m = 205, inf = 1e9+10, k = 20;
int hor[len_n][len_m], ver[len_n][len_m], n, m;

struct{
    struct node{
        int to[len_m][len_m];

        node(){
            for (int a = 0; a < m; a++)
                for (int b = 0; b < m; b++)
                    to[a][b] = inf; // check this
        }

        node(int i){
            for (int a = 0, suma = 0; a < m; a++){
                for (int b = 0, dif = suma; b < m; b++){
                    to[a][b] = dif + ver[i][b];

                    if (b < a)
                        dif -= hor[i][b];
                    else
                        dif += hor[i][b];
                }

                suma += hor[i][a];
            }
        }
    };

    node lev1[len_n/k+5], lev2[len_n/(k*k)+5], lev3[1], temp;
    int opt[len_m][2];

    node join(node &fir, node &sec){
        node res;

        for (int i = 0; i < m; i++)
            for (int j = (i==0?0:opt[i-1][0]); j < m; j++)
                if (fir.to[i][j]+sec.to[j][i] < res.to[i][i])
                    res.to[i][i] = fir.to[i][j]+sec.to[j][i], opt[i][0] = opt[i][1] = j;
        for (int sz = 2; sz <= m; sz++){
            for (int a = 0, b = sz-1; b < m; a++, b++)
                for (int c = opt[a][0]; c <= opt[a+1][0]; c++)
                    if (fir.to[a][c]+sec.to[c][b] < res.to[a][b])
                        res.to[a][b] = fir.to[a][c]+sec.to[c][b], opt[a][0] = c;

            for (int b = 0, a = sz-1; a < m; a++, b++)
                for (int c = opt[a][1]; c >= opt[a-1][1]; c--)
                    if (fir.to[a][c]+sec.to[c][b] < res.to[a][b])
                        res.to[a][b] = fir.to[a][c]+sec.to[c][b], opt[a][1] = c;
        }

        return res;
    }

    void upd_lev1(int b){
        lev1[b] = node(b*k);
        for (int i = b*k+1; i < (b+1)*k && i < n; i++)
            temp = node(i), lev1[b] = join(lev1[b], temp);
    }

    void upd_lev2(int b){
        lev2[b] = lev1[b*k];
        for (int i = b*k+1; i < (b+1)*k && i*k < n; i++)
            lev2[b] = join(lev2[b], lev1[i]);
    }

    void upd_lev3(int b = 0){
        lev3[b] = lev2[b*k];
        for (int i = b*k+1; i < (b+1)*k && i*k*k < n; i++)
            lev3[b] = join(lev3[b], lev2[i]);
    }

    int ask(int a, int b){
        return lev3[0].to[a][b];
    }
} data;

void init(int R, int C, int H[5000][200], int V[5000][200]) {
    n = R, m = C;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m-1; j++)
            hor[i][j] = H[i][j];
    for (int i = 0; i < n-1; i++)
        for (int j = 0; j < m; j++)
            ver[i][j] = V[i][j];

    // k = 20;
    for (int i = 0; i*k < n; i++)
        data.upd_lev1(i);
    for (int i = 0; i*k*k < n; i++)
        data.upd_lev2(i);
    for (int i = 0; i*k*k*k < n; i++)
        data.upd_lev3(i);
}

void changeH(int a, int b, int c) {
    hor[a][b] = c;
    data.upd_lev1(a/k);
    data.upd_lev2(a/(k*k));
    data.upd_lev3(a/(k*k*k));
}

void changeV(int a, int b, int c) {
    ver[a][b] = c;
    data.upd_lev1(a/k);
    data.upd_lev2(a/(k*k));
    data.upd_lev3(a/(k*k*k));
}

int escape(int V1, int V2) {
    return data.ask(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<unnamed struct>::upd_lev1(int)':
wombats.cpp:62:18: warning: '<anonymous>' may be used uninitialized in this function [-Wmaybe-uninitialized]
   62 |             temp = node(i), lev1[b] = join(lev1[b], temp);
      |             ~~~~~^~~~~~~~~

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