oj.uz

Submission #125536

# Submission time Handle Problem Language Result Execution time Memory
125536 2019-07-05T17:25:25 Z The_Wolfpack Nautilus (BOI19_nautilus) C++14
29 / 100
 10 ms 1532 KB 
#include <bits/stdc++.h>
using namespace std;

int r,c,m;
char a[105][105];
string s;

bool dp[105][105][105];

int main()
{
    ios_base::sync_with_stdio(false);
    cin>>r>>c>>m;
    for(int i=0;i<r;i++) for(int j=0;j<c;j++) cin>>a[i][j];
    cin>>s;
    memset(dp, false, sizeof(dp));
    for(int i=0;i<r;i++) for(int j=0;j<c;j++) if(a[i][j]=='.') dp[0][i][j]=true;

    for(int t=1;t<=m;t++)
    {
        char sad=s[t-1];
        for(int i=0;i<r;i++)
        {
            for(int j=0;j<c;j++)
            {
                if(a[i][j]=='#') continue;
                if((sad=='N' || sad=='?') && i+1<r) dp[t][i][j]=dp[t-1][i+1][j];
                if((sad=='S' || sad=='?') && i-1>=0) dp[t][i][j]=dp[t-1][i-1][j];
                if((sad=='W' || sad=='?') && j+1<c) dp[t][i][j]=dp[t-1][i][j+1];
                if((sad=='E' || sad=='?') && j-1>=0) dp[t][i][j]=dp[t-1][i][j-1];
            }
        }
    }
    int res=0;
    for(int i=0;i<r;i++) for(int j=0;j<c;j++) res+=(dp[m][i][j]>0);
    cout<<res<<endl;
    return 0;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1400 KB Output is correct
2 Correct 8 ms 1400 KB Output is correct
3 Correct 10 ms 1532 KB Output is correct
4 Correct 10 ms 1400 KB Output is correct
5 Correct 7 ms 1400 KB Output is correct
6 Correct 4 ms 1400 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1400 KB Output is correct
2 Correct 8 ms 1400 KB Output is correct
3 Correct 10 ms 1532 KB Output is correct
4 Correct 10 ms 1400 KB Output is correct
5 Correct 7 ms 1400 KB Output is correct
6 Correct 4 ms 1400 KB Output is correct
7 Incorrect 6 ms 1400 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1400 KB Output is correct
2 Correct 8 ms 1400 KB Output is correct
3 Correct 10 ms 1532 KB Output is correct
4 Correct 10 ms 1400 KB Output is correct
5 Correct 7 ms 1400 KB Output is correct
6 Correct 4 ms 1400 KB Output is correct
7 Incorrect 6 ms 1400 KB Output isn't correct
8 Halted 0 ms 0 KB -