oj.uz

Submission #1101160

# Submission time Handle Problem Language Result Execution time Memory
1101160 2024-10-15T17:07:02 Z alexander707070 Wombats (IOI13_wombats) C++14
76 / 100
 20000 ms 32072 KB 
#include<bits/stdc++.h>
#include "wombats.h"
using namespace std;
 
const int bucket_sz=700;
 
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][2][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%2][mid]=inf;

    for(int i=optl;i<=optr;i++){
        if(dp2[start][1-buck%2][i] + cols[i][seg[buck-1].second] + dist(buck,i,mid) < dp2[start][buck%2][mid]){
            dp2[start][buck%2][mid]=dp2[start][1-buck%2][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(){
    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=1;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();
}
 
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();
}
 
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();
}
 
int escape(int V1, int V2) {
    V1++; V2++;
 
    return dp2[V1][(n/bucket_sz)%2][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

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12880 KB Output is correct
2 Correct 4 ms 12880 KB Output is correct
3 Correct 41 ms 15604 KB Output is correct
4 Correct 4 ms 12880 KB Output is correct
5 Correct 4 ms 12880 KB Output is correct
6 Correct 1 ms 4432 KB Output is correct
7 Correct 1 ms 4544 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 6652 KB Output is correct
5 Correct 2 ms 6480 KB Output is correct
6 Correct 2 ms 6480 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 1 ms 6480 KB Output is correct
10 Correct 1 ms 6648 KB Output is correct
11 Correct 44 ms 8964 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 8784 KB Output is correct
2 Correct 310 ms 8784 KB Output is correct
3 Correct 340 ms 8880 KB Output is correct
4 Correct 331 ms 8784 KB Output is correct
5 Correct 318 ms 8888 KB Output is correct
6 Correct 1 ms 4432 KB Output is correct
7 Correct 1 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1656 ms 8888 KB Output is correct
10 Correct 2 ms 6480 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19024 KB Output is correct
2 Correct 13 ms 19024 KB Output is correct
3 Correct 13 ms 19108 KB Output is correct
4 Correct 35 ms 20304 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 8784 KB Output is correct
2 Correct 310 ms 8884 KB Output is correct
3 Correct 331 ms 8784 KB Output is correct
4 Correct 335 ms 8784 KB Output is correct
5 Correct 312 ms 8888 KB Output is correct
6 Correct 14 ms 19024 KB Output is correct
7 Correct 15 ms 19024 KB Output is correct
8 Correct 14 ms 19024 KB Output is correct
9 Correct 36 ms 20388 KB Output is correct
10 Correct 4 ms 12880 KB Output is correct
11 Correct 4 ms 13136 KB Output is correct
12 Correct 45 ms 15596 KB Output is correct
13 Correct 4 ms 12880 KB Output is correct
14 Correct 4 ms 12880 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 4432 KB Output is correct
18 Correct 1 ms 6480 KB Output is correct
19 Correct 1 ms 6696 KB Output is correct
20 Correct 2 ms 6480 KB Output is correct
21 Correct 1 ms 6480 KB Output is correct
22 Correct 1 ms 6652 KB Output is correct
23 Correct 1 ms 6480 KB Output is correct
24 Correct 1 ms 6480 KB Output is correct
25 Correct 40 ms 8828 KB Output is correct
26 Correct 2 ms 6480 KB Output is correct
27 Correct 1644 ms 8876 KB Output is correct
28 Correct 12428 ms 25104 KB Output is correct
29 Correct 13027 ms 22156 KB Output is correct
30 Correct 11936 ms 22148 KB Output is correct
31 Correct 13320 ms 26844 KB Output is correct
32 Correct 2 ms 6480 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 8784 KB Output is correct
2 Correct 323 ms 9032 KB Output is correct
3 Correct 332 ms 8784 KB Output is correct
4 Correct 342 ms 8888 KB Output is correct
5 Correct 312 ms 8784 KB Output is correct
6 Correct 12 ms 19024 KB Output is correct
7 Correct 13 ms 19084 KB Output is correct
8 Correct 14 ms 19024 KB Output is correct
9 Correct 39 ms 20296 KB Output is correct
10 Correct 4 ms 13132 KB Output is correct
11 Correct 4 ms 12880 KB Output is correct
12 Correct 47 ms 15600 KB Output is correct
13 Correct 4 ms 12880 KB Output is correct
14 Correct 4 ms 12880 KB Output is correct
15 Correct 1172 ms 32072 KB Output is correct
16 Execution timed out 20019 ms 31480 KB Time limit exceeded
17 Halted 0 ms 0 KB -