oj.uz

Submission #60272

# Submission time Handle Problem Language Result Execution time Memory
60272 2018-07-23T23:40:02 Z ksun48 Wombats (IOI13_wombats) C++14
76 / 100
 20000 ms 186368 KB 
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;

typedef vector<vector<int> > Paths;
const int MAXD = 100000000; // 1e8

int r;
int c;

vector<vector<int> > h;
vector<vector<int> > v;

void pr(const Paths &ans){
	for(int i = 0; i < c; i++){
		for(int j = 0; j < c; j++){
			cout << ans[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
}

void dnc(const Paths &a, const Paths &b, Paths &paths, int t, int bl, int br, int ml, int mr){
	if(bl > br) return;
	// top, bottom left, bottom right
	int bm = (bl + br) / 2;
	int best = MAXD + 1;
	int bestm = -1;
	for(int m = ml; m <= mr; m++){
		int dist = a[t][m] + b[m][bm];
		if(dist < best){
			best = dist;
			bestm = m;
		}
	}
	assert(bestm != -1);
	paths[t][bm] = best;
	dnc(a, b, paths, t, bl, bm - 1, ml, bestm);
	dnc(a, b, paths, t, bm + 1, br, bestm, mr);
}

Paths join(const Paths &a, const Paths &b){
	Paths paths(c, vector<int>(c, MAXD));
	for(int i = 0; i < c; i++){
		dnc(a, b, paths, i, 0, c-1, 0, c-1);
	}
	return paths;
}

Paths horizontal(int row){
	vector<int> psums(c);
	psums[0] = 0;
	for(int i = 1; i < c; i++){
		psums[i] = psums[i-1] + h[row][i-1];
	}
	Paths paths(c, vector<int>(c, MAXD));
	for(int i = 0; i < c; i++){
		for(int j = 0; j < c; j++){
			paths[i][j] = abs(psums[j] - psums[i]);
		}
	}
	return paths;
}

Paths empty(){
	Paths p2(c, vector<int>(c, MAXD));
	for(int i = 0; i < c; i++){
		p2[i][i] = 0;
	}
	return p2;
}

Paths make(int row){
	Paths p2(c, vector<int>(c, MAXD));
	for(int i = 0; i < c; i++){
		p2[i][i] = v[row][i];
	}
	return join(horizontal(row), p2);
}

Paths make_interval(int r1, int r2){
	Paths p = make(r1);
	for(int a = r1 + 1; a <= r2; a++){
		p = join(p, make(a));
	}
	return p;
}

Paths ans;

struct node {
	Paths p;
	node *l, *r;
	int lx, rx;
};

const int BLOCKSZ = 15;

node* build(int lx, int rx){
	node* v = new node();
	v->lx = lx;
	v->rx = rx;
	if(rx - lx + 1 <= BLOCKSZ){
		v->l = v->r = NULL;
		v->p = make_interval(v->lx, v->rx);
	} else {
		int mx = (lx + rx) / 2;
		v->l = build(lx, mx);
		v->r = build(mx + 1, rx);
		v->p = join(v->l->p, v->r->p);
	}
	return v;
}

void upd(node* v, int x){
	if(x < v->lx || x > v->rx) return;
	if(v->l == NULL && v->r == NULL){
		v->p = make_interval(v->lx, v->rx);
	} else {
		upd(v->l, x);
		upd(v->r, x);
		v->p = join(v->l->p, v->r->p);
	}
}

node* tree;

void init(int R, int C, int H[5000][200], int V[5000][200]) {
	r = R;
	c = C;
	h.resize(r, vector<int>(c-1, 0));
	v.resize(r, vector<int>(c, 0));
	for(int i = 0; i < r; i++){
		for(int j = 0; j < c-1; j++){
			h[i][j] = H[i][j];
		}
	}
	for(int i = 0; i < r-1; i++){
		for(int j = 0; j < c; j++){
			v[i][j] = V[i][j];
		}
	}
	tree = build(0, r-1);
}

void changeH(int P, int Q, int W) {
	h[P][Q] = W;
	upd(tree, P-1);
	upd(tree, P);
}

void changeV(int P, int Q, int W) {
	v[P][Q] = W;
	upd(tree, P);
}

int escape(int V1, int V2) {
	return tree->p[V1][V2];
}

Compilation message

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.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4728 KB Output is correct
2 Correct 20 ms 4752 KB Output is correct
3 Correct 112 ms 6444 KB Output is correct
4 Correct 17 ms 6444 KB Output is correct
5 Correct 16 ms 6444 KB Output is correct
6 Correct 3 ms 6444 KB Output is correct
7 Correct 3 ms 6444 KB Output is correct
8 Correct 2 ms 6444 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6444 KB Output is correct
2 Correct 2 ms 6444 KB Output is correct
3 Correct 3 ms 6444 KB Output is correct
4 Correct 3 ms 6444 KB Output is correct
5 Correct 3 ms 6444 KB Output is correct
6 Correct 3 ms 6444 KB Output is correct
7 Correct 4 ms 6444 KB Output is correct
8 Correct 4 ms 6444 KB Output is correct
9 Correct 3 ms 6444 KB Output is correct
10 Correct 1 ms 6444 KB Output is correct
11 Correct 159 ms 6444 KB Output is correct
12 Correct 4 ms 6444 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1252 ms 6444 KB Output is correct
2 Correct 1121 ms 6444 KB Output is correct
3 Correct 1757 ms 6444 KB Output is correct
4 Correct 869 ms 6444 KB Output is correct
5 Correct 1261 ms 6444 KB Output is correct
6 Correct 3 ms 6444 KB Output is correct
7 Correct 2 ms 6444 KB Output is correct
8 Correct 3 ms 6444 KB Output is correct
9 Correct 7465 ms 6444 KB Output is correct
10 Correct 2 ms 6444 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 9244 KB Output is correct
2 Correct 26 ms 9244 KB Output is correct
3 Correct 32 ms 9244 KB Output is correct
4 Correct 101 ms 10032 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1561 ms 10032 KB Output is correct
2 Correct 832 ms 10032 KB Output is correct
3 Correct 1794 ms 10032 KB Output is correct
4 Correct 929 ms 10032 KB Output is correct
5 Correct 1487 ms 10032 KB Output is correct
6 Correct 30 ms 10032 KB Output is correct
7 Correct 23 ms 10032 KB Output is correct
8 Correct 25 ms 10032 KB Output is correct
9 Correct 83 ms 10032 KB Output is correct
10 Correct 17 ms 10032 KB Output is correct
11 Correct 14 ms 10032 KB Output is correct
12 Correct 142 ms 10032 KB Output is correct
13 Correct 15 ms 10032 KB Output is correct
14 Correct 14 ms 10032 KB Output is correct
15 Correct 3 ms 10032 KB Output is correct
16 Correct 3 ms 10032 KB Output is correct
17 Correct 2 ms 10032 KB Output is correct
18 Correct 4 ms 10032 KB Output is correct
19 Correct 4 ms 10032 KB Output is correct
20 Correct 4 ms 10032 KB Output is correct
21 Correct 4 ms 10032 KB Output is correct
22 Correct 4 ms 10032 KB Output is correct
23 Correct 4 ms 10032 KB Output is correct
24 Correct 4 ms 10032 KB Output is correct
25 Correct 112 ms 10032 KB Output is correct
26 Correct 5 ms 10032 KB Output is correct
27 Correct 6941 ms 10032 KB Output is correct
28 Correct 9785 ms 57688 KB Output is correct
29 Correct 7351 ms 57688 KB Output is correct
30 Correct 8323 ms 57688 KB Output is correct
31 Correct 9598 ms 58728 KB Output is correct
32 Correct 3 ms 58728 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1361 ms 58728 KB Output is correct
2 Correct 688 ms 58728 KB Output is correct
3 Correct 1632 ms 58728 KB Output is correct
4 Correct 895 ms 58728 KB Output is correct
5 Correct 1336 ms 58728 KB Output is correct
6 Correct 39 ms 58728 KB Output is correct
7 Correct 22 ms 58728 KB Output is correct
8 Correct 31 ms 58728 KB Output is correct
9 Correct 79 ms 58728 KB Output is correct
10 Correct 16 ms 58728 KB Output is correct
11 Correct 14 ms 58728 KB Output is correct
12 Correct 103 ms 58728 KB Output is correct
13 Correct 21 ms 58728 KB Output is correct
14 Correct 22 ms 58728 KB Output is correct
15 Correct 13536 ms 185696 KB Output is correct
16 Execution timed out 20087 ms 186368 KB Time limit exceeded
17 Halted 0 ms 0 KB -