oj.uz

Submission #125537

# Submission time Handle Problem Language Result Execution time Memory
125537 2019-07-05T17:43:57 Z The_Wolfpack Nautilus (BOI19_nautilus) C++14
0 / 100
 3 ms 1016 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;
    bitset<500> dp[m+10][r];
    bitset<500> red[r];
    for(int i=0;i<r;i++) for(int j=0;j<c;j++)
    {
        if(a[i][j]=='#')
        {
            dp[0][i][j]=0;
            red[0][i]=0;
        }
        else
        {
            dp[0][i][j]=1;
            red[0][i]=1;
        }
    }
    for(int t=1;t<=m;t++)
    {
        char sad=s[t-1];
        for(int i=0;i<r;i++)
        {
            if(sad=='W') dp[t][i]=(dp[t-1][i]>>1) & red[i]; 
            if(sad=='E') dp[t][i]=(dp[t-1][i]<<1) & red[i]; 
            if(sad=='S' && i) dp[t][i]=dp[t-1][i-1] & red[i]; 
            if(sad=='N' && i+1<r) dp[t][i]=dp[t-1][i+1] & red[i]; 
            /*else
            {
                
            }*/
        }
    }
    int res=0;
    for(int i=0;i<r;i++) res+=dp[m][i].count();
    cout<<res<<endl;
    return 0;
}

Subtask #1
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1016 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1016 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1016 KB Output isn't correct
2 Halted 0 ms 0 KB -