Submission #1516703
Source Code Expand
#include <iostream>
#include <complex>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#include <functional>
#include <cstdlib>
#include <queue>
#include <tuple>
#include <map>
#include <cmath>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define DFOR(i,a) for(int i=(a);i>=0;i--)
#define SORT(v, n) sort(v, v+n)
using namespace std;
const double EPS =1e-9;
const long INF =999999999;
const long MINF =-999999999;
//Atcoder Contest 018 ProblemC
int table[501][501][4]={};
bool fn(int j,int i,int K){
if(K==2){
int r;
FOR(r,0,4) if(table[j][i][r]<K) return false;
return true;
}else{
if(fn(j-1,i,K-1)==false) return false;
if(fn(j,i-1,K-1)==false) return false;
if(fn(j+1,i,K-1)==false) return false;
if(fn(j,i+1,K-1)==false) return false;
return true;
}
}
int main(){
int i,j,R,C,K,counter=0,r;
bool flug;
string S[500];
cin>>R>>C>>K;
FOR(i,0,R) cin>>S[i];
FOR(i,0,C){
if(S[0][i]=='o') table[0][i][0]=1;
if(S[R-1][i]=='o') table[R-1][i][1]=1;
FOR(j,1,R){
if(S[j][i]=='o')
table[j][i][0]=table[j-1][i][0]+1;
else
table[j][i][0]=0;
}
DFOR(j,R-2){
if(S[j][i]=='o')
table[j][i][1]=table[j+1][i][1]+1;
else
table[j][i][1]=0;
}
}
FOR(j,0,R){
if(S[j][0]=='o') table[j][0][2]=1;
if(S[j][C-1]=='o') table[j][C-1][3]=1;
FOR(i,1,C){
if(S[j][i]=='o')
table[j][i][2]=table[j][i-1][2]+1;
else
table[j][i][2]=0;
}
DFOR(i,C-2){
if(S[j][i]=='o')
table[j][i][3]=table[j][i+1][3]+1;
else
table[j][i][3]=0;
}
}
FOR(j,0,R){
FOR(i,0,C){
if(fn(j,i,K)) counter+=1;
}
}
cout<<counter<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 菱型カウント |
User |
stnae678 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1734 Byte |
Status |
RE |
Exec Time |
112 ms |
Memory |
4480 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
0 / 30 |
0 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt |
Subtask1 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt |
Subtask2 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0-sample01.txt |
AC |
1 ms |
256 KB |
subtask0-sample02.txt |
AC |
1 ms |
256 KB |
subtask0-sample03.txt |
RE |
99 ms |
256 KB |
subtask1-01.txt |
AC |
1 ms |
256 KB |
subtask1-02.txt |
AC |
1 ms |
256 KB |
subtask1-03.txt |
RE |
97 ms |
384 KB |
subtask1-04.txt |
AC |
1 ms |
384 KB |
subtask1-05.txt |
RE |
96 ms |
512 KB |
subtask1-06.txt |
RE |
96 ms |
512 KB |
subtask1-07.txt |
RE |
97 ms |
512 KB |
subtask1-08.txt |
RE |
98 ms |
512 KB |
subtask1-09.txt |
RE |
97 ms |
512 KB |
subtask1-10.txt |
RE |
97 ms |
512 KB |
subtask1-11.txt |
RE |
97 ms |
512 KB |
subtask1-12.txt |
RE |
97 ms |
512 KB |
subtask1-13.txt |
RE |
98 ms |
512 KB |
subtask1-14.txt |
RE |
97 ms |
512 KB |
subtask1-15.txt |
RE |
97 ms |
512 KB |
subtask1-16.txt |
RE |
97 ms |
512 KB |
subtask1-17.txt |
AC |
1 ms |
512 KB |
subtask1-18.txt |
AC |
1 ms |
512 KB |
subtask1-19.txt |
RE |
99 ms |
512 KB |
subtask1-20.txt |
RE |
100 ms |
512 KB |
subtask2-01.txt |
RE |
102 ms |
2304 KB |
subtask2-02.txt |
RE |
103 ms |
2560 KB |
subtask2-03.txt |
AC |
2 ms |
1536 KB |
subtask2-04.txt |
RE |
103 ms |
2688 KB |
subtask2-05.txt |
RE |
112 ms |
4480 KB |
subtask2-06.txt |
RE |
110 ms |
4480 KB |
subtask2-07.txt |
RE |
109 ms |
4480 KB |
subtask2-08.txt |
RE |
109 ms |
4480 KB |
subtask2-09.txt |
RE |
110 ms |
4480 KB |
subtask2-10.txt |
RE |
112 ms |
4480 KB |
subtask2-11.txt |
RE |
110 ms |
4480 KB |
subtask2-12.txt |
RE |
109 ms |
4480 KB |
subtask2-13.txt |
RE |
110 ms |
4480 KB |
subtask2-14.txt |
AC |
16 ms |
4480 KB |
subtask2-15.txt |
RE |
111 ms |
4480 KB |
subtask2-16.txt |
RE |
111 ms |
4480 KB |
subtask2-17.txt |
RE |
111 ms |
4480 KB |
subtask2-18.txt |
RE |
111 ms |
4480 KB |
subtask2-19.txt |
RE |
111 ms |
4480 KB |
subtask2-20.txt |
RE |
111 ms |
4480 KB |