oj.uz

답안 #962177

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
962177 2024-04-13T08:36:29 Z danikoynov 웜뱃 (IOI13_wombats) C++14
76 / 100
 20000 ms 91304 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];
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;

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

}

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 80476 KB Output is correct
2 Correct 11 ms 80604 KB Output is correct
3 Correct 67 ms 82212 KB Output is correct
4 Correct 12 ms 80632 KB Output is correct
5 Correct 10 ms 80608 KB Output is correct
6 Correct 8 ms 59740 KB Output is correct
7 Correct 8 ms 59740 KB Output is correct
8 Correct 8 ms 59740 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 59740 KB Output is correct
2 Correct 9 ms 59740 KB Output is correct
3 Correct 8 ms 59740 KB Output is correct
4 Correct 8 ms 63940 KB Output is correct
5 Correct 8 ms 63836 KB Output is correct
6 Correct 8 ms 63836 KB Output is correct
7 Correct 8 ms 64008 KB Output is correct
8 Correct 9 ms 63956 KB Output is correct
9 Correct 9 ms 63832 KB Output is correct
10 Correct 8 ms 63836 KB Output is correct
11 Correct 60 ms 64844 KB Output is correct
12 Correct 9 ms 63836 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 436 ms 66176 KB Output is correct
2 Correct 512 ms 66160 KB Output is correct
3 Correct 496 ms 66164 KB Output is correct
4 Correct 492 ms 66160 KB Output is correct
5 Correct 535 ms 66196 KB Output is correct
6 Correct 9 ms 59740 KB Output is correct
7 Correct 8 ms 59740 KB Output is correct
8 Correct 8 ms 59740 KB Output is correct
9 Correct 2592 ms 66396 KB Output is correct
10 Correct 9 ms 63832 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 85548 KB Output is correct
2 Correct 14 ms 85684 KB Output is correct
3 Correct 13 ms 85596 KB Output is correct
4 Correct 45 ms 86648 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 453 ms 66244 KB Output is correct
2 Correct 514 ms 66228 KB Output is correct
3 Correct 518 ms 66268 KB Output is correct
4 Correct 500 ms 66140 KB Output is correct
5 Correct 542 ms 66260 KB Output is correct
6 Correct 14 ms 85560 KB Output is correct
7 Correct 14 ms 85596 KB Output is correct
8 Correct 16 ms 85596 KB Output is correct
9 Correct 41 ms 86656 KB Output is correct
10 Correct 11 ms 80452 KB Output is correct
11 Correct 11 ms 80616 KB Output is correct
12 Correct 65 ms 82748 KB Output is correct
13 Correct 11 ms 80476 KB Output is correct
14 Correct 13 ms 80648 KB Output is correct
15 Correct 8 ms 59740 KB Output is correct
16 Correct 8 ms 59884 KB Output is correct
17 Correct 8 ms 59744 KB Output is correct
18 Correct 9 ms 63836 KB Output is correct
19 Correct 9 ms 64048 KB Output is correct
20 Correct 8 ms 63836 KB Output is correct
21 Correct 9 ms 64052 KB Output is correct
22 Correct 10 ms 63836 KB Output is correct
23 Correct 9 ms 63836 KB Output is correct
24 Correct 8 ms 64028 KB Output is correct
25 Correct 61 ms 65872 KB Output is correct
26 Correct 8 ms 63836 KB Output is correct
27 Correct 2550 ms 66240 KB Output is correct
28 Correct 6560 ms 88272 KB Output is correct
29 Correct 6202 ms 86624 KB Output is correct
30 Correct 6256 ms 86564 KB Output is correct
31 Correct 6665 ms 91304 KB Output is correct
32 Correct 8 ms 63836 KB Output is correct

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 431 ms 66248 KB Output is correct
2 Correct 522 ms 66140 KB Output is correct
3 Correct 495 ms 66248 KB Output is correct
4 Correct 496 ms 66140 KB Output is correct
5 Correct 521 ms 66140 KB Output is correct
6 Correct 13 ms 85556 KB Output is correct
7 Correct 14 ms 85592 KB Output is correct
8 Correct 13 ms 85592 KB Output is correct
9 Correct 43 ms 86760 KB Output is correct
10 Correct 11 ms 80476 KB Output is correct
11 Correct 11 ms 80640 KB Output is correct
12 Correct 61 ms 82772 KB Output is correct
13 Correct 11 ms 80476 KB Output is correct
14 Correct 12 ms 80652 KB Output is correct
15 Correct 2503 ms 91136 KB Output is correct
16 Execution timed out 20061 ms 91284 KB Time limit exceeded
17 Halted 0 ms 0 KB -