oj.uz

답안 #796738

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796738 2023-07-28T16:37:36 Z TB_ Nautilus (BOI19_nautilus) C++17
0 / 100
 2 ms 596 KB 
#include <bits/stdc++.h>
using namespace std;
 
#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")
 
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
 
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
 
 
int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);
 
    int n, m, k;
    string val;
    cin >> n >> m >> k;
 
    bitset<250000> open;
    bitset<250000> westEastMask;
    // open.set();
    westEastMask.set();
 
    fo(i, n){
        westEastMask[i*m] = 0;
        cin >> val;
        fo(j, m){
            if(val[j] == '.') open[i*m+j] = 1;
        }
    }
    bitset<250000> bs = open;
    bitset<250000> bs2;
 
    cin >> val;
    fo(i, val.size()){
        bs2.reset();
        if(val[i] == 'N' || val[i] == '?')
            bs2 |= (bs>>m);
        if(val[i] == 'S' || val[i] == '?')
            bs2 |= (bs<<m);
        if(val[i] == 'W' || val[i] == '?')
            bs2 |= ((bs&westEastMask)>>1);
        if(val[i] == 'E' || val[i] == '?')
            bs2 |= (bs<<1)&westEastMask;
        bs2 &= open;
 
        swap(bs, bs2);
    }
    int ans = 0;
    fo(i, n*m) ans+=bs[i];
    cout << ans << "\n";
 
 
 
    _Exit(0);
}

Subtask #1
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -