Submission #384087

#	Time	Username	Problem	Language	Result	Execution time	Memory
384087		kshitij_sodani	Wombats (IOI13_wombats)	C++14	55 / 100	20089 ms	28076 KiB

wombats

//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'




#include "wombats.h"
int aa[5000][201];
int bb[5000][201];
int dp[5000][201];
int n,m;
int su=0;
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++){
			aa[i][j]=H[i][j];
			su+=aa[i][j];
		}
	}
	for(int j=0;j<m;j++){
		for(int i=0;i<n-1;i++){
			bb[i][j]=V[i][j];
			su+=bb[i][j];
		}
	}
    /* ... */
}

void changeH(int p, int q, int w) {
    /* ... */
	aa[p][q]=w;


}

void changeV(int p, int q, int w) {
    /* ... */
	bb[p][q]=w;


}

int escape(int c, int d) {
	//return 0;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			dp[i][j]=1e9;
		}
	}
	dp[0][c]=0;
	for(int i=0;i<n;i++){

		for(int j=0;j<m;j++){
			if(i>0){
				dp[i][j]=min(dp[i][j],dp[i-1][j]+bb[i-1][j]);
			}
		}
		for(int j=0;j<m-1;j++){
			dp[i][j+1]=min(dp[i][j+1],dp[i][j]+aa[i][j]);
		}
		for(int j=m-1;j>0;j--){
			dp[i][j-1]=min(dp[i][j-1],dp[i][j]+aa[i][j-1]);
		}	
	}
	/*for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cout<<dp[i][j]<<",";
		}
		cout<<endl;
	}
*/

    return dp[n-1][d];
}

Compilation message (stderr)

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 / 9
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 0 / 21
• Subtask 6: 0 / 24