oj.uz

답안 #224228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224228 2020-04-17T14:15:57 Z Haunted_Cpp Nautilus (BOI19_nautilus) C++17
100 / 100
 153 ms 157432 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 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.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1408 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1408 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1408 KB Output is correct
8 Correct 5 ms 1408 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 6 ms 1408 KB Output is correct
14 Correct 6 ms 1408 KB Output is correct
15 Correct 5 ms 1408 KB Output is correct
16 Correct 5 ms 1408 KB Output is correct
17 Correct 5 ms 1408 KB Output is correct
18 Correct 5 ms 1408 KB Output is correct
19 Correct 6 ms 1408 KB Output is correct
20 Correct 6 ms 1408 KB Output is correct
21 Correct 6 ms 1408 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1408 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1408 KB Output is correct
8 Correct 5 ms 1408 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 6 ms 1408 KB Output is correct
14 Correct 6 ms 1408 KB Output is correct
15 Correct 5 ms 1408 KB Output is correct
16 Correct 5 ms 1408 KB Output is correct
17 Correct 5 ms 1408 KB Output is correct
18 Correct 5 ms 1408 KB Output is correct
19 Correct 6 ms 1408 KB Output is correct
20 Correct 6 ms 1408 KB Output is correct
21 Correct 6 ms 1408 KB Output is correct
22 Correct 116 ms 157176 KB Output is correct
23 Correct 120 ms 157304 KB Output is correct
24 Correct 114 ms 157304 KB Output is correct
25 Correct 122 ms 157432 KB Output is correct
26 Correct 118 ms 157308 KB Output is correct
27 Correct 135 ms 157304 KB Output is correct
28 Correct 149 ms 157432 KB Output is correct
29 Correct 131 ms 157304 KB Output is correct
30 Correct 139 ms 157396 KB Output is correct
31 Correct 141 ms 157304 KB Output is correct
32 Correct 153 ms 157432 KB Output is correct
33 Correct 150 ms 157304 KB Output is correct
34 Correct 146 ms 157304 KB Output is correct
35 Correct 145 ms 157432 KB Output is correct
36 Correct 153 ms 157328 KB Output is correct