oj.uz

Submission #414964

# Submission time Handle Problem Language Result Execution time Memory
414964 2021-05-31T11:21:01 Z Hideo Nautilus (BOI19_nautilus) C++17
0 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(s) s.begin(), s.end()
#define ll long long
#define fr first
#define sc second
#define pb push_back
#define mk make_pair

const int N = 507;
const int INF = 1e9 + 7;

string a[N];
string s;
int n, m, k;
bitset < 507 > dp[N][2], b[N];

main (){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        a[i] = ' ' + a[i];
        for (int j = 1; j <= m; j++){
            if (a[i][j] == '#'){

            }
            else {
                dp[i][0] ^= (1 << (j - 1));
                b[i] ^= (1 << (j - 1));
            }
        }
    }
    cin >> s;
    int cur = 0;
    for (int c = 0; c < k; c++){
        cur ^= 1;
        for (int i = 1; i <= n; i++){
            if (s[c] == 'N'){
                if (i < n)
                    swap(dp[i][cur], dp[i + 1][cur ^ 1]);
                else
                    dp[i][cur] = dp[0][0];
            }
            if (s[c] == 'W'){
                dp[i][cur] = dp[i][cur ^ 1] << 1;
            }
            if (s[c] == 'E'){
                dp[i][cur] = dp[i][cur ^ 1] >> 1;
            }
            if (s[c] == 'S'){
                dp[i][cur] = dp[i - 1][cur ^ 1];
            }
            if (s[c] == '?'){

            }
            dp[i][cur] &= b[i];
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            if (dp[i][cur][j - 1])
                ans++;
        }
    }
    cout << ans;
}

Compilation message

nautilus.cpp:19:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   19 | main (){
      | ^~~~

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 -