oj.uz

Submission #894810

# Submission time Handle Problem Language Result Execution time Memory
894810 2023-12-29T04:16:11 Z vjudge1 Nautilus (BOI19_nautilus) C++17
0 / 100
 3 ms 348 KB 
//Bismillahir-Rahmanir-Rahim
#include <bits/stdc++.h>
            
using namespace std;
         
#define flash ios_base::sync_with_stdio(0),cin.tie(0)
#define pb push_back
#define ll long long
#define ld long double
#define dbg(x) cerr << #x << " = " << x << "\n";
#define ff first
#define ss second
     
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma comment (linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
    
const long long INF = 1e9 + 7;
const long long MOD = 1e9 + 7;
const int maxn = 2e5 + 10;
const int lg = 20;

int n, m, ans, ok, sz;
char a[123][123];
string s;

void press_F_() {
	cin >> n >> m >> sz;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
	}
	cin >> s;
	s = "*" + s;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i][j] == '.') {
				int dx, dy;
				dx = i;
				dy = j;
				bool ok = 1;
				for (int k = sz; k >= 1; k--) {
					if (s[k] == 'N') {
						dx += 1;
					}
					if (s[k] == 'S') {
						dx -= 1;
					}
					if (s[k] == 'E') {
						dy += 1;
					}
					if (s[k] == 'W') {
						dy -= 1;
					}
					if (dx > n || dx < 1 || dy < 1 || dy > m || a[dx][dy] == '#') {
						ok = 0;
						break;
					}
				}
				if (ok) {
					ans++;
				}
			}
		}
	}
	cout << ans;
}
   
int main() {
    flash;
    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++) {
        press_F_();
    }
    //Respa gold 2023-2024 InshAllah
    return 0;
}
/*
Maybe not today and tomorrow, but InshAllah one day I will reach expert
*/
// g++ -std=c++17 main.cpp
// ./a.out

Subtask #1
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -