oj.uz

Submission #224227

# Submission time Handle Problem Language Result Execution time Memory
224227 2020-04-17T14:15:32 Z Haunted_Cpp Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 17468 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) {
      F0R (coluna, c) {
        F0R (i, 4) {
          if (w[comando - 1] != '?') if (w[comando - 1] != 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]] == 0) continue;
          dp[linha + dr[i]][comando][coluna + dc[i]] = (dp[linha + dr[i]][comando][coluna + dc[i]] | dp[linha][comando - 1][coluna]);
        }
      }
    }  
    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

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1536 KB Output is correct
2 Correct 15 ms 1408 KB Output is correct
3 Correct 15 ms 1408 KB Output is correct
4 Correct 15 ms 1536 KB Output is correct
5 Correct 12 ms 1408 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1536 KB Output is correct
2 Correct 15 ms 1408 KB Output is correct
3 Correct 15 ms 1408 KB Output is correct
4 Correct 15 ms 1536 KB Output is correct
5 Correct 12 ms 1408 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 16 ms 1408 KB Output is correct
8 Correct 20 ms 1536 KB Output is correct
9 Correct 21 ms 1536 KB Output is correct
10 Correct 15 ms 1536 KB Output is correct
11 Correct 10 ms 1536 KB Output is correct
12 Correct 27 ms 1408 KB Output is correct
13 Correct 22 ms 1408 KB Output is correct
14 Correct 29 ms 1400 KB Output is correct
15 Correct 18 ms 1408 KB Output is correct
16 Correct 11 ms 1408 KB Output is correct
17 Correct 22 ms 1536 KB Output is correct
18 Correct 24 ms 1408 KB Output is correct
19 Correct 30 ms 1408 KB Output is correct
20 Correct 19 ms 1408 KB Output is correct
21 Correct 11 ms 1408 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1536 KB Output is correct
2 Correct 15 ms 1408 KB Output is correct
3 Correct 15 ms 1408 KB Output is correct
4 Correct 15 ms 1536 KB Output is correct
5 Correct 12 ms 1408 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 16 ms 1408 KB Output is correct
8 Correct 20 ms 1536 KB Output is correct
9 Correct 21 ms 1536 KB Output is correct
10 Correct 15 ms 1536 KB Output is correct
11 Correct 10 ms 1536 KB Output is correct
12 Correct 27 ms 1408 KB Output is correct
13 Correct 22 ms 1408 KB Output is correct
14 Correct 29 ms 1400 KB Output is correct
15 Correct 18 ms 1408 KB Output is correct
16 Correct 11 ms 1408 KB Output is correct
17 Correct 22 ms 1536 KB Output is correct
18 Correct 24 ms 1408 KB Output is correct
19 Correct 30 ms 1408 KB Output is correct
20 Correct 19 ms 1408 KB Output is correct
21 Correct 11 ms 1408 KB Output is correct
22 Execution timed out 1083 ms 17468 KB Time limit exceeded
23 Halted 0 ms 0 KB -