oj.uz

Submission #286565

# Submission time Handle Problem Language Result Execution time Memory
286565 2020-08-30T14:37:22 Z evpipis Wombats (IOI13_wombats) C++11
76 / 100
 20000 ms 39096 KB 
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;

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

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 buck[75], root, temp;
    int opt[len_m][len_m];

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

        for (int i = 0; i < m; i++)
            for (int j = (i==0?0:opt[i-1][i-1]); 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][i] = j;
        for (int sz = 2; sz <= m; sz++){
            for (int a = 0, b = sz-1; b < m; a++, b++)
                for (int c = opt[a][b-1]; c <= opt[a+1][b]; 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][b] = c;

            for (int b = 0, a = sz-1; a < m; a++, b++)
                for (int c = opt[a][b+1]; c >= opt[a-1][b]; 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][b] = c;
        }

        return res;
    }

    void upd_buck(int b){
        int st = b*k, en = min(n, (b+1)*k);

        buck[b] = node(st);
        for (int i = st+1; i < en; i++)
            temp = node(i), buck[b] = join(buck[b], temp);
    }

    void upd_root(){
        root = buck[0];
        for (int b = 1; b*k < n; b++)
            root = join(root, buck[b]);
    }

    int ask(int a, int b){
        return root.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 = sqrt(n);
    for (int b = 0; k*b < n; b++)
        data.upd_buck(b);
    data.upd_root();
}

void changeH(int P, int Q, int W) {
    hor[P][Q] = W;
    data.upd_buck(P/k);
    data.upd_root();
}

void changeV(int P, int Q, int W) {
    ver[P][Q] = W;
    data.upd_buck(P/k);
    data.upd_root();
}

int escape(int V1, int V2) {
    return data.ask(V1, V2);
}

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;
      |      ^~~
wombats.cpp: In function 'void<unnamed struct>::upd_buck(int)':
wombats.cpp:64:18: warning: '<anonymous>' may be used uninitialized in this function [-Wmaybe-uninitialized]
   64 |             temp = node(i), buck[b] = join(buck[b], temp);
      |             ~~~~~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1416 ms 20520 KB Output is correct
2 Correct 1384 ms 20532 KB Output is correct
3 Correct 1470 ms 23304 KB Output is correct
4 Correct 1400 ms 20600 KB Output is correct
5 Correct 1380 ms 20472 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 896 KB Output is correct
8 Correct 1 ms 896 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 3 ms 1664 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 2 ms 1664 KB Output is correct
7 Correct 3 ms 1664 KB Output is correct
8 Correct 2 ms 1664 KB Output is correct
9 Correct 2 ms 1664 KB Output is correct
10 Correct 2 ms 1664 KB Output is correct
11 Correct 86 ms 4088 KB Output is correct
12 Correct 2 ms 1664 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 245 ms 3320 KB Output is correct
2 Correct 178 ms 3320 KB Output is correct
3 Correct 247 ms 3116 KB Output is correct
4 Correct 250 ms 3072 KB Output is correct
5 Correct 247 ms 3104 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 896 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 809 ms 3104 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1392 ms 28492 KB Output is correct
2 Correct 1391 ms 28600 KB Output is correct
3 Correct 1407 ms 28536 KB Output is correct
4 Correct 1431 ms 29856 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 3200 KB Output is correct
2 Correct 174 ms 3320 KB Output is correct
3 Correct 237 ms 3072 KB Output is correct
4 Correct 237 ms 3072 KB Output is correct
5 Correct 241 ms 3192 KB Output is correct
6 Correct 1375 ms 28536 KB Output is correct
7 Correct 1387 ms 28664 KB Output is correct
8 Correct 1389 ms 28536 KB Output is correct
9 Correct 1474 ms 30072 KB Output is correct
10 Correct 1390 ms 20524 KB Output is correct
11 Correct 1382 ms 20600 KB Output is correct
12 Correct 1461 ms 23364 KB Output is correct
13 Correct 1413 ms 20692 KB Output is correct
14 Correct 1397 ms 20644 KB Output is correct
15 Correct 1 ms 896 KB Output is correct
16 Correct 1 ms 896 KB Output is correct
17 Correct 1 ms 896 KB Output is correct
18 Correct 2 ms 1664 KB Output is correct
19 Correct 2 ms 1664 KB Output is correct
20 Correct 2 ms 1664 KB Output is correct
21 Correct 2 ms 1664 KB Output is correct
22 Correct 2 ms 1664 KB Output is correct
23 Correct 3 ms 1664 KB Output is correct
24 Correct 2 ms 1664 KB Output is correct
25 Correct 86 ms 4088 KB Output is correct
26 Correct 2 ms 1664 KB Output is correct
27 Correct 822 ms 3072 KB Output is correct
28 Correct 6923 ms 33280 KB Output is correct
29 Correct 8140 ms 28972 KB Output is correct
30 Correct 8349 ms 29072 KB Output is correct
31 Correct 7000 ms 34952 KB Output is correct
32 Correct 1 ms 1024 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 3208 KB Output is correct
2 Correct 185 ms 3320 KB Output is correct
3 Correct 245 ms 3072 KB Output is correct
4 Correct 243 ms 3192 KB Output is correct
5 Correct 252 ms 3104 KB Output is correct
6 Correct 1442 ms 28732 KB Output is correct
7 Correct 1417 ms 28488 KB Output is correct
8 Correct 1427 ms 28484 KB Output is correct
9 Correct 1524 ms 29904 KB Output is correct
10 Correct 1454 ms 20532 KB Output is correct
11 Correct 1401 ms 20532 KB Output is correct
12 Correct 1473 ms 23348 KB Output is correct
13 Correct 1411 ms 20600 KB Output is correct
14 Correct 1407 ms 20472 KB Output is correct
15 Correct 2451 ms 38864 KB Output is correct
16 Execution timed out 20060 ms 39096 KB Time limit exceeded
17 Halted 0 ms 0 KB -