CSES - KILO 2017 1/5

Submission details
Task:	Turrets
Sender:	Semikolonisti
Submission time:	2017-09-05 18:08:12 +0300
Language:	C++
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.03 s	details
#2	ACCEPTED	0.04 s	details
#3	ACCEPTED	0.02 s	details
#4	ACCEPTED	0.05 s	details
#5	ACCEPTED	0.04 s	details
#6	ACCEPTED	0.04 s	details
#7	ACCEPTED	0.04 s	details
#8	ACCEPTED	0.04 s	details
#9	ACCEPTED	0.05 s	details
#10	ACCEPTED	0.06 s	details
#11	ACCEPTED	0.03 s	details
#12	ACCEPTED	0.04 s	details
#13	ACCEPTED	0.04 s	details
#14	ACCEPTED	0.04 s	details
#15	ACCEPTED	0.05 s	details
#16	ACCEPTED	0.10 s	details
#17	ACCEPTED	0.08 s	details
#18	ACCEPTED	0.05 s	details
#19	ACCEPTED	0.04 s	details
#20	ACCEPTED	0.05 s	details
#21	ACCEPTED	0.03 s	details
#22	ACCEPTED	0.08 s	details
#23	ACCEPTED	0.07 s	details
#24	ACCEPTED	0.06 s	details
#25	ACCEPTED	0.05 s	details
#26	ACCEPTED	0.05 s	details
#27	ACCEPTED	0.04 s	details
#28	ACCEPTED	0.05 s	details
#29	ACCEPTED	0.05 s	details
#30	ACCEPTED	0.06 s	details
#31	ACCEPTED	0.05 s	details
#32	ACCEPTED	0.05 s	details
#33	ACCEPTED	0.04 s	details
#34	ACCEPTED	0.06 s	details
#35	ACCEPTED	0.03 s	details

Code

#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define M 1000000007
#define pii pair<int, int>

using namespace std;

int v[1111][1111];
int n, m;
bool b[1111][1111][2];
int s[1111];
int c;

void dfs (int y, int x, int d) {
    if (x < 0 || y < 0 || x == m || y == n) return;
    if (d == -1) {
        b[y][x][0] = b[y][x][1] = 1;
        s[c]++;
        dfs(y, x + 1, 0);
        dfs(y, x - 1, 0);
        dfs(y + 1, x, 1);
        dfs(y - 1, x, 1);
        return;
    }
    if (b[y][x][d]) return;
    
    if (v[y][x]) {
        s[c]++;
        b[y][x][0] = b[y][x][1] = 1;
        dfs(y, x + 1, 0);
        dfs(y, x - 1, 0);
        dfs(y + 1, x, 1);
        dfs(y - 1, x, 1);
        return;
    }
    
    b[y][x][d] = 1;
    
    if (d == 0) {
        dfs(y, x + 1, d);
        dfs(y, x - 1, d);
    } else {
        dfs(y + 1, x, d);
        dfs(y - 1, x, d);
    }
}

int main () {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            char c;
            cin>>c;
            if (c == '+') {
                v[i][j] = 1;
            }
        }
    }
    
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (v[i][j] && !b[i][j][0]) {
                dfs(i, j, -1);
                c++;
            }
        }
    }
    sort(s, s + c);
    if (c == 0) cout<<0<<endl;
    else if (c == 1) cout<<s[0]<<endl;
    else cout<<s[c - 1] + s[c - 2]<<endl;
}

Test details

Test 1

Verdict: ACCEPTED

input
`10 1 . . + . ...` view save

correct output
`2` view save

user output
`2` view save

Test 2

Verdict: ACCEPTED

input
`3 7 .+++.++ .+..++. +++++..` view save

correct output
`13` view save

user output
`13` view save

Test 3

Verdict: ACCEPTED

input
`8 4 .++. .... +..+ +.+. ...` view save

correct output
`11` view save

user output
`11` view save

Test 4

Verdict: ACCEPTED

input
`9 1 . . . . ...` view save

correct output
`2` view save

user output
`2` view save

Test 5

Verdict: ACCEPTED

input
`5 2 +. .. .. .. ...` view save

correct output
`1` view save

user output
`1` view save

Test 6

Verdict: ACCEPTED

input
`6 7 ....... ....... ....... ....... ...` view save

correct output
`0` view save

user output
`0` view save

Test 7

Verdict: ACCEPTED

input
`7 10 .......... .......... .......... .......... ...` view save

correct output
`0` view save

user output
`0` view save

Test 8

Verdict: ACCEPTED

input
`691 215 .................................` view save

correct output
`18` view save

user output
`18` view save

Test 9

Verdict: ACCEPTED

input
`911 7 ..++..+ ++...+. +.++.+. .++.++. ...` view save

correct output
`3195` view save

user output
`3195` view save

Test 10

Verdict: ACCEPTED

input
`873 476 .................................` view save

correct output
`517` view save

user output
`517` view save

Test 11

Verdict: ACCEPTED

input
`120 184 ..................+..............` view save

correct output
`12` view save

user output
`12` view save

Test 12

Verdict: ACCEPTED

input
`944 46 .................................` view save

correct output
`4` view save

user output
`4` view save

Test 13

Verdict: ACCEPTED

input
`93 576 .................................` view save

correct output
`5` view save

user output
`5` view save

Test 14

Verdict: ACCEPTED

input
`360 409 .................................` view save

correct output
`0` view save

user output
`0` view save

Test 15

Verdict: ACCEPTED

input
`1000 447 .................................` view save

correct output
`14` view save

user output
`14` view save

Test 16

Verdict: ACCEPTED

input
`1000 590 ++.+...++++++......+..++..++.+...` view save

correct output
`295234` view save

user output
`295234` view save

Test 17

Verdict: ACCEPTED

input
`1000 592 .................................` view save

correct output
`764` view save

user output
`764` view save

Test 18

Verdict: ACCEPTED

input
`1000 14 .............. .............. .............. .............. ...` view save

correct output
`4` view save

user output
`4` view save

Test 19

Verdict: ACCEPTED

input
`1000 65 .................................` view save

correct output
`4` view save

user output
`4` view save

Test 20

Verdict: ACCEPTED

input
`1000 401 .................................` view save

correct output
`2` view save

user output
`2` view save

Test 21

Verdict: ACCEPTED

input
`1000 101 .................................` view save

correct output
`0` view save

user output
`0` view save

Test 22

Verdict: ACCEPTED

input
`1000 995 .................................` view save

correct output
`24` view save

user output
`24` view save

Test 23

Verdict: ACCEPTED

input
`1000 296 .++.++.++..++.++...++...+....+...` view save

correct output
`147617` view save

user output
`147617` view save

Test 24

Verdict: ACCEPTED

input
`1000 551 .................................` view save

correct output
`839` view save

user output
`839` view save

Test 25

Verdict: ACCEPTED

input
`1000 150 .................................` view save

correct output
`11` view save

user output
`11` view save

Test 26

Verdict: ACCEPTED

input
`1000 398 .................................` view save

correct output
`9` view save

user output
`9` view save

Test 27

Verdict: ACCEPTED

input
`1000 335 .................................` view save

correct output
`4` view save

user output
`4` view save

Test 28

Verdict: ACCEPTED

input
`1000 360 .................................` view save

correct output
`0` view save

user output
`0` view save

Test 29

Verdict: ACCEPTED

input
`611 1000 .................................` view save

correct output
`19` view save

user output
`19` view save

Test 30

Verdict: ACCEPTED

input
`22 1000 .++.+.....+........+++.+++++.....` view save

correct output
`10985` view save

user output
`10985` view save

Test 31

Verdict: ACCEPTED

input
`80 1000 .......+.........................` view save

correct output
`974` view save

user output
`974` view save

Test 32

Verdict: ACCEPTED

input
`40 1000 .................................` view save

correct output
`6` view save

user output
`6` view save

Test 33

Verdict: ACCEPTED

input
`587 1000 .................................` view save

correct output
`9` view save

user output
`9` view save

Test 34

Verdict: ACCEPTED

input
`432 1000 .................................` view save

correct output
`6` view save

user output
`6` view save

Test 35

Verdict: ACCEPTED

input
`614 1000 .................................` view save

correct output
`0` view save

user output
`0` view save

KILO 2017 1/5

Turrets

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

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Tasks

Submissions (Semikolonisti)