oj.uz

Submission #1022005

# Submission time Handle Problem Language Result Execution time Memory
1022005 2024-07-13T08:56:35 Z m5588ohammed Nautilus (BOI19_nautilus) C++14
66 / 100
 50 ms 48964 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[500][500],dp[500][500][701];
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>700) 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 31 ms 48468 KB Output is correct
2 Correct 16 ms 33884 KB Output is correct
3 Correct 11 ms 24988 KB Output is correct
4 Correct 8 ms 17244 KB Output is correct
5 Correct 4 ms 8992 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 31 ms 48468 KB Output is correct
2 Correct 16 ms 33884 KB Output is correct
3 Correct 11 ms 24988 KB Output is correct
4 Correct 8 ms 17244 KB Output is correct
5 Correct 4 ms 8992 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 46 ms 48964 KB Output is correct
8 Correct 17 ms 27996 KB Output is correct
9 Correct 9 ms 17756 KB Output is correct
10 Correct 5 ms 9308 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 49 ms 48888 KB Output is correct
13 Correct 37 ms 39768 KB Output is correct
14 Correct 25 ms 29268 KB Output is correct
15 Correct 6 ms 9564 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 50 ms 48880 KB Output is correct
18 Correct 48 ms 39740 KB Output is correct
19 Correct 15 ms 20060 KB Output is correct
20 Correct 7 ms 10332 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 31 ms 48468 KB Output is correct
2 Correct 16 ms 33884 KB Output is correct
3 Correct 11 ms 24988 KB Output is correct
4 Correct 8 ms 17244 KB Output is correct
5 Correct 4 ms 8992 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 46 ms 48964 KB Output is correct
8 Correct 17 ms 27996 KB Output is correct
9 Correct 9 ms 17756 KB Output is correct
10 Correct 5 ms 9308 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 49 ms 48888 KB Output is correct
13 Correct 37 ms 39768 KB Output is correct
14 Correct 25 ms 29268 KB Output is correct
15 Correct 6 ms 9564 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 50 ms 48880 KB Output is correct
18 Correct 48 ms 39740 KB Output is correct
19 Correct 15 ms 20060 KB Output is correct
20 Correct 7 ms 10332 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Runtime error 19 ms 568 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -