Submission #306241

#	Time	Username	Problem	Language	Result	Execution time	Memory
306241		VROOM_VARUN	Nautilus (BOI19_nautilus)	C++14	100 / 100	212 ms	888 KiB

nautilus

/*
ID: varunra2
LANG: C++
TASK: nautilus
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int main() {
  // #ifndef ONLINE_JUDGE
  // freopen("nautilus.in", "r", stdin);
  // freopen("nautilus.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  int r, c, m;
  const int M = 501;
  vector<bitset<M>> bs1(M), bs2(M);
  cin >> r >> c >> m;

  string s;

  for (int i = 0; i < r; i++) {
    for (int j = 0; j < c; j++) {
      char c;
      cin >> c;
      bs1[i][j] = bs2[i][j] = (c == '.');
    }
  }

  cin >> s;

  trav(x, s) {
    if (x == 'E') {
      for (int i = 0; i < r; i++) {
        bs1[i] <<= 1;
      }
    } else if (x == 'W') {
      for (int i = 0; i < r; i++) {
        bs1[i] >>= 1;
      }
    } else if (x == 'N') {
      for (int i = 0; i < r - 1; i++) {
        bs1[i] = bs1[i + 1];
      }
      bs1[r - 1].reset();
    } else if (x == 'S') {
      for (int i = r - 1; i >= 1; i--) {
        bs1[i] = bs1[i - 1];
      }
      bs1[0].reset();
    } else {
      vector<bitset<M>> a(M), b(M);
      for (int i = 0; i < r; i++) {
        a[i] = (bs1[i] >> 1) | (bs1[i] << 1);
      }
      for (int i = 1; i < r - 1; i++) {
        b[i] |= bs1[i + 1];
        b[i] |= bs1[i - 1];
      }
      if (r > 1) {
        b[0] |= bs1[1];
        b[r - 1] |= bs1[r - 2];
      }
      for (int i = 0; i < r; i++) {
        bs1[i] = a[i] | b[i];
      }
    }
    for (int i = 0; i < r; i++) {
      bs1[i] &= bs2[i];
    }
  }

  int ret = 0;

  for (int i = 0; i < r; i++) {
    ret += bs1[i].count();
  }

  cout << ret << '\n';

  return 0;
}

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