oj.uz

Submission #420006

# Submission time Handle Problem Language Result Execution time Memory
420006 2021-06-07T21:43:56 Z ScarletS Nautilus (BOI19_nautilus) C++17
0 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 505, K = 5005;
bitset<N> dp[2][N], sea[N];
char c[N][N];
string s;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j)
        {
            cin>>c[i][j];
            dp[0][i][j]=sea[i][j]=(c[i][j]=='.');
        }
    cin>>s;
    for (auto x : s)
    {
        if (x=='N')
            for (int i=1;i<n;++i)
                dp[1][i]=dp[0][i+1]&sea[i];
        else if (x=='S')
            for (int i=2;i<=n;++i)
                dp[1][i]=dp[0][i-1]&sea[i];
        else if (x=='E')
            for (int i=1;i<=n;++i)
                dp[1][i]=(dp[0][i]>>1)&sea[i];
        else if (x=='W')
            for (int i=1;i<=n;++i)
                dp[1][i]=(dp[0][i]<<1)&sea[i];
        else
            for (int i=1;i<=n;++i)
                dp[1][i]=(dp[0][i+1]|dp[0][i-1]|(dp[0][i]>>1)|(dp[0][i]<<1))&sea[i];
        for (int i=1;i<=n;++i)
            dp[0][i]=dp[1][i];
    }
    int ans = 0;
    for (int i=1;i<=n;++i)
        ans+=dp[0][i].count();
    cout<<ans;
    return 0;
}

Subtask #1
0 / 29.0

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

Subtask #2
0 / 37.0

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

Subtask #3
0 / 34.0

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