oj.uz

Submission #204408

# Submission time Handle Problem Language Result Execution time Memory
204408 2020-02-25T16:49:57 Z thebes Nautilus (BOI19_nautilus) C++14
100 / 100
 216 ms 764 KB 
#include <bits/stdc++.h>
#define DEBUG 1
using namespace std;

namespace output{
    void __(short x){cout<<x;}
    void __(unsigned x){cout<<x;}
    void __(int x){cout<<x;}
    void __(long long x){cout<<x;}
    void __(unsigned long long x){cout<<x;}
    void __(double x){cout<<x;}
    void __(long double x){cout<<x;}
    void __(char x){cout<<x;}
    void __(const char*x){cout<<x;}
    void __(const string&x){cout<<x;}
    void __(bool x){cout<<(x?"true":"false");}
    template<class S,class T>
    void __(const pair<S,T>&x){__(DEBUG?"(":""),__(x.first),__(DEBUG?", ":" "),__(x.second),__(DEBUG?")":"");}
    template<class T>
    void __(const vector<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const set<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const multiset<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class S,class T>
    void __(const map<S,T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    void pr(){cout<<"\n";}
    template<class S,class... T>
    void pr(const S&a,const T&...b){__(a);if(sizeof...(b))__(' ');pr(b...);}
}

using namespace output;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
typedef pair<ld,ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;

#define pb push_back
#define fox(i,x,y) for(int i=(x);i<=(y);i++)
#define foxr(i,x,y) for(int i=(y);i>=(x);i--)

const int MN = 505, MM = 5005;
bitset<MN> ok[MN], hm[MN], tmp[MN];
int R, C, M, i, j, ans, dx[]={-1,1,0,0}, dy[]={0,0,-1,1};
string s;

int main(){
    scanf("%d%d%d",&R,&C,&M);
    for(i=1;i<=R;i++){
        for(getchar(),j=1;j<=C;j++){
            char ch = getchar();
            if(ch=='.') ok[i][j]=1, hm[i][j]=1;
        }
    }
    cin >> s;
    for(char c : s){
        for(i=1;i<=R;i++) tmp[i]=ok[i],ok[i].reset();
        if(c=='W'||c=='?'){
            for(i=1;i<=R;i++) ok[i]|=(hm[i]&(tmp[i]>>1));
        }
        if(c=='E'||c=='?'){
            for(i=1;i<=R;i++) ok[i]|=(hm[i]&(tmp[i]<<1));
        }
        if(c=='N'||c=='?'){
            for(i=1;i<=R;i++) ok[i]|=(hm[i]&tmp[i+1]);
        }
        if(c=='S'||c=='?'){
            for(i=1;i<=R;i++) ok[i]|=(hm[i]&tmp[i-1]);
        }
    }
    for(i=1;i<=R;i++) ans+=ok[i].count();
    printf("%d\n",ans);
    return 0;
}

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&R,&C,&M);
     ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 130 ms 728 KB Output is correct
23 Correct 118 ms 632 KB Output is correct
24 Correct 107 ms 632 KB Output is correct
25 Correct 111 ms 720 KB Output is correct
26 Correct 113 ms 764 KB Output is correct
27 Correct 160 ms 632 KB Output is correct
28 Correct 163 ms 632 KB Output is correct
29 Correct 166 ms 760 KB Output is correct
30 Correct 168 ms 632 KB Output is correct
31 Correct 158 ms 632 KB Output is correct
32 Correct 213 ms 760 KB Output is correct
33 Correct 204 ms 632 KB Output is correct
34 Correct 215 ms 632 KB Output is correct
35 Correct 208 ms 760 KB Output is correct
36 Correct 216 ms 632 KB Output is correct