oj.uz

Submission #890410

# Submission time Handle Problem Language Result Execution time Memory
890410 2023-12-21T06:22:16 Z vjudge1 Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 484 KB 
#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define F first
#define S second
#define ff first
#define ss second
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll,ll>
#define plll pair<ll,pll>
#define pllll pair<pll,pll>
#define vl vector<ll>
#define vll vector<pll>
#define vlll vector<plll>
#define vllll vector<pllll>
#define vb vector<bool>
#define sz size()
#define fr front()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bk back();
using namespace std;
const ld pi=3.14159265359;
const ll e5=1e5;
const ll e6=1e6;
const ll e9=1e9;
const ll inf=1e18;
const ll mod=1e9+7;
const ll mod2=998244353;
const ll N=1e5+5;
ll bpm(ll x,ll y,ll m){if(y==0)return 1%m;if(y==1)return x%m;ll p=bpm(x,y/2,m);
if(y%2==0)return p*p%m;else return p*p%m*x%m;}
ll bp(ll x,ll y){if(y==0)return 1;if(y==1)return x;ll p=bp(x,y/2);
if(y%2==0)return p*p;else return p*p*x;}
void solve(/**/){
    ll r,c,m;
    string s;
    cin>>r>>c>>m;
    vector<bitset<500> > a(r), b(r);
    bitset<500> zr;
    for(ll i=0;i<r;i++){
        for(ll j=0;j<c;j++){
            char ch; cin>>ch;
            if(ch=='.'){
                a[i][j]=b[i][j]=(ch=='.');
            }
        }
    }
    cin>>s;
    for(char ch:s){
        if(ch=='N'){
            for(ll i=0;i<r-1;i++){
                a[i]=a[i+1];
            }
            a[r-1]=zr;
        }else if(ch=='E'){
            for(ll i=0;i<r;i++){
                a[i]<<=1;
            }
        }else if(ch=='S'){
            for(ll i=r-1;i>0;i--){
                a[i]=a[i-1];
            }
            a[0]=zr;
        }else if(ch=='W'){
            for(ll i=0;i<r;i++){
                a[i]>>=1;
            }
        }else if(ch=='?'){
            auto aa=a;
            for(ll i=0;i<r;i++){
                for(ll j=0;j<c;j++){
                    a[i][j]=0;
                    if(i>0) a[i][j]=a[i][j]|aa[i-1][j];
                    if(i<r-1) a[i][j]=a[i][j]|aa[i+1][j];
                    if(j>0) a[i][j]=a[i][j]|aa[i][j-1];
                    if(j<c-1) a[i][j]=a[i][j]|aa[i][j+1];
                }
            }
        }
        for(ll i=0;i<r;i++) a[i]&=b[i];
    }
    ll x=0;
    for(ll i=0;i<r;i++){
        for(ll j=0;j<c;j++){
            if(a[i][j]) x++;
        }
    }
    cout<<x;
    return;
}
int main(/*Aldk*/){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);    
    //cout<<setprecision(6)<<fixed;
    ll T=1;
    //cin>>T;
    for(ll i=1;i<=T;i++){
        //cout<<"Case #"<<i<<": ";
        solve();
        //cout<<'\n';
    }
    return 0;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 476 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 6 ms 348 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 5 ms 480 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Correct 7 ms 348 KB Output is correct
19 Correct 8 ms 484 KB Output is correct
20 Correct 9 ms 348 KB Output is correct
21 Correct 6 ms 348 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 476 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 6 ms 348 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 5 ms 480 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Correct 7 ms 348 KB Output is correct
19 Correct 8 ms 484 KB Output is correct
20 Correct 9 ms 348 KB Output is correct
21 Correct 6 ms 348 KB Output is correct
22 Execution timed out 1049 ms 348 KB Time limit exceeded
23 Halted 0 ms 0 KB -