oj.uz

Submission #1021283

# Submission time Handle Problem Language Result Execution time Memory
1021283 2024-07-12T16:39:25 Z amirhoseinfar1385 Wombats (IOI13_wombats) C++17
100 / 100
 2726 ms 160752 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "wombats.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=5000+10,maxm=200+10,t=20,mt=(maxn/t)+5,lg=log2(mt)+1;
int n,m,inf=1e9+5;
struct bakhsh{
    int allr[t+5][maxm],allc[t+5][maxm],dp[maxm][maxm],ps[maxm],suf[maxm],mxr=0;
    void calps(int i){
        for(int j=1;j<=m;j++){
            ps[j]=ps[j-1]+allr[i][j-1];
        }
    }
    void calc(){
        for(int k=1;k<=m;k++){
            calps(0);
            for(int j=1;j<=m;j++){
                dp[k][j]=abs(ps[k]-ps[j]);
            }
            for(int i=1;i<=mxr;i++){
                int mn=inf;
                for(int j=1;j<=m;j++){
                    mn=min(mn+allr[i][j-1],dp[k][j]+allc[i-1][j]);
                    ps[j]=mn;
                }
                mn=inf;
                for(int j=m;j>=1;j--){
                    mn=min(mn+allr[i][j],dp[k][j]+allc[i-1][j]);
                    dp[k][j]=min(ps[j],mn);
                }
            }
            for(int j=1;j<=m;j++){
                dp[k][j]+=allc[mxr][j];
            }
        }
    }
    void updr(int i,int j,int w){
        j++;
        mxr=max(mxr,i);
        allr[i][j]=w;
    }
    void updc(int i,int j,int w){
        j++;
        mxr=max(mxr,i);
        allc[i][j]=w;
    }
}allsq[mt];
int kaf=(1<<lg);

struct segment{
    int seg[(1<<(lg+1))][maxm][maxm];
    int now[maxm][maxm];
    segment(){
        for(int i=0;i<(1<<lg+1);i++){
            for(int r=0;r<maxm;r++){
                for(int c=0;c<maxm;c++){
                    seg[i][r][c]=inf;
                }
            }
        }
    }
    pair<int,int>stf[maxm][maxm];
    void por(int ind,int ez[maxm][maxm]){
        for(int i=1;i<=m;i++){
            for(int j=1;j<=m;j++){
                seg[ind][i][j]=ez[i][j];
            }
        }
    }
    void dfs(int cl,int cr,int r=m,int c=1){
        if(r==0||c==m+1){
            return ;
        }
    //    cout<<cl<<" "<<cr<<" "<<r<<" "<<c<<endl;
        if(r==m){
            stf[r][c].second=m;
        }
        if(c==1){
            stf[r][c].first=1;
        }
        now[r][c]=inf;
        int opt=stf[r][c].first;
        for(int i=stf[r][c].first;i<=stf[r][c].second;i++){
            if(seg[cl][r][i]+seg[cr][i][c]<now[r][c]){
                opt=i;
                now[r][c]=seg[cl][r][i]+seg[cr][i][c];
            }
        }
        stf[r-1][c].second=opt;
        stf[r][c+1].first=opt;
        dfs(cl,cr,r-1,c);
        if(r==m){
            dfs(cl,cr,r,c+1);
        }
    }

    void calc(int i){
        if(seg[(i<<1)][1][1]==inf){
            por(i,seg[(i<<1)^1]);
            return ;
        }
        if(seg[(i<<1)^1][1][1]==inf){
            por(i,seg[(i<<1)]);
            return ;
        }
        dfs((i<<1),(i<<1)^1);
        por(i,now);
    }

    void upd(int i,int dp[maxm][maxm]){
        i+=kaf;
        por(i,dp);
        i>>=1;
        while(i>0){
            calc(i);
            i>>=1;
        }
    }
}seg;


void init( int R, int C, int H[5000][200], int V[5000][200]) {
    n=R;
    m=C;
    for(int i=0;i<n;i++){
        for(int j=0;j<m-1;j++){
            allsq[i/t].updr(i%t,j,H[i][j]);
        }
    }
    for(int i=0;i<n-1;i++){
        for(int j=0;j<m;j++){
            allsq[i/t].updc(i%t,j,V[i][j]);
        }
    }
    for(int i=0;i<=(n-1)/t;i++){
        allsq[i].calc();
        seg.upd(i,allsq[i].dp);
    }
}
 
void changeH( int P, int Q, int W) {
    allsq[P/t].updr(P%t,Q,W);
    allsq[P/t].calc();
    seg.upd(P/t,allsq[P/t].dp);
}
 
void changeV( int P, int Q, int W) {
    allsq[P/t].updc(P%t,Q,W);
    allsq[P/t].calc();
    seg.upd(P/t,allsq[P/t].dp);
}
 
int escape( int V1, int V2) {
    V1++;
    V2++;
    return seg.seg[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;
      |      ^~~
wombats.cpp: In constructor 'segment::segment()':
wombats.cpp:55:29: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   55 |         for(int i=0;i<(1<<lg+1);i++){
      |                           ~~^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 100432 KB Output is correct
2 Correct 52 ms 100316 KB Output is correct
3 Correct 77 ms 103248 KB Output is correct
4 Correct 43 ms 100432 KB Output is correct
5 Correct 46 ms 100268 KB Output is correct
6 Correct 42 ms 90260 KB Output is correct
7 Correct 41 ms 90196 KB Output is correct
8 Correct 35 ms 90268 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 90204 KB Output is correct
2 Correct 35 ms 90192 KB Output is correct
3 Correct 40 ms 90496 KB Output is correct
4 Correct 56 ms 90192 KB Output is correct
5 Correct 36 ms 90256 KB Output is correct
6 Correct 51 ms 90196 KB Output is correct
7 Correct 36 ms 90152 KB Output is correct
8 Correct 35 ms 90196 KB Output is correct
9 Correct 36 ms 90192 KB Output is correct
10 Correct 39 ms 90192 KB Output is correct
11 Correct 84 ms 92496 KB Output is correct
12 Correct 51 ms 90196 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 91220 KB Output is correct
2 Correct 93 ms 90960 KB Output is correct
3 Correct 89 ms 91220 KB Output is correct
4 Correct 98 ms 90988 KB Output is correct
5 Correct 94 ms 90960 KB Output is correct
6 Correct 37 ms 90192 KB Output is correct
7 Correct 36 ms 90192 KB Output is correct
8 Correct 51 ms 90088 KB Output is correct
9 Correct 297 ms 90960 KB Output is correct
10 Correct 38 ms 90196 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 108372 KB Output is correct
2 Correct 43 ms 108372 KB Output is correct
3 Correct 43 ms 108376 KB Output is correct
4 Correct 81 ms 109772 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 91216 KB Output is correct
2 Correct 109 ms 91000 KB Output is correct
3 Correct 86 ms 91168 KB Output is correct
4 Correct 110 ms 91196 KB Output is correct
5 Correct 86 ms 90964 KB Output is correct
6 Correct 43 ms 108368 KB Output is correct
7 Correct 60 ms 108372 KB Output is correct
8 Correct 42 ms 108368 KB Output is correct
9 Correct 62 ms 109840 KB Output is correct
10 Correct 56 ms 100436 KB Output is correct
11 Correct 40 ms 100432 KB Output is correct
12 Correct 81 ms 103252 KB Output is correct
13 Correct 51 ms 100456 KB Output is correct
14 Correct 40 ms 100376 KB Output is correct
15 Correct 52 ms 90448 KB Output is correct
16 Correct 44 ms 90108 KB Output is correct
17 Correct 41 ms 90196 KB Output is correct
18 Correct 35 ms 90204 KB Output is correct
19 Correct 35 ms 90300 KB Output is correct
20 Correct 39 ms 90196 KB Output is correct
21 Correct 38 ms 90324 KB Output is correct
22 Correct 38 ms 90196 KB Output is correct
23 Correct 36 ms 90204 KB Output is correct
24 Correct 36 ms 90192 KB Output is correct
25 Correct 73 ms 92664 KB Output is correct
26 Correct 39 ms 90196 KB Output is correct
27 Correct 275 ms 91028 KB Output is correct
28 Correct 652 ms 132992 KB Output is correct
29 Correct 707 ms 125944 KB Output is correct
30 Correct 780 ms 126032 KB Output is correct
31 Correct 740 ms 134644 KB Output is correct
32 Correct 52 ms 90284 KB Output is correct

Subtask #6
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 90972 KB Output is correct
2 Correct 104 ms 90964 KB Output is correct
3 Correct 102 ms 91212 KB Output is correct
4 Correct 128 ms 91176 KB Output is correct
5 Correct 90 ms 91044 KB Output is correct
6 Correct 44 ms 108372 KB Output is correct
7 Correct 59 ms 108372 KB Output is correct
8 Correct 72 ms 108368 KB Output is correct
9 Correct 87 ms 110056 KB Output is correct
10 Correct 42 ms 100436 KB Output is correct
11 Correct 41 ms 100336 KB Output is correct
12 Correct 76 ms 103252 KB Output is correct
13 Correct 43 ms 100352 KB Output is correct
14 Correct 41 ms 100484 KB Output is correct
15 Correct 752 ms 159520 KB Output is correct
16 Correct 2654 ms 160752 KB Output is correct
17 Correct 40 ms 90192 KB Output is correct
18 Correct 57 ms 90200 KB Output is correct
19 Correct 46 ms 90232 KB Output is correct
20 Correct 55 ms 90148 KB Output is correct
21 Correct 37 ms 90192 KB Output is correct
22 Correct 37 ms 90192 KB Output is correct
23 Correct 37 ms 90192 KB Output is correct
24 Correct 42 ms 90192 KB Output is correct
25 Correct 37 ms 90196 KB Output is correct
26 Correct 37 ms 90196 KB Output is correct
27 Correct 75 ms 92496 KB Output is correct
28 Correct 54 ms 90196 KB Output is correct
29 Correct 271 ms 90964 KB Output is correct
30 Correct 650 ms 132952 KB Output is correct
31 Correct 2374 ms 158100 KB Output is correct
32 Correct 2470 ms 158136 KB Output is correct
33 Correct 674 ms 125776 KB Output is correct
34 Correct 2491 ms 146844 KB Output is correct
35 Correct 648 ms 125864 KB Output is correct
36 Correct 2605 ms 146844 KB Output is correct
37 Correct 687 ms 134740 KB Output is correct
38 Correct 2514 ms 158804 KB Output is correct
39 Correct 55 ms 90192 KB Output is correct
40 Correct 2726 ms 146948 KB Output is correct