oj.uz

Submission #1101168

# Submission time Handle Problem Language Result Execution time Memory
1101168 2024-10-15T17:15:37 Z alexander707070 Wombats (IOI13_wombats) C++14
76 / 100
 20000 ms 35836 KB 
#include<bits/stdc++.h>
#include "wombats.h"
using namespace std;
 
const int bucket_sz=107;
 
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 25168 KB Output is correct
2 Correct 4 ms 25168 KB Output is correct
3 Correct 43 ms 26708 KB Output is correct
4 Correct 4 ms 25172 KB Output is correct
5 Correct 4 ms 25168 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

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 1 ms 6480 KB Output is correct
5 Correct 1 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 2 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 43 ms 7584 KB Output is correct
12 Correct 2 ms 6648 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 8784 KB Output is correct
2 Correct 308 ms 8784 KB Output is correct
3 Correct 337 ms 8784 KB Output is correct
4 Correct 337 ms 8784 KB Output is correct
5 Correct 311 ms 8952 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 1747 ms 8804 KB Output is correct
10 Correct 1 ms 6480 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 31312 KB Output is correct
2 Correct 9 ms 31312 KB Output is correct
3 Correct 8 ms 31308 KB Output is correct
4 Correct 28 ms 32004 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 8804 KB Output is correct
2 Correct 336 ms 8804 KB Output is correct
3 Correct 351 ms 8784 KB Output is correct
4 Correct 330 ms 8816 KB Output is correct
5 Correct 311 ms 8784 KB Output is correct
6 Correct 9 ms 31312 KB Output is correct
7 Correct 9 ms 31312 KB Output is correct
8 Correct 10 ms 31312 KB Output is correct
9 Correct 30 ms 32104 KB Output is correct
10 Correct 4 ms 25168 KB Output is correct
11 Correct 4 ms 25168 KB Output is correct
12 Correct 43 ms 26716 KB Output is correct
13 Correct 4 ms 25168 KB Output is correct
14 Correct 4 ms 25168 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 2 ms 6480 KB Output is correct
19 Correct 2 ms 6480 KB Output is correct
20 Correct 1 ms 6480 KB Output is correct
21 Correct 1 ms 6480 KB Output is correct
22 Correct 2 ms 6480 KB Output is correct
23 Correct 1 ms 6480 KB Output is correct
24 Correct 1 ms 6480 KB Output is correct
25 Correct 41 ms 7560 KB Output is correct
26 Correct 2 ms 6480 KB Output is correct
27 Correct 1752 ms 8804 KB Output is correct
28 Correct 5751 ms 33532 KB Output is correct
29 Correct 5658 ms 30936 KB Output is correct
30 Correct 5814 ms 30812 KB Output is correct
31 Correct 6291 ms 34748 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 388 ms 8800 KB Output is correct
2 Correct 315 ms 8808 KB Output is correct
3 Correct 347 ms 8956 KB Output is correct
4 Correct 359 ms 8784 KB Output is correct
5 Correct 318 ms 8804 KB Output is correct
6 Correct 10 ms 31312 KB Output is correct
7 Correct 8 ms 31312 KB Output is correct
8 Correct 9 ms 31312 KB Output is correct
9 Correct 29 ms 32092 KB Output is correct
10 Correct 4 ms 25168 KB Output is correct
11 Correct 5 ms 25168 KB Output is correct
12 Correct 76 ms 26696 KB Output is correct
13 Correct 6 ms 25168 KB Output is correct
14 Correct 4 ms 25168 KB Output is correct
15 Correct 1031 ms 34920 KB Output is correct
16 Execution timed out 20065 ms 35836 KB Time limit exceeded
17 Halted 0 ms 0 KB -