Submission #224228

#	Time	Username	Problem	Language	Result	Execution time	Memory
224228		Haunted_Cpp	Nautilus (BOI19_nautilus)	C++17	100 / 100	153 ms	157432 KiB

nautilus

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <bitset>
 
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;
 
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

const int dir[] = {'S', 'N', 'E', 'W'};
 
const int N = 5e2 + 5;
const int M = 5e3 + 5;

bitset<N> dp [N][M];
bitset<N> g [N];

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int r, c, m;
  cin >> r >> c >> m;
  F0R (i, r) F0R (j, c) {
    char foo;
    cin >> foo;
    g[i][j] = (foo == '.');
    dp[i][0][j] = (foo == '.');
  }
  string w;
  cin >> w;
  FOR (comando, 1, m + 1) {
    F0R (linha, r) {
       if (w[comando - 1] == 'N' || w[comando - 1] == '?') {
          dp[linha][comando] |= (dp[linha + 1][comando - 1] & g[linha]);
       } 
       if (w[comando - 1] == 'S' || w[comando - 1] == '?') {
         if (linha - 1 >= 0) { 
          dp[linha][comando] |= (dp[linha - 1][comando - 1] & g[linha]);
         }
       }
       if (w[comando - 1] == 'E' || w[comando - 1] == '?') {
         dp[linha][comando] |= ( (dp[linha][comando - 1] << 1) & g[linha]);
       }
       if (w[comando - 1] == 'W' || w[comando - 1] == '?') {
         dp[linha][comando] |= ( (dp[linha][comando - 1] >> 1) & g[linha]);
       }
    }       
  }
  int res = 0;
  F0R (i, r) res += dp[i][m].count();
  cout << res << '\n';
  return 0;
}

• Subtask 1: 29 / 29
• Subtask 2: 37 / 37
• Subtask 3: 34 / 34