oj.uz

답안 #1021293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021293 2024-07-12T16:43:03 Z amirhoseinfar1385 웜뱃 (IOI13_wombats) C++17
100 / 100
 2687 ms 144668 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=25,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 ;
        }
        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;
      |      ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 134484 KB Output is correct
2 Correct 44 ms 134480 KB Output is correct
3 Correct 80 ms 136004 KB Output is correct
4 Correct 44 ms 134360 KB Output is correct
5 Correct 44 ms 134484 KB Output is correct
6 Correct 40 ms 130136 KB Output is correct
7 Correct 41 ms 129992 KB Output is correct
8 Correct 41 ms 130384 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 130136 KB Output is correct
2 Correct 41 ms 130132 KB Output is correct
3 Correct 41 ms 130132 KB Output is correct
4 Correct 41 ms 130128 KB Output is correct
5 Correct 41 ms 129976 KB Output is correct
6 Correct 41 ms 130132 KB Output is correct
7 Correct 47 ms 130128 KB Output is correct
8 Correct 51 ms 130132 KB Output is correct
9 Correct 41 ms 130128 KB Output is correct
10 Correct 43 ms 130132 KB Output is correct
11 Correct 77 ms 131104 KB Output is correct
12 Correct 41 ms 130132 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 130404 KB Output is correct
2 Correct 96 ms 130388 KB Output is correct
3 Correct 96 ms 130388 KB Output is correct
4 Correct 93 ms 130196 KB Output is correct
5 Correct 94 ms 130396 KB Output is correct
6 Correct 42 ms 130028 KB Output is correct
7 Correct 42 ms 130128 KB Output is correct
8 Correct 41 ms 130136 KB Output is correct
9 Correct 285 ms 130220 KB Output is correct
10 Correct 53 ms 130128 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 138580 KB Output is correct
2 Correct 45 ms 138776 KB Output is correct
3 Correct 46 ms 138840 KB Output is correct
4 Correct 73 ms 139600 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 130384 KB Output is correct
2 Correct 90 ms 130388 KB Output is correct
3 Correct 105 ms 130400 KB Output is correct
4 Correct 93 ms 130384 KB Output is correct
5 Correct 94 ms 130396 KB Output is correct
6 Correct 46 ms 138728 KB Output is correct
7 Correct 59 ms 138832 KB Output is correct
8 Correct 51 ms 138580 KB Output is correct
9 Correct 63 ms 139604 KB Output is correct
10 Correct 56 ms 134480 KB Output is correct
11 Correct 56 ms 134480 KB Output is correct
12 Correct 84 ms 136020 KB Output is correct
13 Correct 48 ms 134488 KB Output is correct
14 Correct 49 ms 134484 KB Output is correct
15 Correct 45 ms 129936 KB Output is correct
16 Correct 49 ms 130128 KB Output is correct
17 Correct 46 ms 130132 KB Output is correct
18 Correct 52 ms 130128 KB Output is correct
19 Correct 52 ms 130000 KB Output is correct
20 Correct 45 ms 130128 KB Output is correct
21 Correct 47 ms 130128 KB Output is correct
22 Correct 50 ms 130132 KB Output is correct
23 Correct 43 ms 130132 KB Output is correct
24 Correct 47 ms 129980 KB Output is correct
25 Correct 85 ms 131060 KB Output is correct
26 Correct 46 ms 130132 KB Output is correct
27 Correct 284 ms 130384 KB Output is correct
28 Correct 636 ms 140604 KB Output is correct
29 Correct 707 ms 137044 KB Output is correct
30 Correct 644 ms 137040 KB Output is correct
31 Correct 691 ms 141508 KB Output is correct
32 Correct 44 ms 129952 KB Output is correct

Subtask #6
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 130196 KB Output is correct
2 Correct 93 ms 130388 KB Output is correct
3 Correct 99 ms 130388 KB Output is correct
4 Correct 107 ms 130176 KB Output is correct
5 Correct 94 ms 130400 KB Output is correct
6 Correct 49 ms 138832 KB Output is correct
7 Correct 49 ms 138580 KB Output is correct
8 Correct 50 ms 138576 KB Output is correct
9 Correct 90 ms 139608 KB Output is correct
10 Correct 46 ms 134480 KB Output is correct
11 Correct 47 ms 134424 KB Output is correct
12 Correct 81 ms 136020 KB Output is correct
13 Correct 55 ms 134484 KB Output is correct
14 Correct 46 ms 134544 KB Output is correct
15 Correct 662 ms 141544 KB Output is correct
16 Correct 2632 ms 144668 KB Output is correct
17 Correct 45 ms 130132 KB Output is correct
18 Correct 47 ms 130128 KB Output is correct
19 Correct 42 ms 130128 KB Output is correct
20 Correct 50 ms 130172 KB Output is correct
21 Correct 44 ms 130132 KB Output is correct
22 Correct 44 ms 130132 KB Output is correct
23 Correct 43 ms 130128 KB Output is correct
24 Correct 43 ms 130128 KB Output is correct
25 Correct 43 ms 130132 KB Output is correct
26 Correct 43 ms 128084 KB Output is correct
27 Correct 80 ms 131156 KB Output is correct
28 Correct 47 ms 129956 KB Output is correct
29 Correct 287 ms 130388 KB Output is correct
30 Correct 646 ms 140520 KB Output is correct
31 Correct 2407 ms 142480 KB Output is correct
32 Correct 2422 ms 142420 KB Output is correct
33 Correct 654 ms 137004 KB Output is correct
34 Correct 2513 ms 137300 KB Output is correct
35 Correct 643 ms 136788 KB Output is correct
36 Correct 2380 ms 137300 KB Output is correct
37 Correct 694 ms 141692 KB Output is correct
38 Correct 2582 ms 143132 KB Output is correct
39 Correct 46 ms 130384 KB Output is correct
40 Correct 2687 ms 137244 KB Output is correct