oj.uz

Submission #1067849

# Submission time Handle Problem Language Result Execution time Memory
1067849 2024-08-21T04:34:36 Z thinknoexit Wombats (IOI13_wombats) C++17
39 / 100
 50 ms 48084 KB 
#include "wombats.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 5050;
const int M = 22;
int rc[N][M]; // cost from (i, j) -> (i+1, j)
int cc[N][M]; // cost from (i, j) -> (i, j+1)
int dp[111][111];
int n, m;
struct A {
    int dis[M][M], r;
    A() { memset(dis, 0x3f, sizeof dis), r = 0; }
    A operator + (const A& o) const {
        A res;
        for (int i = 0;i < m;i++) {
            for (int j = 0;j < m;j++) {
                for (int k = 0;k < m;k++) {
                    res.dis[i][j] = min(res.dis[i][j],
                        dis[i][k] + rc[r][k] + o.dis[k][j]);
                }
            }
        }
        res.r = o.r;
        return res;
    }
} tree[4 * N];
void build(int now = 1, int l = 0, int r = n - 1) {
    if (l == r) {
        vector<int> sum(m);
        sum[0] = 0;
        for (int i = 1;i < m;i++) {
            sum[i] = sum[i - 1] + cc[l][i - 1];
        }
        for (int i = 0;i < m;i++) {
            for (int j = i;j < m;j++) {
                tree[now].dis[i][j] = tree[now].dis[j][i] = sum[j] - sum[i];
            }
        }
        tree[now].r = r;
        return;
    }
    int mid = (l + r) / 2;
    build(2 * now, l, mid), build(2 * now + 1, mid + 1, r);
    tree[now] = tree[2 * now] + tree[2 * now + 1];
};
void update(int v, int now = 1, int l = 0, int r = n - 1) {
    if (l == r) {
        vector<int> sum(m);
        sum[0] = 0;
        for (int i = 1;i < m;i++) {
            sum[i] = sum[i - 1] + cc[l][i - 1];
        }
        for (int i = 0;i < m;i++) {
            for (int j = i;j < m;j++) {
                tree[now].dis[i][j] = tree[now].dis[j][i] = sum[j] - sum[i];
            }
        }
        tree[now].r = r;
        return;
    }
    int mid = (l + r) / 2;
    if (v <= mid) update(v, 2 * now, l, mid);
    else update(v, 2 * now + 1, mid + 1, r);
    tree[now] = tree[2 * now] + tree[2 * now + 1];
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
    n = R, m = C;
    for (int i = 0;i < n - 1;i++) {
        for (int j = 0;j < m;j++) {
            rc[i][j] = V[i][j];
        }
    }
    for (int i = 0;i < n;i++) {
        for (int j = 0;j < m - 1;j++) {
            cc[i][j] = H[i][j];
        }
    }
    if (m <= 20) build();
}

void changeH(int P, int Q, int W) {
    cc[P][Q] = W;
    if (m <= 20) update(P);
}

void changeV(int P, int Q, int W) {
    rc[P][Q] = W;
    if (m <= 20) update(P);
}

int escape(int V1, int V2) {
    if (m <= 20) return tree[1].dis[V1][V2];
    dp[0][V1] = 0;
    for (int i = V1 - 1;i >= 0;i--) {
        dp[0][i] = dp[0][i + 1] + cc[0][i];
    }
    for (int i = V1 + 1;i < m;i++) {
        dp[0][i] = dp[0][i - 1] + cc[0][i - 1];
    }
    for (int i = 1;i < n;i++) {
        for (int j = 0;j < m;j++) dp[i][j] = dp[i - 1][j] + rc[i - 1][j];
        for (int j = 1;j < m;j++) {
            dp[i][j] = min(dp[i][j], dp[i][j - 1] + cc[i][j - 1]);
        }
        for (int j = m - 2;j >= 0;j--) {
            dp[i][j] = min(dp[i][j], dp[i][j + 1] + cc[i][j]);
        }
        for (int j = 1;j < m;j++) {
            dp[i][j] = min(dp[i][j], dp[i][j - 1] + cc[i][j - 1]);
        }
        for (int j = m - 2;j >= 0;j--) {
            dp[i][j] = min(dp[i][j], dp[i][j + 1] + cc[i][j]);
        }
    }
    return dp[n - 1][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 10 ms 44632 KB Output is correct
2 Correct 14 ms 44636 KB Output is correct
3 Correct 50 ms 46064 KB Output is correct
4 Correct 10 ms 44636 KB Output is correct
5 Correct 11 ms 44524 KB Output is correct
6 Correct 7 ms 40284 KB Output is correct
7 Correct 8 ms 40148 KB Output is correct
8 Correct 8 ms 40284 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 40284 KB Output is correct
2 Correct 7 ms 40156 KB Output is correct
3 Correct 8 ms 40284 KB Output is correct
4 Correct 8 ms 40284 KB Output is correct
5 Correct 8 ms 40280 KB Output is correct
6 Correct 7 ms 40168 KB Output is correct
7 Correct 7 ms 40284 KB Output is correct
8 Correct 7 ms 40284 KB Output is correct
9 Correct 8 ms 40228 KB Output is correct
10 Correct 7 ms 40284 KB Output is correct
11 Correct 46 ms 41244 KB Output is correct
12 Correct 8 ms 40284 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 40284 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 47448 KB Output is correct
2 Correct 14 ms 47452 KB Output is correct
3 Correct 15 ms 47484 KB Output is correct
4 Correct 40 ms 48084 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 40436 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 40280 KB Output isn't correct
2 Halted 0 ms 0 KB -