oj.uz

답안 #1021320

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021320 2024-07-12T16:56:43 Z amirhoseinfar1385 웜뱃 (IOI13_wombats) C++17
100 / 100
 2359 ms 161228 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];
    vector<pair<int,int>>allv;
    void build(){
        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;
                }
            }
        }
        for(int i=m;i>=1;i--){
          for(int j=1;j<=m;j++){
            allv.push_back(make_pair(i,j));
          }
        }
    }
    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){
        int l=0;
        while(l<(int)allv.size()){
            r=allv[l].first;
            c=allv[l].second;
            l++;
           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;
        }
    }
 
    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;
    seg.build();
    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 100436 KB Output is correct
2 Correct 41 ms 100436 KB Output is correct
3 Correct 82 ms 103248 KB Output is correct
4 Correct 41 ms 100440 KB Output is correct
5 Correct 41 ms 100432 KB Output is correct
6 Correct 36 ms 90196 KB Output is correct
7 Correct 36 ms 90144 KB Output is correct
8 Correct 37 ms 90196 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 90196 KB Output is correct
2 Correct 36 ms 90192 KB Output is correct
3 Correct 36 ms 90192 KB Output is correct
4 Correct 37 ms 90192 KB Output is correct
5 Correct 37 ms 90196 KB Output is correct
6 Correct 37 ms 90172 KB Output is correct
7 Correct 37 ms 90196 KB Output is correct
8 Correct 37 ms 90196 KB Output is correct
9 Correct 36 ms 90192 KB Output is correct
10 Correct 35 ms 90204 KB Output is correct
11 Correct 77 ms 92684 KB Output is correct
12 Correct 35 ms 90200 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 91176 KB Output is correct
2 Correct 82 ms 91216 KB Output is correct
3 Correct 83 ms 91224 KB Output is correct
4 Correct 82 ms 91216 KB Output is correct
5 Correct 84 ms 91216 KB Output is correct
6 Correct 37 ms 90204 KB Output is correct
7 Correct 39 ms 90192 KB Output is correct
8 Correct 39 ms 90196 KB Output is correct
9 Correct 258 ms 91344 KB Output is correct
10 Correct 36 ms 90196 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 108372 KB Output is correct
2 Correct 47 ms 108344 KB Output is correct
3 Correct 48 ms 108368 KB Output is correct
4 Correct 66 ms 109908 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 91416 KB Output is correct
2 Correct 80 ms 91352 KB Output is correct
3 Correct 85 ms 91228 KB Output is correct
4 Correct 89 ms 91228 KB Output is correct
5 Correct 85 ms 91340 KB Output is correct
6 Correct 46 ms 108380 KB Output is correct
7 Correct 44 ms 108372 KB Output is correct
8 Correct 45 ms 108368 KB Output is correct
9 Correct 72 ms 109936 KB Output is correct
10 Correct 43 ms 100396 KB Output is correct
11 Correct 39 ms 100388 KB Output is correct
12 Correct 81 ms 103252 KB Output is correct
13 Correct 47 ms 100436 KB Output is correct
14 Correct 43 ms 100432 KB Output is correct
15 Correct 36 ms 90192 KB Output is correct
16 Correct 35 ms 90192 KB Output is correct
17 Correct 35 ms 90196 KB Output is correct
18 Correct 37 ms 90292 KB Output is correct
19 Correct 36 ms 90192 KB Output is correct
20 Correct 36 ms 90204 KB Output is correct
21 Correct 38 ms 90264 KB Output is correct
22 Correct 37 ms 90196 KB Output is correct
23 Correct 37 ms 90192 KB Output is correct
24 Correct 37 ms 90304 KB Output is correct
25 Correct 79 ms 92496 KB Output is correct
26 Correct 42 ms 90228 KB Output is correct
27 Correct 253 ms 91204 KB Output is correct
28 Correct 606 ms 133204 KB Output is correct
29 Correct 607 ms 126288 KB Output is correct
30 Correct 581 ms 126032 KB Output is correct
31 Correct 641 ms 134996 KB Output is correct
32 Correct 37 ms 90196 KB Output is correct

Subtask #6
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 91224 KB Output is correct
2 Correct 83 ms 91224 KB Output is correct
3 Correct 87 ms 91216 KB Output is correct
4 Correct 101 ms 91224 KB Output is correct
5 Correct 84 ms 91424 KB Output is correct
6 Correct 47 ms 108468 KB Output is correct
7 Correct 42 ms 108312 KB Output is correct
8 Correct 48 ms 108372 KB Output is correct
9 Correct 63 ms 109780 KB Output is correct
10 Correct 44 ms 100436 KB Output is correct
11 Correct 47 ms 100688 KB Output is correct
12 Correct 90 ms 103152 KB Output is correct
13 Correct 45 ms 100436 KB Output is correct
14 Correct 42 ms 100432 KB Output is correct
15 Correct 751 ms 159944 KB Output is correct
16 Correct 2221 ms 161228 KB Output is correct
17 Correct 41 ms 90196 KB Output is correct
18 Correct 38 ms 90196 KB Output is correct
19 Correct 37 ms 90196 KB Output is correct
20 Correct 38 ms 90196 KB Output is correct
21 Correct 37 ms 90196 KB Output is correct
22 Correct 37 ms 90196 KB Output is correct
23 Correct 35 ms 90200 KB Output is correct
24 Correct 42 ms 90256 KB Output is correct
25 Correct 37 ms 90284 KB Output is correct
26 Correct 37 ms 90192 KB Output is correct
27 Correct 79 ms 92496 KB Output is correct
28 Correct 38 ms 90200 KB Output is correct
29 Correct 279 ms 91308 KB Output is correct
30 Correct 542 ms 133204 KB Output is correct
31 Correct 1993 ms 158664 KB Output is correct
32 Correct 2113 ms 158504 KB Output is correct
33 Correct 583 ms 126032 KB Output is correct
34 Correct 2112 ms 147404 KB Output is correct
35 Correct 584 ms 126032 KB Output is correct
36 Correct 2214 ms 147180 KB Output is correct
37 Correct 736 ms 134832 KB Output is correct
38 Correct 2359 ms 159120 KB Output is correct
39 Correct 36 ms 90192 KB Output is correct
40 Correct 2242 ms 147480 KB Output is correct