QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#383039 | #3742. 卖萌表情 | ucup-team1251 | TL | 0ms | 0kb | C++17 | 1.3kb | 2024-04-08 21:05:38 | 2024-04-08 21:05:38 |
answer
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<math.h>
#include<vector>
using namespace std;
const int N=1005;
int n,m;
char c[N][N];
int dp[N][N];
bool bi[N][N];
int cnt=0;
signed main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
cnt=0;
memset(dp,0,sizeof dp);
memset(bi,0,sizeof bi);
for(int i=0;i<n;i++)
{
scanf("%s",c[i]);
}
//1 c[i][j]=='^'&&c[i][j+2]=='^'&&c[i+1][j+1]=='v'
//2 c[i+1][j]=='v'&&c[i+1][j+2]=='v'&&c[i][j+1]=='^'
//3 c[i][j]=='<'&&c[i+2][j]=='<'&&c[i+1][j+1]=='>'
//4 c[i][j+1]=='>'&&c[i+2][j+1]=='>'&&c[i+1][j]=='<'
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(c[i][j]=='^'&&c[i][j+2]=='^'&&c[i+1][j+1]=='v'&&!bi[i][j]&&!bi[i][j+2]&&!bi[i+1][j+1])
{
bi[i][j]=bi[i][j+2]=bi[i+1][j+1]=1;
cnt++;
}
if(c[i+1][j]=='v'&&c[i+1][j+2]=='v'&&c[i][j+1]=='^'&&!bi[i+1][j]&&!bi[i+1][j+2]&&!bi[i][j+1])
{
bi[i+1][j]=bi[i+1][j+2]=bi[i][j+1]=1;
cnt++;
}
if(c[i][j]=='<'&&c[i+2][j]=='<'&&c[i+1][j+1]=='>'&&!bi[i][j]&&!bi[i+2][j]&&!bi[i+1][j+1])
{
bi[i][j]=bi[i+2][j]=bi[i+1][j+1]=1;
cnt++;
}
if(c[i][j+1]=='>'&&c[i+2][j+1]=='>'&&c[i+1][j]=='<'&&!bi[i][j+1]&&!bi[i+2][j+1]&&!bi[i+1][j])
{
bi[i][j+1]=bi[i+2][j+1]=bi[i+1][j]=1;
cnt++;
}
}
}
printf("%d\n",cnt);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Time Limit Exceeded
input:
3 10 ^>^<^^^^>^ <v^v^^v^v> <>vvvvvvvv 10 1 v ^ < < v < v > < < 5 4 <^^^ <vvv <<^> vv^v <vvv 2 9 ^^^^^^^^^ vvvvvvvvv 9 10 ^>^^<^<^<> <^<<><<<<> v^v^^<>^<^ ^<vvv<><<> <v>>><^v^> ^^^^>^^<<v v^v>v^v^<> v^vvv>v^<^ vvvvv><>v> 8 8 ^^^^<^<^ <>^<v>v^ <v<v>^v> v>v<vv<> ^<^>>v<> <v^v^<<> ^v^^>v<> <vv<vv<> 2 2 ...
output:
5 0 4 6 13 11 0 3 7 7 10 0 6 2 0 5 1 4 3 0 0 0 0 4 5 6 3 6 4 9 2 1 4 6 6 4 1 6 0 16 6 2 6 2 5 4 10 5 8 0 0 10 0 4 6 8 5 12 12 3 0 13 4 4 7 6 6 0 5 0 6 7 2 11 0 11 6 0 3 1 0 11 18 6 2 6 14 11 7 4 0 0 0 7 8 3 6 0 0 13 6 2 9 5 4 13 7 9 0 4 14 0 6 0 5 14 9 5 4 0 0 4 2 9 6 17 6 4 12 0 0 9 5 12 0 5 9 5 2 ...