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-09 22:41:3447
2015-10-01 14:23:0147
2015-09-30 18:27:1647
2015-09-29 22:30:5714
Task:Tontti
Sender:juhoh
Submission time:2015-10-09 22:41:34
Language:C++
Status:READY
Score:47

Feedback

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

Test results

testverdicttime (s)group
#1ACCEPTED0.06 / 1.001details
#2ACCEPTED0.05 / 1.001details
#3ACCEPTED0.06 / 1.001details
#4ACCEPTED0.05 / 1.001details
#5ACCEPTED0.05 / 1.001details
#6ACCEPTED0.22 / 1.002details
#7ACCEPTED0.23 / 1.002details
#8ACCEPTED0.22 / 1.002details
#9ACCEPTED0.24 / 1.002details
#10ACCEPTED0.22 / 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 <algorithm>
#include <cmath>
#include <iostream>
#include <vector>

typedef long long int ll;

using namespace std;

const int N = 2000;

int n, m, x;
int field[N][N];
ll kertyma[N][N];

ll p(int x1_, int y1_, int x2, int y2) {
    int x1 = x1_-1;
    int y1 = y1_-1;
    int a = 0, b = 0, c = 0;
    if (x1 >= 0) {
        a = kertyma[x1][y2];
    }
    if (y1 >= 0) {
        b = kertyma[x2][y1];
    }
    if (x1 >= 0 && y1 >= 0) {
        c = kertyma[x1][y1];
    } else {
        c = 0;
    }
    return kertyma[x2][y2] + c - b - a;
}

int main() {

    cin >> m >> n >> x;

    if (n > m) {
        for (int j = 0; j < m; ++j) {
            for (int i = 0; i < n; ++i) {
                char c;
                cin >> c;
                field[i][j] = c == '*';
            }
        }
    } else {
        for (int j = 0; j < m; ++j) {
            for (int i = 0; i < n; ++i) {
                char c;
                cin >> c;
                field[j][i] = c == '*';
            }
        }
        swap(n, m);
    }

    kertyma[0][0] = field[0][0];

    for (int i = 1; i < n; ++i) {
        kertyma[i][0] = kertyma[i-1][0]+field[i][0];
    }

    for (int j = 1; j < m; ++j) {
        kertyma[0][j] = kertyma[0][j-1]+field[0][j];
    }

    for (int i = 1; i < n; ++i) {
        for (int j = 1; j < m; ++j) {
            kertyma[i][j] = field[i][j] + kertyma[i-1][j] + kertyma[i][j-1] - kertyma[i-1][j-1];
        }
    }

    ll result = 0;
    for (int s = 1; s <= m; ++s) {
        for (int i = 0; i <= n-s; ++i) {
            for (int j = 0; j <= m-s; ++j) {
                if (p(i, j, i+s-1, j+s-1) == x) {
                    ++result;
                }
            }
        }
    }

    cout << result << endl;

    return 0;
}

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)