oj.uz

Submission #577927

# Submission time Handle Problem Language Result Execution time Memory
577927 2022-06-15T13:15:43 Z Sam_a17 Nautilus (BOI19_nautilus) C++14
66 / 100
 593 ms 262144 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;

#pragma GCC optimize("Ofast")

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());

#define pb push_back
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }

  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 5e2 + 10, M = 5e3 + 10;
int n, m, k;
char A[N][N];
bool dp[M][N][N];
unordered_map<char, int> mp;

void solve_() {
  cin >> n >> m >> k;
  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= m; j++) {
      cin >> A[i][j];
    }
  }

  string signal; cin >> signal;

  int answ = 0;
  for(int i = 0; i <= k; i++) {
    for(int x = 1; x <= n; x++) {
      for(int y = 1; y <= m; y++) {
        if(A[x][y] == '#') {
          continue;
        }

        if(i == 0) {
          dp[i][x][y] = 1;
        } else {
          if(signal[i - 1] == 'W') {
            dp[i][x][y] = dp[i - 1][x][y + 1];
          } else if(signal[i - 1] == 'E') {
            dp[i][x][y] = dp[i - 1][x][y - 1];
          } else if(signal[i - 1] == 'S') {
            dp[i][x][y] = dp[i - 1][x - 1][y];
          }  else if(signal[i - 1] == 'N') {
            dp[i][x][y] = dp[i - 1][x + 1][y];
          }  else if(signal[i - 1] == '?') {
            if(dp[i - 1][x][y - 1] || dp[i - 1][x][y + 1]) {
              dp[i][x][y] = true;
            }
            
            if(dp[i - 1][x - 1][y] || dp[i - 1][x + 1][y]) {
              dp[i][x][y] = true;
            }
          } 
        }
      }
    }
  }

  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= m; j++) {
      if(dp[k][i][j]) {
        answ++;
      }
    }
  }

  printf("%d\n", answ);
}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

nautilus.cpp: In function 'void setIO(std::string)':
nautilus.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5588 KB Output is correct
2 Correct 6 ms 5588 KB Output is correct
3 Correct 7 ms 5588 KB Output is correct
4 Correct 7 ms 5588 KB Output is correct
5 Correct 5 ms 5588 KB Output is correct
6 Correct 2 ms 1364 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5588 KB Output is correct
2 Correct 6 ms 5588 KB Output is correct
3 Correct 7 ms 5588 KB Output is correct
4 Correct 7 ms 5588 KB Output is correct
5 Correct 5 ms 5588 KB Output is correct
6 Correct 2 ms 1364 KB Output is correct
7 Correct 5 ms 5684 KB Output is correct
8 Correct 8 ms 5588 KB Output is correct
9 Correct 8 ms 5260 KB Output is correct
10 Correct 6 ms 4180 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 5 ms 5588 KB Output is correct
13 Correct 8 ms 5572 KB Output is correct
14 Correct 11 ms 5588 KB Output is correct
15 Correct 5 ms 5204 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 5 ms 5588 KB Output is correct
18 Correct 9 ms 5568 KB Output is correct
19 Correct 8 ms 5588 KB Output is correct
20 Correct 6 ms 5588 KB Output is correct
21 Correct 2 ms 1236 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5588 KB Output is correct
2 Correct 6 ms 5588 KB Output is correct
3 Correct 7 ms 5588 KB Output is correct
4 Correct 7 ms 5588 KB Output is correct
5 Correct 5 ms 5588 KB Output is correct
6 Correct 2 ms 1364 KB Output is correct
7 Correct 5 ms 5684 KB Output is correct
8 Correct 8 ms 5588 KB Output is correct
9 Correct 8 ms 5260 KB Output is correct
10 Correct 6 ms 4180 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 5 ms 5588 KB Output is correct
13 Correct 8 ms 5572 KB Output is correct
14 Correct 11 ms 5588 KB Output is correct
15 Correct 5 ms 5204 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 5 ms 5588 KB Output is correct
18 Correct 9 ms 5568 KB Output is correct
19 Correct 8 ms 5588 KB Output is correct
20 Correct 6 ms 5588 KB Output is correct
21 Correct 2 ms 1236 KB Output is correct
22 Runtime error 593 ms 262144 KB Execution killed with signal 9
23 Halted 0 ms 0 KB -