oj.uz

답안 #203360

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203360 2020-02-20T11:02:00 Z mdn2002 Nautilus (BOI19_nautilus) C++14
29 / 100
 1000 ms 4728 KB 
#include<bits/stdc++.h>
using namespace std;
int n,m,k,xx[]={0,0,1,-1},yy[]={1,-1,0,0},a[105][105],dp[105][105][105];
char gr[105][105];
string s;
void dfs(int x,int y,int in)
{
    if(in==k)
    {
        a[x][y]=1;
        return;
    }
    if(dp[x][y][in])return;
    int tx=x,ty=y;
    if(s[in]=='E')ty++;
    else if(s[in]=='W')ty--;
    else if(s[in]=='N')tx--;
    else if(s[in]=='S')tx++;
    else
    {
        for(int i=0;i<4;i++)
        {
            tx=x+xx[i],ty=y+yy[i];
            if(0<=tx&&tx<n&&0<=ty&&ty<m&&gr[tx][ty]=='.')dfs(tx,ty,in+1);
        }
        return;
    }
    if(0<=tx&&tx<n&&0<=ty&&ty<m&&gr[tx][ty]=='.')dfs(tx,ty,in+1);
    dp[x][y][in]=1;
}
int main()
{
    cin>>n>>m>>k;
    for(int i=0;i<n;i++)cin>>gr[i];
    cin>>s;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(gr[i][j]=='.')dfs(i,j,0);
        }
    }
    int ans=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(a[i][j])ans++;
        }
    }
    cout<<ans;
}

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4728 KB Output is correct
2 Correct 9 ms 4728 KB Output is correct
3 Correct 8 ms 4600 KB Output is correct
4 Correct 8 ms 4600 KB Output is correct
5 Correct 8 ms 4088 KB Output is correct
6 Correct 5 ms 376 KB Output is correct

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4728 KB Output is correct
2 Correct 9 ms 4728 KB Output is correct
3 Correct 8 ms 4600 KB Output is correct
4 Correct 8 ms 4600 KB Output is correct
5 Correct 8 ms 4088 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 54 ms 4728 KB Output is correct
8 Correct 20 ms 4660 KB Output is correct
9 Correct 10 ms 4600 KB Output is correct
10 Correct 7 ms 2936 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Execution timed out 1086 ms 552 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4728 KB Output is correct
2 Correct 9 ms 4728 KB Output is correct
3 Correct 8 ms 4600 KB Output is correct
4 Correct 8 ms 4600 KB Output is correct
5 Correct 8 ms 4088 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 54 ms 4728 KB Output is correct
8 Correct 20 ms 4660 KB Output is correct
9 Correct 10 ms 4600 KB Output is correct
10 Correct 7 ms 2936 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Execution timed out 1086 ms 552 KB Time limit exceeded
13 Halted 0 ms 0 KB -