oj.uz

Submission #969982

# Submission time Handle Problem Language Result Execution time Memory
969982 2024-04-26T03:03:06 Z Aiperiii Nautilus (BOI19_nautilus) C++14
66 / 100
 367 ms 8028 KB 
#include <bits/stdc++.h>
#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=105;
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;
    set <pair <int,int> > v1,v2;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
            if(a[i][j]=='.')v1.insert({i,j});
        }
    }
    
    string s;cin>>s;
    s=' '+s;
    for(int x=0;x<k;x++){
        for(auto y : v1){
            int i=y.ff,j=y.ss;
            if((s[x+1]=='W' or s[x+1]=='?') && j-1>=0 && a[i][j-1]=='.')v2.insert({i,j-1});
            if((s[x+1]=='E' or s[x+1]=='?') && j+1<m && a[i][j+1]=='.')v2.insert({i,j+1});
            if((s[x+1]=='S' or s[x+1]=='?') && i+1<n && a[i+1][j]=='.')v2.insert({i+1,j});
            if((s[x+1]=='N' or s[x+1]=='?') && i-1>=0 && a[i-1][j]=='.')v2.insert({i-1,j});
        }
        swap(v1,v2);
        v2.clear();
    }
    cout<<v1.size();
}
/*
 5 9 7
 ...##....
 ..#.##..#
 ..#....##
 .##...#..
 ....#....
 WS?EE??
 */

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 1668 KB Output is correct
2 Correct 7 ms 1112 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 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 104 ms 1668 KB Output is correct
2 Correct 7 ms 1112 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 160 ms 1676 KB Output is correct
8 Correct 36 ms 1112 KB Output is correct
9 Correct 7 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 266 ms 1676 KB Output is correct
13 Correct 173 ms 1616 KB Output is correct
14 Correct 93 ms 1112 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 367 ms 1568 KB Output is correct
18 Correct 220 ms 1428 KB Output is correct
19 Correct 68 ms 856 KB Output is correct
20 Correct 19 ms 648 KB Output is correct
21 Correct 1 ms 344 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 1668 KB Output is correct
2 Correct 7 ms 1112 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 160 ms 1676 KB Output is correct
8 Correct 36 ms 1112 KB Output is correct
9 Correct 7 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 266 ms 1676 KB Output is correct
13 Correct 173 ms 1616 KB Output is correct
14 Correct 93 ms 1112 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 367 ms 1568 KB Output is correct
18 Correct 220 ms 1428 KB Output is correct
19 Correct 68 ms 856 KB Output is correct
20 Correct 19 ms 648 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Runtime error 15 ms 8028 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -