oj.uz

Submission #1094898

# Submission time Handle Problem Language Result Execution time Memory
1094898 2024-09-30T20:10:30 Z Tymond Nautilus (BOI19_nautilus) C++17
100 / 100
 151 ms 1056 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
 
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 5e2 + 7;
char tab[MAXN][MAXN];
bitset<510> pos[MAXN];
bitset<510> prevPos[MAXN];
bitset<510> ok[MAXN];
int n, m, l;
string s;
bitset<510> puste;

void goLeft(){
    for(int i = 1; i <= n; i++){
        pos[i] >>= 1;
        pos[i] = pos[i] & ok[i];
    }
}

void goRight(){
    for(int i = 1; i <= n; i++){
        pos[i] <<= 1;
        pos[i] = pos[i] & ok[i];
    }
}

void goDown(){
    for(int i = n; i > 1; i--){
        pos[i] = pos[i - 1] & ok[i];
    }
    pos[1] = puste;
}

void goUp(){
    for(int i = 1; i < n; i++){
        pos[i] = pos[i + 1] & ok[i];
    }
    pos[n] = puste;
}

void goAll(){
    for(int i = 1; i <= n; i++){
        prevPos[i] = pos[i];
    }
    for(int i = 1; i <= n; i++){
        pos[i] = ((prevPos[i] << 1) | (prevPos[i] >> 1) | prevPos[i + 1] | prevPos[i - 1]);
        pos[i] = pos[i] & ok[i];
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> m >> l;
    for(int i = 0; i <= n + 1; i++){
        for(int j = 0; j <= m + 1; j++){
            prevPos[i][j] = pos[i][j] = 0;
            ok[i][j] = 0;
        }
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> tab[i][j];
            if(tab[i][j] == '.'){
                ok[i][j] = 1;
                pos[i][j] = 1;
            }
        }
    }

    cin >> s;
    for(int i = 0; i < l; i++){
        if(s[i] == 'W'){
            goLeft();
        }else if(s[i] == 'E'){
            goRight();
        }else if(s[i] == 'N'){
            goUp();
        }else if(s[i] == 'S'){
            goDown();
        }else{
            goAll();
        }

        /*cout << "-----\n";
        for(int j = 1; j <= n; j++){
            for(int y = 1; y <= m; y++){
                cout << pos[j][y];
            }
            cout << '\n';
        }*/
    }

    int ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(pos[i][j]){
                ans++;
            }
        }
    }
    cout << ans << '\n';

    return 0;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 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 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 424 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 424 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 78 ms 1056 KB Output is correct
23 Correct 77 ms 860 KB Output is correct
24 Correct 77 ms 860 KB Output is correct
25 Correct 76 ms 860 KB Output is correct
26 Correct 73 ms 860 KB Output is correct
27 Correct 114 ms 860 KB Output is correct
28 Correct 115 ms 856 KB Output is correct
29 Correct 122 ms 856 KB Output is correct
30 Correct 116 ms 1052 KB Output is correct
31 Correct 117 ms 1056 KB Output is correct
32 Correct 150 ms 860 KB Output is correct
33 Correct 151 ms 856 KB Output is correct
34 Correct 145 ms 860 KB Output is correct
35 Correct 151 ms 860 KB Output is correct
36 Correct 145 ms 860 KB Output is correct