제출 #679757

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
679757		Valera_Grinenko	Nautilus (BOI19_nautilus)	C++17	100 / 100	219 ms	524 KiB

nautilus

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool umin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool umax(T &a, T b) { return a < b ? (a = b, true) : false; }
void solve() {
  int r, c, m;
  cin >> r >> c >> m;
  bitset<500> kek[500], init[500];
  for(int i = 0; i < r; i++) {
    for(int j = 0; j < c; j++) {
      char cl; cin >> cl;
      init[i][j] = (cl == '.');
    }
    kek[i] = init[i];
  }
  char move;
  for(int mv = 0; mv < m; mv++) {
    cin >> move;
    if(move == 'N') {
      for(int i = 0; i + 1 < r; i++) kek[i] = (init[i] & kek[i + 1]);
      kek[r - 1].reset();
    } else if(move == 'W') {
      for(int i = 0; i < r; i++) kek[i] = (init[i] & (kek[i] >> 1));
    } else if(move == 'S') {
      for(int i = r - 1; i > 0; i--) kek[i] = (init[i] & kek[i - 1]);
      kek[0].reset();
    } else if(move == 'E') {
      for(int i = 0; i < r; i++) kek[i] = (init[i] & (kek[i] << 1));
    } else {
      bitset<500> prv; prv.reset();
      for(int i = 0; i < r; i++) {
        bitset<500> cr = kek[i];
        kek[i] = (((kek[i] << 1) | (kek[i] >> 1) | (prv) | (i + 1 < r ? kek[i + 1] : 0)) & init[i]);
        prv = cr;
      }
    }
  }
  int ans = 0;
  for(int i = 0; i < r; i++) ans += kek[i].count();
  cout << ans;
}
int main() {

  ios::sync_with_stdio(0); cin.tie(0);

  int t = 1;

  // cin >> t;

  while(t--) solve();

  return 0;
}
/*
5 9 7
...##....
..#.##..#
..#....##
.##...#..
....#....
WS?EE??

first sub
*/

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