oj.uz

Submission #60277

# Submission time Handle Problem Language Result Execution time Memory
60277 2018-07-23T23:49:51 Z ksun48 Wombats (IOI13_wombats) C++14
76 / 100
 9244 ms 263168 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]) + v[row][j];
		}
	}
	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){
	return horizontal(row);
}

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 = 5;

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 11 ms 4856 KB Output is correct
2 Correct 12 ms 5096 KB Output is correct
3 Correct 104 ms 6680 KB Output is correct
4 Correct 12 ms 6680 KB Output is correct
5 Correct 15 ms 6680 KB Output is correct
6 Correct 3 ms 6680 KB Output is correct
7 Correct 3 ms 6680 KB Output is correct
8 Correct 3 ms 6680 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 450 ms 6680 KB Output is correct
2 Correct 250 ms 6680 KB Output is correct
3 Correct 565 ms 6680 KB Output is correct
4 Correct 290 ms 6680 KB Output is correct
5 Correct 397 ms 6680 KB Output is correct
6 Correct 2 ms 6680 KB Output is correct
7 Correct 2 ms 6680 KB Output is correct
8 Correct 2 ms 6680 KB Output is correct
9 Correct 1680 ms 6680 KB Output is correct
10 Correct 5 ms 6680 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 9388 KB Output is correct
2 Correct 18 ms 9388 KB Output is correct
3 Correct 21 ms 9432 KB Output is correct
4 Correct 79 ms 10156 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 553 ms 10156 KB Output is correct
2 Correct 244 ms 10156 KB Output is correct
3 Correct 499 ms 10156 KB Output is correct
4 Correct 262 ms 10156 KB Output is correct
5 Correct 368 ms 10156 KB Output is correct
6 Correct 23 ms 10156 KB Output is correct
7 Correct 24 ms 10156 KB Output is correct
8 Correct 19 ms 10156 KB Output is correct
9 Correct 69 ms 10248 KB Output is correct
10 Correct 10 ms 10248 KB Output is correct
11 Correct 12 ms 10248 KB Output is correct
12 Correct 98 ms 10248 KB Output is correct
13 Correct 15 ms 10248 KB Output is correct
14 Correct 11 ms 10248 KB Output is correct
15 Correct 3 ms 10248 KB Output is correct
16 Correct 3 ms 10248 KB Output is correct
17 Correct 2 ms 10248 KB Output is correct
18 Correct 3 ms 10248 KB Output is correct
19 Correct 3 ms 10248 KB Output is correct
20 Correct 3 ms 10248 KB Output is correct
21 Correct 3 ms 10248 KB Output is correct
22 Correct 4 ms 10248 KB Output is correct
23 Correct 4 ms 10248 KB Output is correct
24 Correct 4 ms 10248 KB Output is correct
25 Correct 108 ms 10248 KB Output is correct
26 Correct 4 ms 10248 KB Output is correct
27 Correct 1956 ms 10248 KB Output is correct
28 Correct 5079 ms 101768 KB Output is correct
29 Correct 4773 ms 101768 KB Output is correct
30 Correct 4571 ms 101768 KB Output is correct
31 Correct 5337 ms 102664 KB Output is correct
32 Correct 3 ms 102664 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 452 ms 102664 KB Output is correct
2 Correct 234 ms 102664 KB Output is correct
3 Correct 604 ms 102664 KB Output is correct
4 Correct 346 ms 102664 KB Output is correct
5 Correct 408 ms 102664 KB Output is correct
6 Correct 22 ms 102664 KB Output is correct
7 Correct 21 ms 102664 KB Output is correct
8 Correct 24 ms 102664 KB Output is correct
9 Correct 86 ms 102664 KB Output is correct
10 Correct 12 ms 102664 KB Output is correct
11 Correct 12 ms 102664 KB Output is correct
12 Correct 127 ms 102664 KB Output is correct
13 Correct 15 ms 102664 KB Output is correct
14 Correct 14 ms 102664 KB Output is correct
15 Runtime error 9244 ms 263168 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
16 Halted 0 ms 0 KB -