CSES - KILO 2015 5/5

Submission details
Task:	Mission
Sender:	Team Purkka
Submission time:	2015-10-07 18:18:35 +0300
Language:	C++
Status:	READY
Result:	TIME LIMIT EXCEEDED

Test results
test	verdict	time
#1	ACCEPTED	0.06 s	details
#2	TIME LIMIT EXCEEDED	--	details
#3	ACCEPTED	0.06 s	details
#4	TIME LIMIT EXCEEDED	--	details
#5	ACCEPTED	0.28 s	details
#6	TIME LIMIT EXCEEDED	--	details
#7	ACCEPTED	0.08 s	details
#8	TIME LIMIT EXCEEDED	--	details
#9	ACCEPTED	0.07 s	details
#10	ACCEPTED	0.05 s	details
#11	ACCEPTED	0.12 s	details
#12	TIME LIMIT EXCEEDED	--	details
#13	ACCEPTED	0.06 s	details
#14	TIME LIMIT EXCEEDED	--	details
#15	ACCEPTED	0.06 s	details
#16	TIME LIMIT EXCEEDED	--	details
#17	ACCEPTED	0.06 s	details
#18	TIME LIMIT EXCEEDED	--	details
#19	ACCEPTED	0.06 s	details
#20	TIME LIMIT EXCEEDED	--	details
#21	ACCEPTED	0.06 s	details
#22	TIME LIMIT EXCEEDED	--	details
#23	ACCEPTED	0.05 s	details
#24	TIME LIMIT EXCEEDED	--	details
#25	ACCEPTED	0.09 s	details

Code

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

int ans = 999999999;
int n, m, k;
int ay, ax, by, bx;
char c[101][101];
vector<pair<int, int>> koliket;

// O(k)
inline void brute (const int x, const int y, vector<pair<int, int>> v, const int sum, int keratty) {
	//cout<<x<<" "<<y<<endl;
	if (count(v.begin(), v.end(), make_pair(x, y))) return;
	v.push_back(make_pair(x, y));
	
	queue<pair<int, int>> q;
	q.push(make_pair(x, y));
	
	int lol[n][m];
	for (int y = 0; y < n; y++) {
		for (int x = 0; x < m; x++) lol[y][x] = 888888888;
	}
	lol[y][x] = 0;
	
	while (!q.empty()) {
		pair<int, int> p = q.front();
		q.pop();
		int tx = p.first;
		int ty = p.second;
		
		if (ty > 0) {
			if (c[ty - 1][tx] != '#' && lol[ty - 1][tx] - 1 > lol[ty][tx]) {
				lol[ty - 1][tx] = lol[ty][tx] + 1;
				q.push(make_pair(tx, ty - 1));
			}
		}
		if (tx > 0) {
			if (c[ty][tx - 1] != '#' && lol[ty][tx-1] - 1 > lol[ty][tx]) {
				lol[ty][tx-1] = lol[ty][tx] + 1;
				q.push(make_pair(tx-1, ty));
			}
		}
		if (ty < n - 1) {
			if (c[ty + 1][tx] != '#' && lol[ty + 1][tx] - 1 > lol[ty][tx]) {
				lol[ty + 1][tx] = lol[ty][tx] + 1;
				q.push(make_pair(tx, ty + 1));
			}
		}
		if (tx < m - 1) {
			if (c[ty][tx + 1] != '#' && lol[ty][tx + 1] - 1 > lol[ty][tx]) {
				lol[ty][tx + 1] = lol[ty][tx] + 1;
				q.push(make_pair(tx + 1, ty));
			}
		}
	}
	/*for (int y = 0; y < n; y++) {
		for (int x = 0; x < m; x++) {
			cout<<lol[y][x]<<" ";
		}
		cout<<endl;
	}
	cout<<"==========="<<endl;*/
	
	if (keratty == k) {
		ans = min(ans, sum + lol[by][bx]);
		return;
	} else {
		for (pair<int, int> p : koliket) {
			brute(p.first, p.second, v, sum + lol[p.second][p.first], keratty + 1);
		}
	}
}

int main()
{
	cin.sync_with_stdio(false);	

	cin>>n>>m>>k;
	
	for (int y = 0; y < n; y++) {
		for (int x = 0; x < m;x++) {
			cin>>c[y][x];
			if (c[y][x] == 'A') {
				ay = y;
				ax = x;
				c[y][x] = '.';
			} else if (c[y][x] == 'B') {
				by = y;
				bx = x;
				c[y][x] = '.';
			} else if (c[y][x] == '*') {
				koliket.push_back(make_pair(x, y));
			}
		}
	}
	
	vector<pair<int, int>> v;
	brute(ax, ay, v, 0, 0);
	
	cout<<ans<<endl;
	
	return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
`84 87 2 ##############################...` view save

correct output
`104` view save

user output
`104` view save

Test 2

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 ##############################...` view save

correct output
`264` view save

user output
(empty)

Test 3

Verdict: ACCEPTED

input
`26 51 1 ##############################...` view save

correct output
`48` view save

user output
`48` view save

Test 4

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 ##############################...` view save

correct output
`145` view save

user output
(empty)

Test 5

Verdict: ACCEPTED

input
`68 50 7 ##############################...` view save

correct output
`88` view save

user output
`88` view save

Test 6

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 ##############################...` view save

correct output
`187` view save

user output
(empty)

Test 7

Verdict: ACCEPTED

input
`61 79 6 ##############################...` view save

correct output
`149` view save

user output
`149` view save

Test 8

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 ##############################...` view save

correct output
`232` view save

user output
(empty)

Test 9

Verdict: ACCEPTED

input
`94 27 6 ########################### ########################### ########################### #############.############# ...` view save

correct output
`82` view save

user output
`82` view save

Test 10

Verdict: ACCEPTED

input
`100 100 0 ##############################...` view save

correct output
`30` view save

user output
`30` view save

Test 11

Verdict: ACCEPTED

input
`65 100 6 ######.#######################...` view save

correct output
`233` view save

user output
`233` view save

Test 12

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 ##############################...` view save

correct output
`209` view save

user output
(empty)

Test 13

Verdict: ACCEPTED

input
`75 18 3 ################## ################## ################## ################## ...` view save

correct output
`72` view save

user output
`72` view save

Test 14

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 ##############################...` view save

correct output
`196` view save

user output
(empty)

Test 15

Verdict: ACCEPTED

input
`62 4 3 ###. #### #### #### ...` view save

correct output
`44` view save

user output
`44` view save

Test 16

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 ##############################...` view save

correct output
`231` view save

user output
(empty)

Test 17

Verdict: ACCEPTED

input
`15 4 0 ###. .### #### #.#. ...` view save

correct output
`4` view save

user output
`4` view save

Test 18

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 ##############################...` view save

correct output
`300` view save

user output
(empty)

Test 19

Verdict: ACCEPTED

input
`86 15 2 .########....## #########...... #########...... #########...... ...` view save

correct output
`88` view save

user output
`88` view save

Test 20

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 ##############################...` view save

correct output
`288` view save

user output
(empty)

Test 21

Verdict: ACCEPTED

input
`51 90 3 .................................` view save

correct output
`103` view save

user output
`103` view save

Test 22

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 .................................` view save

correct output
`352` view save

user output
(empty)

Test 23

Verdict: ACCEPTED

input
`22 91 4 .................................` view save

correct output
`128` view save

user output
`128` view save

Test 24

Verdict: TIME LIMIT EXCEEDED

input
`100 100 8 .................................` view save

correct output
`317` view save

user output
(empty)

Test 25

Verdict: ACCEPTED

input
`49 42 6 .................................` view save

correct output
`175` view save

user output
`175` view save

KILO 2015 5/5

Mission

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Tasks

Submissions (Team Purkka)