oj.uz

Submission #516419

# Submission time Handle Problem Language Result Execution time Memory
516419 2022-01-21T09:48:15 Z 600Mihnea Wombats (IOI13_wombats) C++17
76 / 100
 20000 ms 186656 KB 
#include "wombats.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 5000 + 7;
const int M = 200 + 7;
const int INF = (int) 1e9 + 7;
const int BUCKETSIZE = 15;
int H[N][M];
int V[N][M];

int n;
int m;

struct Node {
  int l;
  int r;
  vector<vector<int>> cost;
  Node() :
    l(0),
    r(0),
    cost(m, vector<int> (m, INF)) {
  }
};

vector<Node> tree;

void placeSmall(Node &guy, int l, int r) {
  assert(l <= r);
  guy.l = l;
  guy.r = r;
  for (int start = 0; start < m; start++) {
    for (int col = 0; col < m; col++) {
      guy.cost[start][col] = INF;
    }
    guy.cost[start][start] = 0;
    for (int col = 1; col < m; col++) {
      guy.cost[start][col] = min(guy.cost[start][col], guy.cost[start][col - 1] + H[l][col - 1]);
    }
    for (int col = m - 2; col >= 0; col--){
      guy.cost[start][col] = min(guy.cost[start][col], guy.cost[start][col + 1] + H[l][col]);
    }
  }
  for (int row = l + 1; row <= r; row++) {
    /// add row j
    for (int start = 0; start < m; start++) {
      for (int col = 0; col < m; col++) {
        guy.cost[start][col] += V[row - 1][col];
      }
      for (int col = 1; col < m; col++) {
        guy.cost[start][col] = min(guy.cost[start][col], guy.cost[start][col - 1] + H[row][col - 1]);
      }
      for (int col = m - 2; col >= 0; col--){
        guy.cost[start][col] = min(guy.cost[start][col], guy.cost[start][col + 1] + H[row][col]);
      }
    }
  }
}

int A[M][M];
int B[M][M];


void join(Node& solution, Node& lft, Node& rgh) {
  assert(lft.r + 1 == rgh.l);
  solution.l = lft.l;
  solution.r = rgh.r;
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      A[i][j] = lft.cost[i][j] + V[lft.r][j];
      B[i][j] = rgh.cost[i][j];
      solution.cost[i][j] = INF;
    }
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      for (int k = 0; k < m; k++) {
        solution.cost[i][k] = min(solution.cost[i][k], A[i][j] + B[j][k]);
      }
    }
  }
}



void update(int v, int tl, int tr, int pos) {
  if (tr < pos || pos < tl) assert(0);
  int LEN = tr - tl + 1;
  if (LEN <= BUCKETSIZE) {
    placeSmall(tree[v], tl, tr);
    return;
  }
  int tm = (tl + tr) / 2;
  if (pos <= tm) {
    update(2 * v, tl, tm, pos);
  } else {
    update(2 * v + 1, tm + 1, tr, pos);
  }
  join(tree[v], tree[2 * v], tree[2 * v + 1]);

}

void build(int v, int tl, int tr) {
  while (v >= (int) tree.size()) tree.push_back({});
  assert(v < (int) tree.size());
  if (tr - tl + 1 <= BUCKETSIZE) {

    placeSmall(tree[v], tl, tr);

    return;
  }
  int tm = (tl + tr) / 2;
  build(2 * v, tl, tm);
  build(2 * v + 1, tm + 1, tr);
  join(tree[v], tree[2 * v], tree[2 * v + 1]);
}


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

void changeH(int P, int Q, int W) {
  H[P][Q] = W;
  update(1, 0, n - 1, P);
}

void changeV(int P, int Q, int W) {
  V[P][Q] = W;
  update(1, 0, n - 1, P);
}

int escape(int V1, int V2) {
  return tree[1].cost[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;
      |      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12364 KB Output is correct
2 Correct 10 ms 12328 KB Output is correct
3 Correct 93 ms 13948 KB Output is correct
4 Correct 6 ms 12364 KB Output is correct
5 Correct 6 ms 12364 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 67 ms 1412 KB Output is correct
12 Correct 1 ms 332 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 421 ms 1472 KB Output is correct
2 Correct 419 ms 1484 KB Output is correct
3 Correct 424 ms 1496 KB Output is correct
4 Correct 417 ms 1484 KB Output is correct
5 Correct 428 ms 1468 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 2062 ms 1484 KB Output is correct
10 Correct 0 ms 332 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16400 KB Output is correct
2 Correct 10 ms 16368 KB Output is correct
3 Correct 8 ms 16332 KB Output is correct
4 Correct 45 ms 17124 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 472 ms 1444 KB Output is correct
2 Correct 403 ms 1484 KB Output is correct
3 Correct 428 ms 1476 KB Output is correct
4 Correct 424 ms 1484 KB Output is correct
5 Correct 408 ms 1484 KB Output is correct
6 Correct 11 ms 16400 KB Output is correct
7 Correct 9 ms 16332 KB Output is correct
8 Correct 9 ms 16332 KB Output is correct
9 Correct 41 ms 17092 KB Output is correct
10 Correct 6 ms 12364 KB Output is correct
11 Correct 7 ms 12332 KB Output is correct
12 Correct 90 ms 13948 KB Output is correct
13 Correct 7 ms 12364 KB Output is correct
14 Correct 7 ms 12308 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 65 ms 1404 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 2025 ms 1484 KB Output is correct
28 Correct 5980 ms 61448 KB Output is correct
29 Correct 5801 ms 61416 KB Output is correct
30 Correct 5831 ms 61672 KB Output is correct
31 Correct 6030 ms 66328 KB Output is correct
32 Correct 0 ms 336 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 425 ms 1488 KB Output is correct
2 Correct 409 ms 1472 KB Output is correct
3 Correct 408 ms 1476 KB Output is correct
4 Correct 424 ms 1484 KB Output is correct
5 Correct 423 ms 1472 KB Output is correct
6 Correct 8 ms 16332 KB Output is correct
7 Correct 8 ms 16332 KB Output is correct
8 Correct 8 ms 16396 KB Output is correct
9 Correct 43 ms 17096 KB Output is correct
10 Correct 6 ms 12364 KB Output is correct
11 Correct 7 ms 12364 KB Output is correct
12 Correct 95 ms 13952 KB Output is correct
13 Correct 6 ms 12364 KB Output is correct
14 Correct 6 ms 12364 KB Output is correct
15 Correct 5849 ms 184972 KB Output is correct
16 Execution timed out 20084 ms 186656 KB Time limit exceeded
17 Halted 0 ms 0 KB -