oj.uz

Submission #1022013

# Submission time Handle Problem Language Result Execution time Memory
1022013 2024-07-13T08:59:27 Z m5588ohammed Nautilus (BOI19_nautilus) C++14
66 / 100
 488 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
int n,m,p,cnt;
char arr[501][501];
int vis[501][501],dp[501][501][501];
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||k>=500) 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 30 ms 40276 KB Output is correct
2 Correct 15 ms 32344 KB Output is correct
3 Correct 12 ms 24668 KB Output is correct
4 Correct 8 ms 16984 KB Output is correct
5 Correct 4 ms 8796 KB Output is correct
6 Correct 1 ms 604 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 40276 KB Output is correct
2 Correct 15 ms 32344 KB Output is correct
3 Correct 12 ms 24668 KB Output is correct
4 Correct 8 ms 16984 KB Output is correct
5 Correct 4 ms 8796 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 33 ms 40276 KB Output is correct
8 Correct 16 ms 25692 KB Output is correct
9 Correct 10 ms 17244 KB Output is correct
10 Correct 5 ms 8976 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 44 ms 40292 KB Output is correct
13 Correct 34 ms 34132 KB Output is correct
14 Correct 25 ms 26456 KB Output is correct
15 Correct 5 ms 9308 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 51 ms 40440 KB Output is correct
18 Correct 44 ms 34128 KB Output is correct
19 Correct 15 ms 18780 KB Output is correct
20 Correct 8 ms 10076 KB Output is correct
21 Correct 1 ms 604 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 40276 KB Output is correct
2 Correct 15 ms 32344 KB Output is correct
3 Correct 12 ms 24668 KB Output is correct
4 Correct 8 ms 16984 KB Output is correct
5 Correct 4 ms 8796 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 33 ms 40276 KB Output is correct
8 Correct 16 ms 25692 KB Output is correct
9 Correct 10 ms 17244 KB Output is correct
10 Correct 5 ms 8976 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 44 ms 40292 KB Output is correct
13 Correct 34 ms 34132 KB Output is correct
14 Correct 25 ms 26456 KB Output is correct
15 Correct 5 ms 9308 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 51 ms 40440 KB Output is correct
18 Correct 44 ms 34128 KB Output is correct
19 Correct 15 ms 18780 KB Output is correct
20 Correct 8 ms 10076 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Runtime error 488 ms 262144 KB Execution killed with signal 9
23 Halted 0 ms 0 KB -