oj.uz

Submission #1095256

# Submission time Handle Problem Language Result Execution time Memory
1095256 2024-10-01T16:43:58 Z dosts Wombats (IOI13_wombats) C++17
100 / 100
 6043 ms 117704 KB 
//Dost SEFEROĞLU
#include <bits/stdc++.h>
#include "wombats.h"
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
//#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<    
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int MOD = 1e9+7,inf = 2e9;
const int Q = 2e5+50,B = 20;
int N,c;
using Matrix = int[200][200];
int sag[5000][200],as[5000][2000];

Matrix d;

void man(int l,int r) {
    for (int i=0;i<c;i++) for (int j=0;j<c;j++) d[i][j] = inf;
    for (int i=0;i<c;i++) {
        d[i][i] = 0;
        for (int j=i+1;j<c;j++) d[i][j] = d[j][i] = d[i][j-1]+sag[l-1][j-1];
    }
    for (int p=l+1;p<=r;p++) {
        for (int s = 0;s<c;s++) {
            for (int j=0;j<c;j++) {
                d[s][j] = d[s][j]+as[p-2][j];
                if (j) d[s][j] = min(d[s][j],d[s][j-1]+sag[p-1][j-1]);
            }
            for (int j=c-2;j>=0;j--){
                d[s][j] = min(d[s][j],d[s][j+1]+sag[p-1][j]);
            }
        }
    } 
}

struct ST {
    Matrix dp[5000];

    void dnc(const int node,const int i,const int M,int l,int r,int optl,int optr) {
        if (l > r) return;
        int m = (l+r) >> 1;
        dp[node][i][m] = inf;
        int opt = optl;
        for (int k=optl;k<=optr;k++) {
            if (dp[2*node][i][k]+dp[2*node+1][k][m]+as[M-1][k] < dp[node][i][m]) {
                dp[node][i][m] = dp[2*node][i][k]+dp[2*node+1][k][m]+as[M-1][k];
                opt = k;
            }
        }
        dnc(node,i,M,l,m-1,optl,opt);
        dnc(node,i,M,m+1,r,opt,optr);
    }

    void build(int node,int l,int r) {
        if (l+B-1 >= r) {
            //BC^2
            man(l,r);
            for (int i=0;i<c;i++) {
                for (int j=0;j<c;j++) dp[node][i][j] = d[i][j];
            }
            return;
        }
        int m = (l+r) >> 1;
        build(2*node,l,m);
        build(2*node+1,m+1,r);
        for (int i=0;i<c;i++) dnc(node,i,m,0,c-1,0,c-1);
    }

    void update(int node,int l,int r,int p) {
        if (l+B-1 >= r) {
            //BC^2
            man(l,r);
            for (int i=0;i<c;i++) {
                for (int j=0;j<c;j++) dp[node][i][j] = d[i][j];
            }
            return;
        }
        int m = (l+r) >> 1;
        if  (p<=m) update(2*node,l,m,p);
        else update(2*node+1,m+1,r,p);
        for (int i=0;i<c;i++) dnc(node,i,m,0,c-1,0,c-1);
    }
} st;

void init(int32_t R, int32_t C, int32_t H[5000][200], int32_t V[5000][200]) {
    N = R,c = C;
    for (int i=0;i<N;i++) {
        for (int j=0;j<c-1;j++) sag[i][j] = H[i][j];
        if (i<N-1) for (int j=0;j<c;j++) as[i][j] = V[i][j];
    };
    st.build(1,1,N);
}

void changeH(int32_t P, int32_t Q, int32_t W) {
    sag[P][Q] = W;
    st.update(1,1,N,P+1);
}

void changeV(int32_t P, int32_t Q, int32_t W) {
    as[P][Q] = W;
    st.update(1,1,N,P+1);
}

int32_t escape(int32_t V1, int32_t V2) {
    return st.dp[1][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 9 ms 26456 KB Output is correct
2 Correct 9 ms 26456 KB Output is correct
3 Correct 44 ms 27996 KB Output is correct
4 Correct 9 ms 26460 KB Output is correct
5 Correct 9 ms 26528 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 600 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 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 45 ms 1412 KB Output is correct
12 Correct 0 ms 604 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 2396 KB Output is correct
2 Correct 115 ms 2396 KB Output is correct
3 Correct 126 ms 2220 KB Output is correct
4 Correct 135 ms 2432 KB Output is correct
5 Correct 118 ms 2380 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 538 ms 2432 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 34652 KB Output is correct
2 Correct 15 ms 34652 KB Output is correct
3 Correct 15 ms 34652 KB Output is correct
4 Correct 32 ms 35604 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 2396 KB Output is correct
2 Correct 120 ms 2392 KB Output is correct
3 Correct 119 ms 2392 KB Output is correct
4 Correct 117 ms 2396 KB Output is correct
5 Correct 123 ms 2412 KB Output is correct
6 Correct 14 ms 34652 KB Output is correct
7 Correct 13 ms 34652 KB Output is correct
8 Correct 13 ms 34652 KB Output is correct
9 Correct 32 ms 35412 KB Output is correct
10 Correct 10 ms 26460 KB Output is correct
11 Correct 9 ms 26436 KB Output is correct
12 Correct 45 ms 27988 KB Output is correct
13 Correct 12 ms 26456 KB Output is correct
14 Correct 10 ms 26460 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 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 400 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 37 ms 1492 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 538 ms 2384 KB Output is correct
28 Correct 1435 ms 76368 KB Output is correct
29 Correct 1275 ms 70340 KB Output is correct
30 Correct 1303 ms 70228 KB Output is correct
31 Correct 1455 ms 77448 KB Output is correct
32 Correct 0 ms 344 KB Output is correct

Subtask #6
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 2420 KB Output is correct
2 Correct 114 ms 2392 KB Output is correct
3 Correct 117 ms 2392 KB Output is correct
4 Correct 117 ms 2432 KB Output is correct
5 Correct 114 ms 2396 KB Output is correct
6 Correct 15 ms 34652 KB Output is correct
7 Correct 17 ms 34848 KB Output is correct
8 Correct 14 ms 34648 KB Output is correct
9 Correct 32 ms 35420 KB Output is correct
10 Correct 10 ms 26608 KB Output is correct
11 Correct 10 ms 26460 KB Output is correct
12 Correct 45 ms 28136 KB Output is correct
13 Correct 11 ms 26460 KB Output is correct
14 Correct 9 ms 26528 KB Output is correct
15 Correct 1616 ms 116012 KB Output is correct
16 Correct 6043 ms 117704 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 37 ms 1628 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 536 ms 2452 KB Output is correct
30 Correct 1438 ms 76452 KB Output is correct
31 Correct 5927 ms 116788 KB Output is correct
32 Correct 5837 ms 116780 KB Output is correct
33 Correct 1306 ms 70572 KB Output is correct
34 Correct 5221 ms 110336 KB Output is correct
35 Correct 1297 ms 70248 KB Output is correct
36 Correct 5295 ms 110376 KB Output is correct
37 Correct 1467 ms 77396 KB Output is correct
38 Correct 5982 ms 117332 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 5648 ms 110352 KB Output is correct