# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
881801 | Requiem | Nautilus (BOI19_nautilus) | C++17 | 1010 ms | 159912 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 1000000007
#define INF 1e18
#define fi first
#define se second
#define endl "\n"
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define pi 3.14159265359
#define TASKNAME ""
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
const int MAXN = 5e2 + 9;
int n,m,k;
char c[MAXN][MAXN];
char dir[MAXN];
bitset<5002> dp[MAXN][MAXN];
main()
{
fast;
if (fopen(TASKNAME".inp","r")){
freopen(TASKNAME".inp","r",stdin);
freopen(TASKNAME".out","w",stdout);
}
cin>>n>>m>>k;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>c[i][j];
if (c[i][j] != '#') dp[i][j][0] = 1;
}
}
for(int i=1;i<=k;i++){
cin>>dir[i];
}
int i,j,t,ans=0;
for(t=0;t<k;t++){
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if (dp[i][j][t]){
if (j > 0 and dir[t+1] == 'W'){
if (c[i][j-1] == '.') dp[i][j-1][t+1] = 1;
}
if (j < m and dir[t+1] == 'E'){
if (c[i][j+1] == '.') dp[i][j+1][t+1] = 1;
}
if (i<n and dir[t+1] == 'S'){
if (c[i+1][j] == '.') dp[i+1][j][t+1] = 1;
}
if (i>1 and dir[t+1] == 'N'){
if (c[i-1][j] == '.') dp[i-1][j][t+1] = 1;
}
if (dir[t+1] == '?'){
if (j > 1 and c[i][j-1] == '.') dp[i][j-1][t+1] = 1;
if (j < m and c[i][j+1] == '.') dp[i][j+1][t+1] = 1;
if (i < n and c[i+1][j] == '.') dp[i+1][j][t+1] = 1;
if (i > 1 and c[i-1][j] == '.') dp[i-1][j][t+1] = 1;
}
}
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if (dp[i][j][k] == 1) ans++;
}
}
cout<<ans<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |