oj.uz

Submission #565131

# Submission time Handle Problem Language Result Execution time Memory
565131 2022-05-20T10:29:51 Z zaneyu Nautilus (BOI19_nautilus) C++14
100 / 100
 59 ms 460 KB 
/*input
5 9 7
...##....
..#.##..#
..#....##
.##...#..
....#....
WS?EE??
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=1e6+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=998244353;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
bitset<505> bs[505],ok[505],nbs[505];
int main(){
    int r,c,q;
    cin>>r>>c>>q;
    REP(i,r) REP(j,c){
        char x;
        cin>>x;
        if(x=='.') bs[i][j]=ok[i][j]=1;
    }
    while(q--){
        char x;
        cin>>x;
        if(x=='N'){
            REP(i,r-1) bs[i]=(bs[i+1]&ok[i]);
            bs[r-1].reset();
        }
        if(x=='S'){
            for(int i=r-1;i>=1;i--) bs[i]=(bs[i-1]&ok[i]);
            bs[0].reset();
        }
        if(x=='E'){
            REP(i,r) bs[i]=((bs[i]<<1)&ok[i]);
        }
        if(x=='W'){
            REP(i,r) bs[i]=((bs[i]>>1)&ok[i]);
        }
        if(x=='?'){
            REP(i,r){
                nbs[i].reset();
                if(i) nbs[i]|=bs[i-1];
                if(i<r-1) nbs[i]|=bs[i+1];
                nbs[i]|=(bs[i]<<1);
                nbs[i]|=(bs[i]>>1);
                nbs[i]&=ok[i];
            }
            REP(i,r) bs[i]=nbs[i];
        }
        /*REP(i,r){
            REP(j,c) cout<<bs[i][j]<<' ';
            cout<<'\n';
        }
        cout<<'\n';*/
    }
    int ans=0;
    REP(i,r) REP(j,c) ans+=bs[i][j];
    cout<<ans;
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 45 ms 344 KB Output is correct
23 Correct 43 ms 460 KB Output is correct
24 Correct 42 ms 372 KB Output is correct
25 Correct 43 ms 372 KB Output is correct
26 Correct 41 ms 340 KB Output is correct
27 Correct 55 ms 340 KB Output is correct
28 Correct 55 ms 368 KB Output is correct
29 Correct 49 ms 368 KB Output is correct
30 Correct 47 ms 340 KB Output is correct
31 Correct 51 ms 352 KB Output is correct
32 Correct 53 ms 372 KB Output is correct
33 Correct 59 ms 352 KB Output is correct
34 Correct 59 ms 372 KB Output is correct
35 Correct 55 ms 340 KB Output is correct
36 Correct 58 ms 368 KB Output is correct