Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2015-10-03 11:36:4647
2015-10-03 11:33:3247
2015-10-03 11:32:5414
2015-10-03 11:31:3314
2015-10-03 11:30:5414
2015-10-03 11:27:180
2015-10-03 11:24:5914
2015-10-03 11:19:4414
2015-10-03 10:50:0414
2015-10-03 10:47:1014
2015-10-03 10:44:4214
2015-10-03 10:31:4214
2015-09-29 19:15:5314
Task:Tontti
Sender:fergusq
Submission time:2015-10-03 11:36:46
Language:C++
Status:READY
Score:47

Feedback

groupverdictscore
#1ACCEPTED14
#2ACCEPTED33
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.05 / 1.001details
#2ACCEPTED0.06 / 1.001details
#3ACCEPTED0.06 / 1.001details
#4ACCEPTED0.05 / 1.001details
#5ACCEPTED0.04 / 1.001details
#6ACCEPTED0.76 / 1.002details
#7ACCEPTED0.75 / 1.002details
#8ACCEPTED0.75 / 1.002details
#9ACCEPTED0.75 / 1.002details
#10ACCEPTED0.75 / 1.002details
#11TIME LIMIT EXCEEDED-- / 1.003details
#12TIME LIMIT EXCEEDED-- / 1.003details
#13TIME LIMIT EXCEEDED-- / 1.003details
#14TIME LIMIT EXCEEDED-- / 1.003details
#15TIME LIMIT EXCEEDED-- / 1.003details

Code

#include <iostream>

using namespace std;

#define fromto(var, from, to) for (plusgoodlong var = from; var < to; var++)
#define times(k) for (plusgoodlong __xxxx__ = 0; __xxxx__ < k; __xxxx__++)
#define INF 999999999

typedef long long plusgoodlong;

int main() {
	cin.sync_with_stdio(false);
	
	int n, m, x;
	cin >> n >> m >> x;
	
	int a = 0;
	
	int k[n+1][m+1][4];
	for (int i = 1; i <= n; i++) {
		string r;
		cin >> r;
		for (int j = 1; j <= m; j++) {
			k[i][j][0] = k[i][j][1] = r[j-1] == '*' ? (long)1 : (long)0;
			if (k[i][j][0] == x) a++;
		}
	}
	
	for (int s = 2; s <= min(n,m); s++) {
		int M = INF;
		for (int X = 1; X <= m; X++) {
			for (int Y = 1; Y <= n; Y++) {
				int nyk = 1+(s+2)%3;
				int ed = 1+(s+1)%3;
				int ed2 = 1+(s+0)%3;
				k[Y][X][nyk] = 0;
				if (X >= s && Y >= s) {
					k[Y][X][nyk] = k[Y][X][0];
					long t = s > 2 ? k[Y-1][X-1][ed2] : 0;
					long z = k[Y-s+1][X-s+1][0];
					long p = k[Y-1][X][ed];
					long q = k[Y][X-1][ed];
					
					//io.println("(" + X + ", " + Y + "; " + nyk + ", " + ed + ")[" + s + "] = " +
					//	k[Y][X][nyk] + " + " + p + " + " + q + " - " + t + " + " + z + " = " +
					//	(k[Y][X][nyk]+p+q-t+z));
					k[Y][X][nyk] += p + q - t + z;
				}
				M = min(M, k[Y][X][nyk]);
				if (k[Y][X][nyk] == x) {
					a++;
				}
			}
		}
		if (M > x) break;
	}
	
	cout << a << endl; }

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
10 10 1
......*...
.......*..
*..*....*.
*....*....
...
view   save

correct output
94

view   save

user output
94

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
10 10 5
**********
**********
**********
**********
...
view   save

correct output
0

view   save

user output
0

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
10 10 10
**...*...*
*..*.**.*.
...**.*..*
*...**.*..
...
view   save

correct output
4

view   save

user output
4

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
10 10 5
****......
*.*.**..**
....*.*..*
...*.***..
...
view   save

correct output
16

view   save

user output
16

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
10 10 2
**.***..*.
...*.*....
.***.*...*
***.***..*
...
view   save

correct output
30

view   save

user output
30

view   save

Test 6

Group: 2

Verdict: ACCEPTED

input
500 500 1
.................................
view   save

correct output
9552040

view   save

user output
9552040

view   save

Test 7

Group: 2

Verdict: ACCEPTED

input
500 500 5
.................................
view   save

correct output
1536063

view   save

user output
1536063

view   save

Test 8

Group: 2

Verdict: ACCEPTED

input
500 500 25000
**...*...**..*.*..*.**.*..*.*....
view   save

correct output
288

view   save

user output
288

view   save

Test 9

Group: 2

Verdict: ACCEPTED

input
500 500 12500
**.**.*..*...*.**...*.***........
view   save

correct output
786

view   save

user output
786

view   save

Test 10

Group: 2

Verdict: ACCEPTED

input
500 500 5000
.*.*.**..*.*.**.**..*..**...*....
view   save

correct output
1763

view   save

user output
1763

view   save

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 1
.................................
view   save

correct output
489611392

view   save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 5
.................................
view   save

correct output
120725884

view   save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 400000
..*..**.**.**.*.***...**.*..**...
view   save

correct output
1849

view   save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 200000
***.*....*.*..*....**..*..*.*....
view   save

correct output
2665

view   save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 80000
**.**...*.***.**....**.*....*....
view   save

correct output
5587

view   save

user output
(empty)