# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
719883 | jamezzz | Nautilus (BOI19_nautilus) | C++17 | 134 ms | 716 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>
using namespace std;
#define sf scanf
#define pf printf
#define INF 1023456789
#define maxn 505
int r,c,m;
bitset<maxn> grid[maxn],pos[maxn],pos2[maxn];
int main(){
sf("%d%d%d",&r,&c,&m);
for(int i=1;i<=r;++i){
for(int j=1;j<=c;++j){
char ch;sf(" %c",&ch);
if(ch=='.'){
grid[i].set(j,1);
pos[i].set(j,1);
}
}
}
for(int i=0;i<m;++i){
char ch;sf(" %c",&ch);
for(int i=1;i<=r;++i){
pos2[i].reset();
if(ch=='W'||ch=='?'){
pos2[i]|=(pos[i]>>1)&grid[i];
}
if(ch=='E'||ch=='?'){
pos2[i]|=(pos[i]<<1)&grid[i];
}
if(ch=='N'||ch=='?'){
pos2[i]|=pos[i+1]&grid[i];
}
if(ch=='S'||ch=='?'){
pos2[i]|=pos[i-1]&grid[i];
}
}
for(int i=1;i<=r;++i)pos[i]=pos2[i];
}
int ans=0;
for(int i=1;i<=r;++i)ans+=pos[i].count();
printf("%d\n",ans);
}
/*
5 9 7
...##....
..#.##..#
..#....##
.##...#..
....#....
WS?EE??
*/
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... |