oj.uz

답안 #1101180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101180 2024-10-15T17:27:58 Z alexander707070 웜뱃 (IOI13_wombats) C++14
76 / 100
 20000 ms 57660 KB 
#include<bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include "wombats.h"
using namespace std;
 
const int bucket_sz=407;
 
const int inf=1e9;
 
int n,m;
int rows[5007][207];
int cols[207][5007];
 
int bucket[5007];
pair<int,int> seg[5007];
 
int dp[207][207][2][207];
int optl[207],optr[207];
 
int getsum(int row,int l,int r){
    return rows[row][r]-rows[row][l-1];
}
 
void calcdp(int buck,int from,int to){
 
    for(int fin=1;fin<=m;fin++){
        for(int c=1;c<=m;c++){
            dp[buck][fin][to%2][c]=getsum(to,min(c,fin),max(c,fin)-1);
        }
 
        for(int r=to-1;r>=from;r--){
            
            optl[1]=dp[buck][fin][1-r%2][1]+cols[1][r];
            for(int c=2;c<=m;c++){
                optl[c]=min(optl[c-1]+getsum(r,c-1,c-1),dp[buck][fin][1-r%2][c]+cols[c][r]);
            }
 
            optr[m]=dp[buck][fin][1-r%2][m]+cols[m][r];
            for(int c=m-1;c>=1;c--){
                optr[c]=min(optr[c+1]+getsum(r,c,c),dp[buck][fin][1-r%2][c]+cols[c][r]);
            }
 
            for(int c=1;c<=m;c++){
                dp[buck][fin][r%2][c]=min(optl[c],optr[c]);
            }
        }
    }
}
 
int dp2[207][207][207];
 
int dist(int buck,int from,int to){
    return dp[buck][to][seg[buck].first%2][from];
}

void optdp(int start,int buck,int l,int r,int optl,int optr){
    if(l>r)return;
    
    int mid=(l+r)/2;
    int opt=optl;

    dp2[start][buck][mid]=inf;

    for(int i=optl;i<=optr;i++){
        if(dp2[start][buck-1][i] + cols[i][seg[buck-1].second] + dist(buck,i,mid) < dp2[start][buck][mid]){
            dp2[start][buck][mid]=dp2[start][buck-1][i] + cols[i][seg[buck-1].second] + dist(buck,i,mid);
            opt=i;
        }
    }

    optdp(start,buck,l,mid-1,optl,opt);
    optdp(start,buck,mid+1,r,opt,optr);
}
 
void solve(int last){

    for(int start=1;start<=m;start++){
        for(int c=1;c<=m;c++){
            dp2[start][0][c]=dist(0,start,c);
        }
    }

    for(int start=1;start<=m;start++){
        for(int i=last;i<=n/bucket_sz;i++){
            optdp(start,i,1,m,1,m);
        }
    }
}
 
void init(int R, int C, int H[5000][200], int V[5000][200]) {
//void init(int R,int C,vector< vector<int> > H,vector< vector<int> > V){
    n=R; m=C;
 
    for(int i=1;i<=n;i++){
        for(int f=1;f<=m-1;f++){
            rows[i][f]=H[i-1][f-1];
            rows[i][f]+=rows[i][f-1];
        }
    }
    for(int i=1;i<=m;i++){
        for(int f=1;f<=n-1;f++){
            cols[i][f]=V[f-1][i-1];
        }
    }
 
    for(int i=1;i<=n;i++){
        bucket[i]=i/bucket_sz;
        if(seg[bucket[i]].first==0)seg[bucket[i]].first=i;
        seg[bucket[i]].second=i;
    }
 
    for(int i=0;i<=n/bucket_sz;i++){
        calcdp(i,seg[i].first,seg[i].second);
    }
    solve(1);
}
 
void changeH(int P, int Q, int W) {
    P++; Q++;
 
    int dif=W-(rows[P][Q]-rows[P][Q-1]);
    for(int i=Q;i<=m-1;i++){
        rows[P][i]+=dif;
    }
    
    calcdp(bucket[P],seg[bucket[P]].first,seg[bucket[P]].second);
    solve(max(bucket[P],1));
}
 
void changeV(int P, int Q, int W){
    P++; Q++;
    cols[Q][P]=W;
 
    if(bucket[P]==bucket[P+1]){
        calcdp(bucket[P],seg[bucket[P]].first,seg[bucket[P]].second);
    }

    solve(max(bucket[P],1));
}
 
int escape(int V1, int V2) {
    V1++; V2++;
 
    return dp2[V1][(n/bucket_sz)][V2];
}
 
/*int main(){
 
    nit(4,1,{{}},{{1},{1},{1},{1}});
 
    cout<<escape(0,0)<<"\n";
    changeV(0,0,2);
    cout<<escape(0,0)<<"\n";
    changeV(1,0,2);
    cout<<escape(0,0)<<"\n";
    changeV(2,0,2);
    cout<<escape(0,0)<<"\n";
 
    init(3,4,{{0,2,5},{7,1,1},{0,4,0}},{{0,0,0,2},{0,3,4,7}});
 
    cout<<escape(2,1)<<"\n";
    cout<<escape(3,3)<<"\n";
 
    changeV(0,0,5);
    changeH(1,1,6);
 
    cout<<escape(2,1)<<"\n";
 
	return 0;
}*/

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 3 ms 14928 KB Output is correct
2 Correct 3 ms 14960 KB Output is correct
3 Correct 40 ms 16468 KB Output is correct
4 Correct 3 ms 14928 KB Output is correct
5 Correct 3 ms 14928 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 2 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6480 KB Output is correct
4 Correct 2 ms 12624 KB Output is correct
5 Correct 2 ms 12624 KB Output is correct
6 Correct 3 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 2 ms 12624 KB Output is correct
9 Correct 2 ms 12624 KB Output is correct
10 Correct 2 ms 12624 KB Output is correct
11 Correct 42 ms 13560 KB Output is correct
12 Correct 2 ms 12624 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 333 ms 27268 KB Output is correct
2 Correct 311 ms 27216 KB Output is correct
3 Correct 344 ms 27268 KB Output is correct
4 Correct 334 ms 27216 KB Output is correct
5 Correct 329 ms 27216 KB Output is correct
6 Correct 1 ms 6648 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 1660 ms 27272 KB Output is correct
10 Correct 2 ms 10576 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21072 KB Output is correct
2 Correct 11 ms 21072 KB Output is correct
3 Correct 10 ms 21096 KB Output is correct
4 Correct 30 ms 21840 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 350 ms 27216 KB Output is correct
2 Correct 314 ms 27216 KB Output is correct
3 Correct 333 ms 27464 KB Output is correct
4 Correct 339 ms 27216 KB Output is correct
5 Correct 315 ms 27216 KB Output is correct
6 Correct 10 ms 21260 KB Output is correct
7 Correct 10 ms 20852 KB Output is correct
8 Correct 11 ms 21072 KB Output is correct
9 Correct 30 ms 21740 KB Output is correct
10 Correct 3 ms 14928 KB Output is correct
11 Correct 3 ms 14928 KB Output is correct
12 Correct 40 ms 16576 KB Output is correct
13 Correct 4 ms 14928 KB Output is correct
14 Correct 4 ms 14928 KB Output is correct
15 Correct 1 ms 6480 KB Output is correct
16 Correct 2 ms 6480 KB Output is correct
17 Correct 1 ms 6480 KB Output is correct
18 Correct 2 ms 12780 KB Output is correct
19 Correct 2 ms 12624 KB Output is correct
20 Correct 2 ms 12624 KB Output is correct
21 Correct 2 ms 12624 KB Output is correct
22 Correct 2 ms 12624 KB Output is correct
23 Correct 2 ms 12624 KB Output is correct
24 Correct 2 ms 12624 KB Output is correct
25 Correct 42 ms 13732 KB Output is correct
26 Correct 2 ms 12624 KB Output is correct
27 Correct 1641 ms 27268 KB Output is correct
28 Correct 6929 ms 39708 KB Output is correct
29 Correct 7888 ms 39184 KB Output is correct
30 Correct 7132 ms 39056 KB Output is correct
31 Correct 8099 ms 40808 KB Output is correct
32 Correct 2 ms 10744 KB Output is correct

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 343 ms 27268 KB Output is correct
2 Correct 317 ms 27216 KB Output is correct
3 Correct 344 ms 27216 KB Output is correct
4 Correct 354 ms 27216 KB Output is correct
5 Correct 312 ms 27216 KB Output is correct
6 Correct 9 ms 21072 KB Output is correct
7 Correct 10 ms 21084 KB Output is correct
8 Correct 9 ms 21064 KB Output is correct
9 Correct 39 ms 21832 KB Output is correct
10 Correct 3 ms 14928 KB Output is correct
11 Correct 3 ms 14928 KB Output is correct
12 Correct 40 ms 16464 KB Output is correct
13 Correct 3 ms 14928 KB Output is correct
14 Correct 3 ms 14928 KB Output is correct
15 Correct 1014 ms 56856 KB Output is correct
16 Execution timed out 20063 ms 57660 KB Time limit exceeded
17 Halted 0 ms 0 KB -