Submission #593248

#	Time	Username	Problem	Language	Result	Execution time	Memory
593248		cadmiumsky	Nautilus (BOI19_nautilus)	C++14	0 / 100	1 ms	212 KiB

nautilus

#include <bits/stdc++.h>

using namespace std;

int main() {
  int n, m, q;
  cin >> n >> m >> q;
  vector<bitset<502>> mat(n + 2), templ, temp;
  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= m; j++) {
      char ch;
      cin >> ch;
      mat[i][j] = (ch == '.'? 1 : 0);
    }
  }
  templ = mat;
  
  
  for(int tc = 0; tc < q; tc++) {
    char ch;
    cin >> ch;
    if(ch == 'W') {
      for(int i = 1; i <= n; i++)
        mat[i] = (mat[i] & (mat[i] << 1));
    }
    if(ch == 'E') {
      for(int i = 1; i <= n; i++)
        mat[i] = (mat[i] & (mat[i] >> 1));
    }
    if(ch == 'N') {
      for(int i = n; i >= 0; i--) {
        mat[i] &= mat[i - 1];
      }
      mat[0].reset();
    }
    if(ch == 'N') {
      for(int i = 1; i < n; i++) {
        mat[i] &= mat[i + 1];
      }
      mat[n].reset();
    }
    if(ch == '?') {
      temp = mat;
      for(int i = 1; i <= n; i++)
        mat[i] = (mat[i] | (mat[i] >> 1) | (mat[i] << 1) | temp[i - 1] | temp[i + 1]) & templ[i];
    }
  }
  int total = 0;
  for(int i = 0; i < n; i++) {
    total += mat[i].count();
  }
  cout << total << '\n';
}

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