oj.uz

답안 #659096

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
659096 2022-11-16T14:07:17 Z Soul234 Nautilus (BOI19_nautilus) C++14
100 / 100
 136 ms 716 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
#define fi first
#define se second

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
using db = long double;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;
const ll INF = 1e18;

const int MX = 505;

int R, C, M;

bitset<MX> grid[MX];
str sgn;

bitset<MX> vis[2][MX];

void solve() {
    cin >> R >> C >> M;
    F0R(i, R) {
        str s;
        cin >> s;
        grid[i] = bitset<MX>(s, 0, sz(s), '#', '.');
        vis[1][i] = grid[i];

    }
    cin >> sgn;
    int ans = 0;
    F0R(step, sz(sgn)) {
        int cur = step&1, pre = cur^1;
        F0R(i, R) vis[cur][i].reset();
        F0R(i, R) {
            if(sgn[step] == 'N' || sgn[step] == '?') {
                if(i+1<R) {
                    vis[cur][i] |= vis[pre][i+1] & grid[i];
                }
            }
            if(sgn[step] == 'E' || sgn[step] == '?') {
                vis[cur][i] |= (vis[pre][i]>>1) & grid[i];
            }
            if(sgn[step] == 'W' || sgn[step] == '?') {
                vis[cur][i] |= (vis[pre][i]<<1) & grid[i];
            }
            if(sgn[step] == 'S' || sgn[step] == '?') {
                if(i > 0) vis[cur][i] |= (vis[pre][i-1]) & grid[i];
            }
        }
        if(step == sz(sgn)-1) {
            F0R(i, R) ans += vis[cur][i].count();
        }
    }
    cout << ans << nl;

}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

nautilus.cpp: In function 'void setIO(std::string)':
nautilus.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 72 ms 428 KB Output is correct
23 Correct 67 ms 672 KB Output is correct
24 Correct 67 ms 672 KB Output is correct
25 Correct 67 ms 676 KB Output is correct
26 Correct 66 ms 668 KB Output is correct
27 Correct 101 ms 668 KB Output is correct
28 Correct 112 ms 700 KB Output is correct
29 Correct 106 ms 596 KB Output is correct
30 Correct 110 ms 668 KB Output is correct
31 Correct 101 ms 672 KB Output is correct
32 Correct 128 ms 676 KB Output is correct
33 Correct 129 ms 596 KB Output is correct
34 Correct 136 ms 676 KB Output is correct
35 Correct 135 ms 716 KB Output is correct
36 Correct 133 ms 668 KB Output is correct