oj.uz

답안 #1021288

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021288 2024-07-12T16:42:03 Z amirhoseinfar1385 웜뱃 (IOI13_wombats) C++17
100 / 100
 2882 ms 262144 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=15,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 76 ms 189884 KB Output is correct
2 Correct 77 ms 189864 KB Output is correct
3 Correct 113 ms 192592 KB Output is correct
4 Correct 83 ms 189924 KB Output is correct
5 Correct 85 ms 189908 KB Output is correct
6 Correct 73 ms 179024 KB Output is correct
7 Correct 74 ms 178772 KB Output is correct
8 Correct 73 ms 179024 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 179024 KB Output is correct
2 Correct 73 ms 179024 KB Output is correct
3 Correct 72 ms 179024 KB Output is correct
4 Correct 72 ms 179024 KB Output is correct
5 Correct 78 ms 179024 KB Output is correct
6 Correct 72 ms 179024 KB Output is correct
7 Correct 72 ms 179156 KB Output is correct
8 Correct 74 ms 179008 KB Output is correct
9 Correct 89 ms 179124 KB Output is correct
10 Correct 78 ms 178932 KB Output is correct
11 Correct 111 ms 181328 KB Output is correct
12 Correct 93 ms 179024 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 180024 KB Output is correct
2 Correct 120 ms 180048 KB Output is correct
3 Correct 118 ms 179988 KB Output is correct
4 Correct 120 ms 180044 KB Output is correct
5 Correct 120 ms 180052 KB Output is correct
6 Correct 102 ms 178768 KB Output is correct
7 Correct 82 ms 178876 KB Output is correct
8 Correct 73 ms 178772 KB Output is correct
9 Correct 279 ms 180052 KB Output is correct
10 Correct 79 ms 179028 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 197852 KB Output is correct
2 Correct 81 ms 197972 KB Output is correct
3 Correct 80 ms 197964 KB Output is correct
4 Correct 101 ms 199308 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 180048 KB Output is correct
2 Correct 130 ms 179940 KB Output is correct
3 Correct 157 ms 180020 KB Output is correct
4 Correct 130 ms 179940 KB Output is correct
5 Correct 130 ms 180100 KB Output is correct
6 Correct 93 ms 197924 KB Output is correct
7 Correct 91 ms 197968 KB Output is correct
8 Correct 91 ms 197968 KB Output is correct
9 Correct 101 ms 199444 KB Output is correct
10 Correct 78 ms 189780 KB Output is correct
11 Correct 79 ms 189780 KB Output is correct
12 Correct 114 ms 192688 KB Output is correct
13 Correct 83 ms 189776 KB Output is correct
14 Correct 79 ms 189772 KB Output is correct
15 Correct 72 ms 179028 KB Output is correct
16 Correct 75 ms 178832 KB Output is correct
17 Correct 82 ms 179024 KB Output is correct
18 Correct 82 ms 179028 KB Output is correct
19 Correct 71 ms 178948 KB Output is correct
20 Correct 74 ms 179024 KB Output is correct
21 Correct 100 ms 178940 KB Output is correct
22 Correct 80 ms 179028 KB Output is correct
23 Correct 81 ms 178980 KB Output is correct
24 Correct 82 ms 178992 KB Output is correct
25 Correct 117 ms 181508 KB Output is correct
26 Correct 92 ms 179012 KB Output is correct
27 Correct 312 ms 180024 KB Output is correct
28 Correct 691 ms 229228 KB Output is correct
29 Correct 750 ms 220756 KB Output is correct
30 Correct 756 ms 220632 KB Output is correct
31 Correct 772 ms 231048 KB Output is correct
32 Correct 90 ms 179028 KB Output is correct

Subtask #6
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 180048 KB Output is correct
2 Correct 124 ms 180040 KB Output is correct
3 Correct 128 ms 180052 KB Output is correct
4 Correct 127 ms 180028 KB Output is correct
5 Correct 147 ms 180052 KB Output is correct
6 Correct 91 ms 197800 KB Output is correct
7 Correct 79 ms 197972 KB Output is correct
8 Correct 79 ms 197964 KB Output is correct
9 Correct 103 ms 199248 KB Output is correct
10 Correct 78 ms 189780 KB Output is correct
11 Correct 79 ms 189780 KB Output is correct
12 Correct 122 ms 192660 KB Output is correct
13 Correct 78 ms 189780 KB Output is correct
14 Correct 78 ms 189776 KB Output is correct
15 Correct 970 ms 261944 KB Output is correct
16 Correct 2882 ms 262144 KB Output is correct
17 Correct 74 ms 178872 KB Output is correct
18 Correct 73 ms 179024 KB Output is correct
19 Correct 72 ms 178868 KB Output is correct
20 Correct 80 ms 179024 KB Output is correct
21 Correct 82 ms 179124 KB Output is correct
22 Correct 83 ms 179024 KB Output is correct
23 Correct 81 ms 179116 KB Output is correct
24 Correct 75 ms 179028 KB Output is correct
25 Correct 74 ms 179140 KB Output is correct
26 Correct 74 ms 179064 KB Output is correct
27 Correct 111 ms 181332 KB Output is correct
28 Correct 73 ms 179028 KB Output is correct
29 Correct 281 ms 180104 KB Output is correct
30 Correct 725 ms 229368 KB Output is correct
31 Correct 2493 ms 261028 KB Output is correct
32 Correct 2688 ms 260892 KB Output is correct
33 Correct 760 ms 220744 KB Output is correct
34 Correct 2594 ms 247140 KB Output is correct
35 Correct 730 ms 220756 KB Output is correct
36 Correct 2679 ms 247128 KB Output is correct
37 Correct 777 ms 230992 KB Output is correct
38 Correct 2554 ms 261588 KB Output is correct
39 Correct 78 ms 226896 KB Output is correct
40 Correct 2848 ms 248484 KB Output is correct