oj.uz

Submission #644912

# Submission time Handle Problem Language Result Execution time Memory
644912 2022-09-25T13:04:17 Z mychecksedad Nautilus (BOI19_nautilus) C++17
29 / 100
 18 ms 31648 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;



int n, m, k;
string s[N], t;
void solve(){
    cin >> n >> m >> k;
    for(int i = 0; i < n; ++i) cin >> s[i];
    cin >> t;
    int ans = 0;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < m; ++j){
            int x = i, y = j;
            bool ok = 1;
            for(int l = 0; l < k + 1; ++l){
                if(s[x][y] == '#'){
                    ok = 0;
                    break;
                }
                if(l == k) continue;
                if(t[l] == 'N') x--;
                else if(t[l] == 'S') x++;
                else if(t[l] == 'W') y--;
                else if(t[l] == 'E') y++;
                if(x==n||x<0||y==m||y<0){
                    ok = 0;
                    break;
                }
            }
            if(ok) ans++;
        }
    }
    cout << ans;
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:55:16: warning: unused variable 'aa' [-Wunused-variable]
   55 |     int T = 1, aa;
      |                ^~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31648 KB Output is correct
2 Correct 16 ms 31572 KB Output is correct
3 Correct 16 ms 31644 KB Output is correct
4 Correct 15 ms 31572 KB Output is correct
5 Correct 15 ms 31572 KB Output is correct
6 Correct 18 ms 31644 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31648 KB Output is correct
2 Correct 16 ms 31572 KB Output is correct
3 Correct 16 ms 31644 KB Output is correct
4 Correct 15 ms 31572 KB Output is correct
5 Correct 15 ms 31572 KB Output is correct
6 Correct 18 ms 31644 KB Output is correct
7 Incorrect 17 ms 31636 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31648 KB Output is correct
2 Correct 16 ms 31572 KB Output is correct
3 Correct 16 ms 31644 KB Output is correct
4 Correct 15 ms 31572 KB Output is correct
5 Correct 15 ms 31572 KB Output is correct
6 Correct 18 ms 31644 KB Output is correct
7 Incorrect 17 ms 31636 KB Output isn't correct
8 Halted 0 ms 0 KB -