oj.uz

Submission #970410

# Submission time Handle Problem Language Result Execution time Memory
970410 2024-04-26T13:37:22 Z Aiperiii Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 4448 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#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=505;
char a[N][N];
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    vector <vector <int> > v1(n,vector <int> (m)),v2(n,vector <int> (m));
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
            if(a[i][j]=='.')v1[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(!v1[i][j])continue;
                if((s[x+1]=='W' or s[x+1]=='?') && j-1>=0 && a[i][j-1]=='.')v2[i][j-1]=1;
                if((s[x+1]=='E' or s[x+1]=='?') && j+1<m && a[i][j+1]=='.')v2[i][j+1]=1;
                if((s[x+1]=='S' or s[x+1]=='?') && i+1<n && a[i+1][j]=='.')v2[i+1][j]=1;
                if((s[x+1]=='N' or s[x+1]=='?') && i-1>=0 && a[i-1][j]=='.')v2[i-1][j]=1;
            }
        }
        swap(v1,v2);
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                v2[i][j]=0;
            }
        }
    }
    int cnt=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(v1[i][j])cnt++;
        }
    }
    cout<<cnt<<"\n";
}
/*
 5 9 7
 ...##....
 ..#.##..#
 ..#....##
 .##...#..
 ....#....
 WS?EE??
 */

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 2 ms 612 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 2 ms 420 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 2 ms 612 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 4 ms 612 KB Output is correct
8 Correct 4 ms 664 KB Output is correct
9 Correct 3 ms 612 KB Output is correct
10 Correct 3 ms 612 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 5 ms 616 KB Output is correct
13 Correct 7 ms 608 KB Output is correct
14 Correct 8 ms 668 KB Output is correct
15 Correct 3 ms 612 KB Output is correct
16 Correct 2 ms 616 KB Output is correct
17 Correct 5 ms 660 KB Output is correct
18 Correct 9 ms 612 KB Output is correct
19 Correct 7 ms 668 KB Output is correct
20 Correct 3 ms 608 KB Output is correct
21 Correct 3 ms 428 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 2 ms 612 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 4 ms 612 KB Output is correct
8 Correct 4 ms 664 KB Output is correct
9 Correct 3 ms 612 KB Output is correct
10 Correct 3 ms 612 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 5 ms 616 KB Output is correct
13 Correct 7 ms 608 KB Output is correct
14 Correct 8 ms 668 KB Output is correct
15 Correct 3 ms 612 KB Output is correct
16 Correct 2 ms 616 KB Output is correct
17 Correct 5 ms 660 KB Output is correct
18 Correct 9 ms 612 KB Output is correct
19 Correct 7 ms 668 KB Output is correct
20 Correct 3 ms 608 KB Output is correct
21 Correct 3 ms 428 KB Output is correct
22 Execution timed out 1012 ms 4448 KB Time limit exceeded
23 Halted 0 ms 0 KB -