oj.uz

Submission #1095246

# Submission time Handle Problem Language Result Execution time Memory
1095246 2024-10-01T15:57:11 Z dosts Wombats (IOI13_wombats) C++17
76 / 100
 20000 ms 55692 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 = 250;
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 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);
        int noyaninminikoptimizasyonununsaglayacagietki = 2*node;
        for (int i=0;i<c;i++) {
            for (int j=0;j<c;j++) {
                dp[node][i][j] = inf;
                for (int k=0;k<c;k++) {
                    dp[node][i][j] = min(dp[node][i][j],
                    dp[noyaninminikoptimizasyonununsaglayacagietki][i][k]+
                    dp[noyaninminikoptimizasyonununsaglayacagietki|1][k][j]+as[m-1][k]);
                }
            }
        }
    }

    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);
        int noyaninminikoptimizasyonununsaglayacagietki = 2*node;
        for (int i=0;i<c;i++) {
            for (int j=0;j<c;j++) {
                dp[node][i][j] = inf;
                for (int k=0;k<c;k++) {
                    dp[node][i][j] = min(dp[node][i][j],
                    dp[noyaninminikoptimizasyonununsaglayacagietki][i][k]+
                    dp[noyaninminikoptimizasyonununsaglayacagietki|1][k][j]+as[m-1][k]);
                }
            }
        }
    }
} 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 24668 KB Output is correct
2 Correct 9 ms 24740 KB Output is correct
3 Correct 46 ms 27476 KB Output is correct
4 Correct 10 ms 24664 KB Output is correct
5 Correct 10 ms 24504 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 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 1 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 38 ms 2896 KB Output is correct
12 Correct 1 ms 600 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 646 ms 1112 KB Output is correct
2 Correct 636 ms 1280 KB Output is correct
3 Correct 655 ms 1368 KB Output is correct
4 Correct 656 ms 1368 KB Output is correct
5 Correct 638 ms 1368 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
9 Correct 3228 ms 1352 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 15 ms 32508 KB Output is correct
2 Correct 14 ms 32604 KB Output is correct
3 Correct 16 ms 32484 KB Output is correct
4 Correct 36 ms 33872 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 650 ms 1324 KB Output is correct
2 Correct 633 ms 1116 KB Output is correct
3 Correct 652 ms 1372 KB Output is correct
4 Correct 653 ms 1368 KB Output is correct
5 Correct 639 ms 1372 KB Output is correct
6 Correct 14 ms 32600 KB Output is correct
7 Correct 16 ms 32604 KB Output is correct
8 Correct 16 ms 32644 KB Output is correct
9 Correct 40 ms 33928 KB Output is correct
10 Correct 10 ms 24668 KB Output is correct
11 Correct 10 ms 24668 KB Output is correct
12 Correct 46 ms 27492 KB Output is correct
13 Correct 10 ms 24664 KB Output is correct
14 Correct 10 ms 24668 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 1 ms 600 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 616 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 452 KB Output is correct
25 Correct 38 ms 2956 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 3237 ms 1292 KB Output is correct
28 Correct 7351 ms 43364 KB Output is correct
29 Correct 6384 ms 37064 KB Output is correct
30 Correct 6514 ms 36888 KB Output is correct
31 Correct 7550 ms 45000 KB Output is correct
32 Correct 0 ms 344 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 647 ms 1116 KB Output is correct
2 Correct 633 ms 1116 KB Output is correct
3 Correct 653 ms 1368 KB Output is correct
4 Correct 659 ms 1368 KB Output is correct
5 Correct 641 ms 1292 KB Output is correct
6 Correct 13 ms 32604 KB Output is correct
7 Correct 15 ms 32604 KB Output is correct
8 Correct 15 ms 32628 KB Output is correct
9 Correct 33 ms 33872 KB Output is correct
10 Correct 11 ms 24668 KB Output is correct
11 Correct 10 ms 24652 KB Output is correct
12 Correct 48 ms 27364 KB Output is correct
13 Correct 11 ms 24668 KB Output is correct
14 Correct 9 ms 24536 KB Output is correct
15 Correct 2001 ms 55692 KB Output is correct
16 Execution timed out 20050 ms 55340 KB Time limit exceeded
17 Halted 0 ms 0 KB -