oj.uz

Submission #962314

# Submission time Handle Problem Language Result Execution time Memory
962314 2024-04-13T10:27:28 Z danikoynov Wombats (IOI13_wombats) C++14
76 / 100
 20000 ms 91628 KB 
#include "wombats.h"
#include<bits/stdc++.h>

using namespace std;

const int maxr = 5010, maxc = 210;
const int maxblock = sqrt(maxr) + 10;
void precalculate();
int h[maxr][maxc], v[maxr][maxc], dp[maxblock][maxc][maxc];
int r, c, block_size;

struct node
{
     int t[maxc][maxc];

     node()
     {
          for (int i = 0; i < maxc; i ++)
               for (int j = 0; j < maxc; j ++)
          {
               t[i][j] = 0;
          }
     }
};

const int inf = 2e9 + 10;

node tree[4 * maxblock];
int opt[maxc][maxc];
void unite(int root, int row)
{
     for (int i = 0; i < c; i ++)
     for (int j = 0; j < c; j ++)
     tree[root].t[i][j] = inf;

     int var;
     for (int i = 0; i < c; i ++)
          for (int j = 0; j < c; j ++)
          for (int k = 0; k < c; k ++)
          {
               var =tree[root * 2].t[i][k] + tree[root * 2 + 1].t[k][j] + v[row - 1][k];
               if (var < tree[root].t[i][j])
               {
                    tree[root].t[i][j] = var;
                    opt[i][j] = k;
               }
               //tree[root].t[i][j] = min(tree[root].t[i][j], );
          }

     for (int i = 0; i < c; i ++)
     {
          for (int j = i + 1; j < c; j ++)
          {
               assert(opt[i][j] >= opt[i][j - 1]);
          }
     }

}

void get_leaf(int root, int bl)
{
     for (int i = 0; i < c; i ++)
          for (int j = 0; j < c; j ++)
          tree[root].t[i][j] = dp[bl][i][j];
}

void build(int root, int left, int right)
{
     if (left == right)
     {
          get_leaf(root, left);
          return;
     }

     int mid = (left + right) / 2;
     build(root * 2, left, mid);
     build(root * 2 + 1, mid + 1, right);

     unite(root, (mid + 1) * block_size);
}

void update(int root, int left, int right, int pivot)
{
     if (left == right)
     {
          get_leaf(root, left);
          return;
     }

     int mid = (left + right) / 2;
     if (pivot <= mid)
          update(root * 2, left, mid, pivot);
     else
          update(root * 2 + 1, mid + 1, right, pivot);

     unite(root, (mid + 1) * block_size);
}

int m;
void init(int R, int C, int H[5000][200], int V[5000][200]) {
    /* ... */
    block_size = sqrt(R) + 1; /// maybe by 10 ???
    r = R;
    c = C;
    for (int i = 0; i < R - 1; i ++)
     for (int j = 0; j < C; j ++)
     v[i][j] = V[i][j];

    for (int i = 0; i < R; i ++)
     for (int j = 0; j < C - 1; j ++)
     h[i][j] = H[i][j];

     precalculate();
     m = (r - 1) / block_size;
     build(1, 0, m);
}


int fp[2][maxc];
void fix_row(int i)
{
     for (int j = 1; j < c; j ++)
     {
          fp[i & 1][j] = min(fp[i & 1][j], fp[i & 1][j - 1] + h[i][j - 1]);
     }
     for (int j = c - 2; j >= 0; j --)
     {
          fp[i & 1][j] = min(fp[i & 1][j], fp[i & 1][j + 1] + h[i][j]);
     }
}


void calc_block(int bl)
{

     int st = bl * block_size;
     int en = (bl + 1) * block_size - 1;

     en = min(en, r - 1);

     for (int d = 0; d < c; d ++)
     {
          for (int j = 0; j < c; j ++)
          {
               fp[0][j] = fp[1][j] = inf;
          }

          fp[st & 1][d] = 0;
          fix_row(st);

          for (int i = st + 1; i <= en; i ++)
          {
               for (int j = 0; j < c; j ++)
               {
                    fp[i & 1][j] = fp[(i - 1) & 1][j] + v[i - 1][j];
               }
               fix_row(i);
          }

          for (int j = 0; j < c; j ++)
          {
               dp[bl][d][j] = fp[en & 1][j];
          }
     }

}


void precalculate()
{
        for (int bl = 0; bl <= (r - 1) / block_size; bl ++)
     {

         /// cout << "calc block " << endl;
          calc_block(bl);
     }
     ///exit(0);
}

void changeH(int P, int Q, int W) {
    /* ... */
    h[P][Q] = W;
    calc_block(P / block_size);
    update(1, 0, m, P / block_size);
}

void changeV(int P, int Q, int W) {
    /* ... */
    v[P][Q] = W;
    calc_block(P / block_size);
    update(1, 0, m, P / block_size);
}


int arr[maxc], temp[maxc];
int escape(int V1, int V2)
{
     return tree[1].t[V1][V2];
     int v1 = V1, v2 = V2;
     for (int j = 0; j < c; j ++)
          arr[j] = dp[0][v1][j];

     for (int bl = 1; bl <= (r - 1) / block_size; bl ++)
     {
          int t = bl * block_size;
          for (int j = 0; j < c; j ++)
          {
               arr[j] = arr[j] + v[t - 1][j];
          }

          for (int j = 1; j < c; j ++)
          {
               arr[j] = min(arr[j], arr[j - 1] + h[t][j - 1]);
          }
          for (int j = c - 2; j >= 0; j --)
          {
               arr[j] = min(arr[j], arr[j + 1] + h[t][j]);
          }

          for (int j = 0; j < c; j ++)
               temp[j] = inf;

          for (int j = 0; j < c; j ++)
          {
               for (int d = 0; d < c; d ++)
                    temp[j] =min(temp[j], arr[d] + dp[bl][d][j]);
          }

          for (int j = 0; j < c; j ++)
               arr[j] = temp[j];
     }

     return arr[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 init(int, int, int (*)[200], int (*)[200])':
wombats.cpp:109:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  109 |     for (int i = 0; i < R; i ++)
      |     ^~~
wombats.cpp:113:6: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  113 |      precalculate();
      |      ^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 80476 KB Output is correct
2 Correct 11 ms 80620 KB Output is correct
3 Correct 75 ms 82016 KB Output is correct
4 Correct 11 ms 80476 KB Output is correct
5 Correct 13 ms 80476 KB Output is correct
6 Correct 8 ms 59876 KB Output is correct
7 Correct 8 ms 59740 KB Output is correct
8 Correct 9 ms 59740 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 59896 KB Output is correct
2 Correct 9 ms 59876 KB Output is correct
3 Correct 10 ms 59892 KB Output is correct
4 Correct 10 ms 63996 KB Output is correct
5 Correct 9 ms 63832 KB Output is correct
6 Correct 9 ms 63836 KB Output is correct
7 Correct 9 ms 63932 KB Output is correct
8 Correct 9 ms 63836 KB Output is correct
9 Correct 9 ms 64032 KB Output is correct
10 Correct 10 ms 63836 KB Output is correct
11 Correct 64 ms 64872 KB Output is correct
12 Correct 9 ms 63836 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 460 ms 66164 KB Output is correct
2 Correct 393 ms 66164 KB Output is correct
3 Correct 505 ms 66164 KB Output is correct
4 Correct 500 ms 66136 KB Output is correct
5 Correct 545 ms 66164 KB Output is correct
6 Correct 8 ms 59740 KB Output is correct
7 Correct 8 ms 59904 KB Output is correct
8 Correct 8 ms 59736 KB Output is correct
9 Correct 2054 ms 66160 KB Output is correct
10 Correct 8 ms 63832 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 85596 KB Output is correct
2 Correct 13 ms 85596 KB Output is correct
3 Correct 13 ms 85600 KB Output is correct
4 Correct 41 ms 86348 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 444 ms 66160 KB Output is correct
2 Correct 397 ms 66388 KB Output is correct
3 Correct 499 ms 66384 KB Output is correct
4 Correct 531 ms 66164 KB Output is correct
5 Correct 536 ms 66168 KB Output is correct
6 Correct 14 ms 85592 KB Output is correct
7 Correct 13 ms 85596 KB Output is correct
8 Correct 14 ms 85712 KB Output is correct
9 Correct 40 ms 86356 KB Output is correct
10 Correct 11 ms 80476 KB Output is correct
11 Correct 11 ms 80636 KB Output is correct
12 Correct 70 ms 82224 KB Output is correct
13 Correct 11 ms 80476 KB Output is correct
14 Correct 11 ms 80476 KB Output is correct
15 Correct 8 ms 59736 KB Output is correct
16 Correct 8 ms 59856 KB Output is correct
17 Correct 8 ms 59740 KB Output is correct
18 Correct 10 ms 63836 KB Output is correct
19 Correct 9 ms 63832 KB Output is correct
20 Correct 9 ms 63832 KB Output is correct
21 Correct 9 ms 63836 KB Output is correct
22 Correct 8 ms 63960 KB Output is correct
23 Correct 9 ms 63836 KB Output is correct
24 Correct 9 ms 63836 KB Output is correct
25 Correct 60 ms 64856 KB Output is correct
26 Correct 9 ms 63836 KB Output is correct
27 Correct 2118 ms 66164 KB Output is correct
28 Correct 5707 ms 88676 KB Output is correct
29 Correct 5777 ms 88936 KB Output is correct
30 Correct 6079 ms 89008 KB Output is correct
31 Correct 5651 ms 91468 KB Output is correct
32 Correct 8 ms 63836 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 66160 KB Output is correct
2 Correct 374 ms 66168 KB Output is correct
3 Correct 494 ms 66180 KB Output is correct
4 Correct 500 ms 66168 KB Output is correct
5 Correct 525 ms 66168 KB Output is correct
6 Correct 13 ms 85592 KB Output is correct
7 Correct 13 ms 85848 KB Output is correct
8 Correct 13 ms 85544 KB Output is correct
9 Correct 47 ms 86352 KB Output is correct
10 Correct 11 ms 80472 KB Output is correct
11 Correct 11 ms 80476 KB Output is correct
12 Correct 62 ms 82004 KB Output is correct
13 Correct 11 ms 80472 KB Output is correct
14 Correct 11 ms 80476 KB Output is correct
15 Correct 2357 ms 91320 KB Output is correct
16 Execution timed out 20094 ms 91628 KB Time limit exceeded
17 Halted 0 ms 0 KB -