Submit

Status

Discussion / Solution

Ranklist

Back to Problems List

Description

同4466 棋盤·改

Input Format

第一行為兩個正整數 $N, M$

接下來 $N$ 行，每行有一字串 $S_{i}$

Input Limits:

$N, M \leq 10000$

$\forall i, | S_{i} | = M$

$\forall i, j, S_{i j} \in {x, o, p}$

Output Format

輸出一非負整數

Sample Input 1

3 3
ooo
oxo
ooo

Sample Output 1

Sample Input 2

4 3
opo
oxx
oxo
ooo

Sample Output 2

Sample Input 3

1 4
oppo

Sample Output 3

Hints

不要吃毒惹

Subtasks

No.	Testdata Range	Score

TopCoder

餘切

$freeh1$

User's AC Ratio

83.3% (5/6)

Tags

Mid DP

Problem Source

Testdata and Limits

No.	Time Limit (ms)	Memory Limit (VSS, KiB)	Memory Limit (RSS, KiB)	Output Limit (KiB)	Subtasks
0	3250	1000000	1000000	65536
1	3250	1000000	1000000	65536
2	3250	1000000	1000000	65536
3	3250	1000000	1000000	65536
4	3250	1000000	1000000	65536

Submit