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-02 19:56:0247
Task:Tontti
Sender:Ollie
Submission time:2015-10-02 19:56:02
Language:C++
Status:READY
Score:47

Feedback

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

Test results

testverdicttime (s)group
#1ACCEPTED0.05 / 1.001details
#2ACCEPTED0.04 / 1.001details
#3ACCEPTED0.05 / 1.001details
#4ACCEPTED0.07 / 1.001details
#5ACCEPTED0.05 / 1.001details
#6ACCEPTED0.28 / 1.002details
#7ACCEPTED0.29 / 1.002details
#8ACCEPTED0.28 / 1.002details
#9ACCEPTED0.28 / 1.002details
#10ACCEPTED0.28 / 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

Compiler report

input/code.cpp: In function 'int gets(int, int, int, int)':
input/code.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Code

#include <bits/stdc++.h>

#define _ ios_base::sync_with_stdio(0);cin.tie();
#define mp make_pair
#define pb push_back

#define ll long long
#define pii pair<int,int>
#define vpii vector<pii>
#define vi vector<int>

#define INF 9223372036854775807LL
#define N 2000

using namespace std;

int val[N+1][N+1];
int sum[N+1][N+1];

int gets(int x1, int y1, int x2, int y2) {
    if(x1==0&&y1==0) return sum[x2][y2];
    if(x1==0&&y1>0) return sum[x2][y2]-sum[x2][y1-1];
    if(x1>0&&y1==0) return sum[x2][y2]-sum[x1-1][y2];
    if(x1>0&&y1>0) return sum[x2][y2]-sum[x1-1][y2]-sum[x2][y1-1]+sum[x1-1][y1-1];
}

int main() { _

    int n,m,trees;
    cin >> n >> m >> trees;

    for(int y=0;y<n;y++) {
        for(int x=0;x<m;x++) {
            int rv;
            char c; cin >> c;
            if(c=='*') rv=1;
            else rv=0;
            if(x==0) sum[0][y] = (y>0 ? sum[0][y-1]+rv : rv);
            if(y==0) sum[x][0] = (x>0 ? sum[x-1][0]+rv : rv);
            if(x>0&&y>0) sum[x][y] = sum[x-1][y]+sum[x][y-1]-sum[x-1][y-1]+rv;
        }
    }

    int c=0;

    for(int w=1;w<=min(n,m);w++)
        for(int y=w-1;y<n;y++)
            for(int x=w-1;x<m;x++)
                if(gets(x-w+1, y-w+1, x, y)==trees) c++;

    cout << c << 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)