oj.uz

Submission #1022012

# Submission time Handle Problem Language Result Execution time Memory
1022012 2024-07-13T08:58:59 Z m5588ohammed Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 107228 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
int n,m,p,cnt;
char arr[501][501];
bool vis[501][501],dp[501][501][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>600) 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 7772 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7028 KB Output is correct
5 Correct 3 ms 5468 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7772 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7028 KB Output is correct
5 Correct 3 ms 5468 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 15 ms 7788 KB Output is correct
8 Correct 6 ms 9560 KB Output is correct
9 Correct 4 ms 9052 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 20 ms 9752 KB Output is correct
13 Correct 22 ms 9564 KB Output is correct
14 Correct 15 ms 9564 KB Output is correct
15 Correct 5 ms 7516 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 21 ms 7648 KB Output is correct
18 Correct 24 ms 7772 KB Output is correct
19 Correct 9 ms 7256 KB Output is correct
20 Correct 7 ms 5688 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 7772 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7028 KB Output is correct
5 Correct 3 ms 5468 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 15 ms 7788 KB Output is correct
8 Correct 6 ms 9560 KB Output is correct
9 Correct 4 ms 9052 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 20 ms 9752 KB Output is correct
13 Correct 22 ms 9564 KB Output is correct
14 Correct 15 ms 9564 KB Output is correct
15 Correct 5 ms 7516 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 21 ms 7648 KB Output is correct
18 Correct 24 ms 7772 KB Output is correct
19 Correct 9 ms 7256 KB Output is correct
20 Correct 7 ms 5688 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Execution timed out 1101 ms 107228 KB Time limit exceeded
23 Halted 0 ms 0 KB -