oj.uz

Submission #1031353

# Submission time Handle Problem Language Result Execution time Memory
1031353 2024-07-22T18:27:21 Z tolbi Wombats (IOI13_wombats) C++17
55 / 100
 20000 ms 27472 KB 
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXR = 5003;
const int MAXC = 203;
const int INF = 1e9;
constexpr int BLOK = 1000;
int H[MAXR][MAXC]={},V[MAXR][MAXC]={};
int dp[(MAXR+BLOK-1)/BLOK*4][MAXC][MAXC];
int opt[MAXC][MAXC];
int cur[MAXC][MAXC];
int C,R,sz;
void merge(int x){
    if (x*2+1>=sz){
        if (x-sz/2<(R+BLOK-1)/BLOK){
            for (int i = 0; i < C; i++){
                for (int j = 0; j < C; j++){
                    dp[x][i][j]=INF;
                }
                dp[x][i][i]=0;
            }
            for (int _ = (x-sz/2)*BLOK; _ < min(R,(x-sz/2+1)*BLOK); _++){
                for (int i = 0; i < C; i++){
                    int somma = 0;
                    for (int j = i; j < C; j++){
                        cur[i][j]=somma+V[_][j];
                        somma+=H[_][j];
                    }
                    somma = 0;
                    for (int j = i-1; j >= 0; j--){
                        somma+=H[_][j];
                        cur[i][j]=somma+V[_][j];
                    }
                }
                int edp[MAXC][MAXC];
                for (int i = C-1; i >= 0; i--){
                    for (int j = 0; j < C; j++){
                        int lbound = 0;
                        int rbound = C-1;
                        if (j) lbound=opt[i][j-1];
                        if (i+1<C) rbound=opt[i+1][j];
                        edp[i][j]=dp[x][i][lbound]+cur[lbound][j];
                        opt[i][j]=lbound;
                        for (int k = lbound; k <= rbound; k++){
                            if (dp[x][i][k]+cur[k][j]<edp[i][j]){
                                edp[i][j]=dp[x][i][k]+cur[k][j];
                                opt[i][j]=k;
                            }
                        }
                    }
                }
                for (int i = 0; i < C; i++){
                    for (int j = 0; j < C; j++){
                        dp[x][i][j]=edp[i][j];
                    }
                }
            }
        }
        else {
            for (int i = 0; i < C; i++){
                for (int j = 0; j < C; j++){
                    if (i==j) dp[x][i][j]=0;
                    else dp[x][i][j]=INF;
                }
            }
        }
    }
    else {
        for (int i = C-1; i >= 0; i--){
            for (int j = 0; j < C; j++){
                int lbound = 0;
                int rbound = C-1;
                if (j) lbound=opt[i][j-1];
                if (i+1<C) rbound=opt[i+1][j];
                opt[i][j]=lbound;
                dp[x][i][j]=dp[x*2+1][i][lbound]+dp[x*2+2][lbound][j];
                for (int k = lbound; k <= rbound; k++){
                    if (dp[x*2+1][i][k]+dp[x*2+2][k][j]<dp[x][i][j]){
                        dp[x][i][j]=dp[x*2+1][i][k]+dp[x*2+2][k][j];
                        opt[i][j]=k;
                    }
                }
            }
        }
    }
}
void init(int RR, int CC, int HH[5000][200], int VV[5000][200]) {
    C=CC,R=RR;
    sz=(1LL<<((int)(ceil(log2((R+BLOK-1)/BLOK)+1))))-1;
    for (int i = 0; i < R; i++){
        for (int j = 0; j < C; j++){
            if (j+1<C) H[i][j]=HH[i][j];
            if (i+1<R) V[i][j]=VV[i][j];
        }
    }
    for (int i = sz-1; i >= 0; i--){
        merge(i);
    }
}

void changeH(int P, int Q, int W) {
    H[P][Q]=W;
    P/=BLOK;
    P+=sz/2;
    merge(P);
    while (P){
        P=(P-1)/2;
        merge(P);
    }
}

void changeV(int P, int Q, int W) {
    V[P][Q]=W;
    P/=BLOK;
    P+=sz/2;
    merge(P);
    while (P){
        P=(P-1)/2;
        merge(P);
    }
}
int escape(int V1, int V2) {
    return dp[0][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 8 ms 8536 KB Output is correct
2 Correct 12 ms 8540 KB Output is correct
3 Correct 43 ms 10064 KB Output is correct
4 Correct 8 ms 8540 KB Output is correct
5 Correct 8 ms 8540 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 856 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 36 ms 1568 KB Output is correct
12 Correct 1 ms 604 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 1112 KB Output is correct
2 Correct 404 ms 1172 KB Output is correct
3 Correct 553 ms 1168 KB Output is correct
4 Correct 519 ms 1112 KB Output is correct
5 Correct 548 ms 1176 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 2130 ms 1192 KB Output is correct
10 Correct 0 ms 604 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 16472 KB Output is correct
2 Correct 28 ms 16220 KB Output is correct
3 Correct 25 ms 16464 KB Output is correct
4 Correct 42 ms 17232 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 1116 KB Output is correct
2 Correct 388 ms 1116 KB Output is correct
3 Correct 521 ms 1116 KB Output is correct
4 Correct 539 ms 1112 KB Output is correct
5 Correct 523 ms 1112 KB Output is correct
6 Correct 21 ms 16220 KB Output is correct
7 Correct 18 ms 16220 KB Output is correct
8 Correct 23 ms 16216 KB Output is correct
9 Correct 53 ms 17184 KB Output is correct
10 Correct 8 ms 8536 KB Output is correct
11 Correct 9 ms 8540 KB Output is correct
12 Correct 42 ms 10100 KB Output is correct
13 Correct 8 ms 8540 KB Output is correct
14 Correct 8 ms 8540 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 38 ms 1608 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 2179 ms 1176 KB Output is correct
28 Execution timed out 20057 ms 18076 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 602 ms 1112 KB Output is correct
2 Correct 406 ms 1116 KB Output is correct
3 Correct 550 ms 1192 KB Output is correct
4 Correct 566 ms 1112 KB Output is correct
5 Correct 503 ms 1172 KB Output is correct
6 Correct 28 ms 16464 KB Output is correct
7 Correct 18 ms 16220 KB Output is correct
8 Correct 23 ms 16472 KB Output is correct
9 Correct 49 ms 17236 KB Output is correct
10 Correct 8 ms 8540 KB Output is correct
11 Correct 8 ms 8540 KB Output is correct
12 Correct 42 ms 10012 KB Output is correct
13 Correct 8 ms 8540 KB Output is correct
14 Correct 8 ms 8540 KB Output is correct
15 Correct 1667 ms 19016 KB Output is correct
16 Execution timed out 20048 ms 27472 KB Time limit exceeded
17 Halted 0 ms 0 KB -