oj.uz

답안 #224173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224173 2020-04-17T11:03:18 Z Haunted_Cpp Nautilus (BOI19_nautilus) C++17
0 / 100
 1000 ms 4864 KB 
#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 R = 100 + 5;
const int M = 100 + 5;

int r, c, m;
int dp [R][R][M];
char g [R][R];

string w;

int dfs (int linha, int coluna, int comando) {
  assert (g[linha][coluna] != '#');
  if (comando >= m) return true;
  int &res = dp[linha][coluna][comando];
  if (~res) return res;
  res = 0;
  F0R (i, 4) {
    if (w[comando] != '?') if (w[comando] != dir[i]) continue;
    if (linha + dr[i] < 0 || linha + dr[i] >= r || coluna + dc[i] < 0 || coluna + dc[i] >= c) continue;
    if (g[linha + dr[i]][coluna + dc[i]] == '#') continue;
    res |= dfs (linha + dr[i], coluna + dc[i], comando + 1);
  }

  return res;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
 // F0R (i, R) F0R (j, R) dp[i][j] = 1e9;
  cin >> r >> c >> m;
  F0R (i, r) F0R (j, c) cin >> g[i][j];
  cin >> w;
  reverse(all(w));
  
  F0R (i, m) {
    if (w[i] == '?') continue;
    if (w[i] == 'N') w[i] = 'S';
    else if (w[i] == 'S') w[i] = 'N';
    else if (w[i] == 'E') w[i] = 'W';
    else w[i] = 'E';
  }

  int res = 0;
  
  F0R (i, r) {
    F0R (j, c) {
      if (g[i][j] == '#') continue;
      memset (dp, -1, sizeof(dp));
      if (dfs (i, j, 0)) {
        ++res;
      }
    }
  }
  cout << res << '\n';
  return 0;
}

Subtask #1
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1079 ms 4864 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1079 ms 4864 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1079 ms 4864 KB Time limit exceeded
2 Halted 0 ms 0 KB -