oj.uz

Submission #969984

# Submission time Handle Problem Language Result Execution time Memory
969984 2024-04-26T03:03:46 Z Aiperiii Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 32068 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=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;
    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 90 ms 1712 KB Output is correct
2 Correct 7 ms 1368 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 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 1712 KB Output is correct
2 Correct 7 ms 1368 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 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 158 ms 1624 KB Output is correct
8 Correct 25 ms 1116 KB Output is correct
9 Correct 6 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 279 ms 1716 KB Output is correct
13 Correct 174 ms 1472 KB Output is correct
14 Correct 99 ms 1208 KB Output is correct
15 Correct 5 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 348 ms 1744 KB Output is correct
18 Correct 217 ms 1372 KB Output is correct
19 Correct 67 ms 860 KB Output is correct
20 Correct 19 ms 600 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 90 ms 1712 KB Output is correct
2 Correct 7 ms 1368 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 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 158 ms 1624 KB Output is correct
8 Correct 25 ms 1116 KB Output is correct
9 Correct 6 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 279 ms 1716 KB Output is correct
13 Correct 174 ms 1472 KB Output is correct
14 Correct 99 ms 1208 KB Output is correct
15 Correct 5 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 348 ms 1744 KB Output is correct
18 Correct 217 ms 1372 KB Output is correct
19 Correct 67 ms 860 KB Output is correct
20 Correct 19 ms 600 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Execution timed out 1062 ms 32068 KB Time limit exceeded
23 Halted 0 ms 0 KB -