Submission #60249

#	Time	Username	Problem	Language	Result	Execution time	Memory
60249		spencercompton	Wombats (IOI13_wombats)	C++17	55 / 100	20085 ms	18220 KiB

wombats

#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
int bel[5000][200];
int rig[5000][200];
int r, c;
bool v[5000][200];
pair<int, int> pre[200][200];
int upd = 0;
int sum = 0;
int vals[2][2];
void init(int R, int C, int H[5000][200], int V[5000][200]) {
	r = R;
	c = C;
	for(int i = 0; i<r; i++){
		for(int j =0 ; j<c; j++){
			if(i+1<r){
				bel[i][j] = V[i][j];
				sum += V[i][j];
			}
			if(j+1<c){
				rig[i][j] = H[i][j];
			}
		}
	}
	for(int i = 0; i<c; i++){
		for(int j = 0; j<c; j++){
			pre[i][j] = make_pair(-1,-1);
		}
	}
}
 
void changeH(int P, int Q, int W) {
	rig[P][Q] = W;
	upd++;
}
 
void changeV(int P, int Q, int W) {
	sum += (W-bel[P][Q]);
	bel[P][Q] = W;
	upd++;
}
 
int escape(int V1, int V2) {
	if(c==1){
		return sum;
	}
	if(pre[V1][V2].second==upd){
		return pre[V1][V2].first;
	}
	for(int i = 0; i<r; i++){
		for(int j = 0; j<c; j++){
			v[i][j] = false;
		}
	}
	priority_queue<pair<int, pair<int, int> > > pq;
	pq.push(make_pair(0,make_pair(0,V1)));
	while(pq.size()>0){
		int zz = -pq.top().first;
		int y = pq.top().second.first;
		int x = pq.top().second.second;
		pq.pop();
		if(y==r-1 && x==V2){
			pre[V1][V2] = make_pair(zz,upd);
			return zz;
		}
		if(v[y][x]){
			continue;
		}
		v[y][x] = true;
		int ny, nx;
		if(x>0){
			 ny = y;
			 nx = x-1; 
			if(!v[ny][nx]){
				pq.push(make_pair(-zz-rig[ny][nx],make_pair(ny,nx)));
			}
		}
		if(x<c-1){
			 ny = y;
			 nx = x+1;
			if(!v[ny][nx]){
				pq.push(make_pair(-zz-rig[y][x],make_pair(ny,nx)));
			}
		}
		if(y<r-1){
			 ny = y+1;
			 nx = x;
			if(!v[ny][nx]){
				pq.push(make_pair(-zz-bel[y][x],make_pair(ny,nx)));

			}
		}
	}
    return -1;
}

Compilation message (stderr)

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  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