#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#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;
int n, m, k;
char A[N][N];
bool dp[N][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;
reverse(all(signal));
mp.reserve(8);
mp['W'] = 1;
mp['E'] = 3;
mp['N'] = 2;
mp['S'] = 0;
int answ = 0, area = n * m;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
if(A[i][j] == '#') {
area--;
continue;
}
dp[i][j][0] = 1;
queue<pair<pair<int, int>, int>> q;
vector<pair<pair<int, int>, int>> need_to_clear;
q.push({{i, j}, 0});
need_to_clear.push_back({{i, j}, 0});
while(!q.empty()) {
auto u = q.front();
q.pop();
if(u.second == k) {
++answ;
break;
}
int x = u.first.first, y = u.first.second;
if(signal[u.second] != '?') {
int dir = mp[signal[u.second]];
int nx = x + dx[dir];
int ny = y + dy[dir];
if(nx >= 1 && nx <= n && ny >= 1 && ny <= m && A[nx][ny] != '#' && !dp[nx][ny][u.second + 1]) {
dp[nx][ny][u.second + 1] = true;
need_to_clear.push_back({{nx, ny}, u.second + 1});
q.push({{nx, ny}, u.second + 1});
}
} else {
for(int i = 0; i < 4; i++) {
int nx = x + dx[i];
int ny = y + dy[i];
if(nx >= 1 && nx <= n && ny >= 1 && ny <= m && A[nx][ny] != '#' && !dp[nx][ny][u.second + 1]) {
dp[nx][ny][u.second + 1] = true;
need_to_clear.push_back({{nx, ny}, u.second + 1});
q.push({{nx, ny}, u.second + 1});
}
}
}
}
for(auto g: need_to_clear) {
dp[g.first.first][g.first.second][g.second] = false;
}
}
}
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:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
63 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:68:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
68 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
69 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
42 ms |
5592 KB |
Output is correct |
| 2 |
Correct |
8 ms |
5608 KB |
Output is correct |
| 3 |
Correct |
6 ms |
5588 KB |
Output is correct |
| 4 |
Correct |
4 ms |
5452 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4600 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
42 ms |
5592 KB |
Output is correct |
| 2 |
Correct |
8 ms |
5608 KB |
Output is correct |
| 3 |
Correct |
6 ms |
5588 KB |
Output is correct |
| 4 |
Correct |
4 ms |
5452 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4600 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Execution timed out |
1083 ms |
3892 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
42 ms |
5592 KB |
Output is correct |
| 2 |
Correct |
8 ms |
5608 KB |
Output is correct |
| 3 |
Correct |
6 ms |
5588 KB |
Output is correct |
| 4 |
Correct |
4 ms |
5452 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4600 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Execution timed out |
1083 ms |
3892 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
