oj.uz

Submission #969974

# Submission time Handle Problem Language Result Execution time Memory
969974 2024-04-26T02:55:41 Z Aiperiii Nautilus (BOI19_nautilus) C++14
66 / 100
 9 ms 9148 KB 
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=105;
char a[N][N];
int dp[N][N][N];
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
            if(a[i][j]=='.')dp[0][i][j]=1;
        }
    }
    string s;cin>>s;
    s=' '+s;
    for(int x=0;x<k;x++){
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                if(dp[x][i][j]){
                    if((s[x+1]=='W' or s[x+1]=='?') && j-1>=0 && a[i][j-1]=='.')dp[x+1][i][j-1]=1;
                    if((s[x+1]=='E' or s[x+1]=='?') && j+1<m && a[i][j+1]=='.')dp[x+1][i][j+1]=1;
                    if((s[x+1]=='S' or s[x+1]=='?') && i+1<n && a[i+1][j]=='.')dp[x+1][i+1][j]=1;
                    if((s[x+1]=='N' or s[x+1]=='?') && i-1>=0 && a[i-1][j]=='.')dp[x+1][i-1][j]=1;
                }
            }
        }
    }
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(dp[k][i][j])ans++;
        }
    }
    cout<<ans<<"\n";
}
/*
 5 9 7
 ...##....
 ..#.##..#
 ..#....##
 .##...#..
 ....#....
 WS?EE??
 */

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9048 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 5 ms 8796 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8680 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9048 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 5 ms 8796 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8680 KB Output is correct
7 Correct 6 ms 9148 KB Output is correct
8 Correct 5 ms 9052 KB Output is correct
9 Correct 3 ms 8736 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 6 ms 9148 KB Output is correct
13 Correct 9 ms 9100 KB Output is correct
14 Correct 9 ms 9048 KB Output is correct
15 Correct 3 ms 8796 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 6 ms 9148 KB Output is correct
18 Correct 9 ms 9084 KB Output is correct
19 Correct 8 ms 9052 KB Output is correct
20 Correct 3 ms 9052 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9048 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 5 ms 8796 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8680 KB Output is correct
7 Correct 6 ms 9148 KB Output is correct
8 Correct 5 ms 9052 KB Output is correct
9 Correct 3 ms 8736 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 6 ms 9148 KB Output is correct
13 Correct 9 ms 9100 KB Output is correct
14 Correct 9 ms 9048 KB Output is correct
15 Correct 3 ms 8796 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 6 ms 9148 KB Output is correct
18 Correct 9 ms 9084 KB Output is correct
19 Correct 8 ms 9052 KB Output is correct
20 Correct 3 ms 9052 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Runtime error 3 ms 860 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -