oj.uz

Submission #1021790

# Submission time Handle Problem Language Result Execution time Memory
1021790 2024-07-13T05:23:29 Z m5588ohammed Nautilus (BOI19_nautilus) C++14
66 / 100
 27 ms 8408 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
int n,m,p,cnt;
char arr[101][101];
int vis[101][101],dp[101][101][101];
string s;
void solve(int i,int j,int k){
    if(i>=n||j>=m||i<0||j<0||arr[i][j]=='#'||dp[i][j][k]==1) return;
    if(k==p){
        if(vis[i][j]!=1) cnt++;
        vis[i][j]=1;
        return;
    }
    dp[i][j][k]=1;
    if(s[k]=='N'||s[k]=='?') solve(i-1,j,k+1);
    if(s[k]=='S'||s[k]=='?') solve(i+1,j,k+1);
    if(s[k]=='E'||s[k]=='?') solve(i,j+1,k+1);
    if(s[k]=='W'||s[k]=='?') solve(i,j-1,k+1);
    return;
}
signed main()
{
    cin>>n>>m>>p;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++) cin>>arr[i][j];
    }
    cin>>s;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++) solve(i,j,0);
    }
    cout<<cnt<<endl;
    return 0;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8280 KB Output is correct
2 Correct 4 ms 8280 KB Output is correct
3 Correct 4 ms 8384 KB Output is correct
4 Correct 4 ms 7772 KB Output is correct
5 Correct 3 ms 5724 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8280 KB Output is correct
2 Correct 4 ms 8280 KB Output is correct
3 Correct 4 ms 8384 KB Output is correct
4 Correct 4 ms 7772 KB Output is correct
5 Correct 3 ms 5724 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 17 ms 8284 KB Output is correct
8 Correct 7 ms 8388 KB Output is correct
9 Correct 5 ms 7772 KB Output is correct
10 Correct 3 ms 5976 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 27 ms 8408 KB Output is correct
13 Correct 22 ms 8280 KB Output is correct
14 Correct 16 ms 8284 KB Output is correct
15 Correct 3 ms 5980 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 24 ms 8280 KB Output is correct
18 Correct 25 ms 8280 KB Output is correct
19 Correct 10 ms 8028 KB Output is correct
20 Correct 5 ms 6236 KB Output is correct
21 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8280 KB Output is correct
2 Correct 4 ms 8280 KB Output is correct
3 Correct 4 ms 8384 KB Output is correct
4 Correct 4 ms 7772 KB Output is correct
5 Correct 3 ms 5724 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 17 ms 8284 KB Output is correct
8 Correct 7 ms 8388 KB Output is correct
9 Correct 5 ms 7772 KB Output is correct
10 Correct 3 ms 5976 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 27 ms 8408 KB Output is correct
13 Correct 22 ms 8280 KB Output is correct
14 Correct 16 ms 8284 KB Output is correct
15 Correct 3 ms 5980 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 24 ms 8280 KB Output is correct
18 Correct 25 ms 8280 KB Output is correct
19 Correct 10 ms 8028 KB Output is correct
20 Correct 5 ms 6236 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Runtime error 3 ms 604 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -