oj.uz

Submission #574716

# Submission time Handle Problem Language Result Execution time Memory
574716 2022-06-09T10:06:43 Z MohammadAghil Nautilus (BOI19_nautilus) C++14
100 / 100
 338 ms 772 KB 
      #include <bits/stdc++.h>
  #pragma GCC optimize ("Ofast,unroll-loops")
#pragma GCC target ("avx2")
    using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
    #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
      #define per(i,r,l) for(int i = (r); i >= (l); i--)
        #define rep(i,l,r) for(int i = (l); i < (r); i++)
           #define all(x) x.begin(), x.end()
              #define sz(x) (int)(x).size()
                  #define pb push_back
                      #define ss second
                           #define ff first
                                   void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 1<<9, maxk = 101, lg = 21, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}

deque<bitset<maxn>> dq, tmp, e;
bitset<maxn> bs[maxn], ex;

int main(){
     cin.tie(0) -> sync_with_stdio(0); 
     int n, m, l; cin >> n >> m >> l;
     rep(i,0,n) rep(j,0,m){
          char c; cin >> c;
          bs[i][j] = c == '.';
     }
     rep(i,0,n) dq.pb(bs[i]), tmp.pb(ex);

     auto top = [&](){
          dq.pop_back();
          dq.push_front(ex);
          rep(i,0,n) dq[i] &= bs[i];
     };

     auto right = [&](){
          rep(i,0,n) dq[i] = (dq[i]>>1)&bs[i];
     };

     auto down = [&](){
          dq.pop_front();
          dq.pb(ex);
          rep(i,0,n) dq[i] &= bs[i];
     };

     auto left = [&](){
          rep(i,0,n) dq[i] = (dq[i]<<1)&bs[i];
     };

     while(l--){
          char c; cin >> c;
          if(c == 'N') down();
          if(c == 'E') left();
          if(c == 'S') top();
          if(c == 'W') right();
          if(c == '?') {
               rep(i,0,n) tmp[i].reset();
               e = dq;
               top();
               rep(i,0,n) tmp[i] |= dq[i];
               dq = e;
               right();
               rep(i,0,n) tmp[i] |= dq[i];
               dq = e;
               down();
               rep(i,0,n) tmp[i] |= dq[i];
               dq = e;
               left();
               rep(i,0,n) tmp[i] |= dq[i];
               dq = tmp;
          }
     }
     int ans = 0;
     rep(i,0,n) rep(j,0,m) ans += dq[i][j];
     cout << ans << '\n';
     return 0; 
}

Subtask #1
29.0 / 29.0

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

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 356 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 139 ms 696 KB Output is correct
23 Correct 140 ms 696 KB Output is correct
24 Correct 136 ms 696 KB Output is correct
25 Correct 141 ms 700 KB Output is correct
26 Correct 138 ms 696 KB Output is correct
27 Correct 243 ms 596 KB Output is correct
28 Correct 268 ms 772 KB Output is correct
29 Correct 247 ms 704 KB Output is correct
30 Correct 295 ms 704 KB Output is correct
31 Correct 246 ms 696 KB Output is correct
32 Correct 331 ms 700 KB Output is correct
33 Correct 327 ms 716 KB Output is correct
34 Correct 338 ms 700 KB Output is correct
35 Correct 333 ms 696 KB Output is correct
36 Correct 337 ms 700 KB Output is correct