| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1324989 | andy_vokiz | Nautilus (BOI19_nautilus) | C++20 | 2 ms | 332 KiB |
#include <bits/stdc++.h>
#define fio ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
int main()
{
fio
int r, c, m;
cin >> r >> c >> m;
int ans = 0;
vector<vector<int>> grid(r, vector<int>(c));
for(int y = 0; y < r; ++y){
for(int x = 0; x < c; ++x){
cin >> grid[x][y];
}
}
string s;
cin >> s;
for(int y = 0; y < r; ++y){
for(int x = 0; x < c; ++x){
if(grid[y][x] == '#'){
continue;
}
bool br = false;
for(int i = m-1; i >= 0; --i){
if(s[i] == 'N'){
++y;
}else if(s[i] == 'S'){
--y;
}else if(s[i] == 'E'){
--x;
}else if(s[i] == 'W'){
++x;
}else{
continue;
}
if(grid[y][x]){
br = true;
break;
}
}
if(br){
continue;
}
++ans;
}
}
cout << ans << '\n';
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
