oj.uz

답안 #876009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876009 2023-11-21T05:02:29 Z vjudge1 Nautilus (BOI19_nautilus) C++17
100 / 100
 178 ms 158912 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif
 
int r, c, m, ans;
bitset<505> dp[505][5005], grid[505];
string s;
 
int main() {
 
	ios_base::sync_with_stdio(false);
	cin.tie(0);
 
	cin >> r >> c >> m;
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			char x; cin >> x;
			if (x == '.') {
				grid[i][j] = 1;
				dp[i][0][j] = 1;
			}
		}
	}
	cin >> s;
 
	for (int i = 1; i <= m; i++) {
		char x = s[i - 1];
		for (int j = 1; j <= r; j++) {
			if (x == 'N' || x == '?') {
				dp[j][i] |= (dp[j + 1][i - 1] & grid[j]);
			}
			if (x == 'E' || x == '?') {
				dp[j][i] |= ((dp[j][i - 1] << 1) & grid[j]);
			}
			if (x == 'W' || x == '?') {
				dp[j][i] |= ((dp[j][i - 1] >> 1) & grid[j]);
			}
			if (x == 'S' || x == '?') {
				dp[j][i] |= (dp[j - 1][i - 1] & grid[j]);
			}
		}
	}
 
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			ans += dp[i][m][j];
		}
	}
 
	cout << ans << "\n";
 
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 33116 KB Output is correct
2 Correct 5 ms 33268 KB Output is correct
3 Correct 4 ms 33116 KB Output is correct
4 Correct 4 ms 33116 KB Output is correct
5 Correct 4 ms 33116 KB Output is correct
6 Correct 4 ms 33116 KB Output is correct
7 Correct 4 ms 33116 KB Output is correct
8 Correct 4 ms 33236 KB Output is correct
9 Correct 5 ms 33116 KB Output is correct
10 Correct 4 ms 33116 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 5 ms 33116 KB Output is correct
13 Correct 4 ms 33116 KB Output is correct
14 Correct 4 ms 33268 KB Output is correct
15 Correct 4 ms 33112 KB Output is correct
16 Correct 2 ms 5468 KB Output is correct
17 Correct 4 ms 33116 KB Output is correct
18 Correct 4 ms 33244 KB Output is correct
19 Correct 4 ms 33260 KB Output is correct
20 Correct 5 ms 33116 KB Output is correct
21 Correct 2 ms 5468 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 33116 KB Output is correct
2 Correct 5 ms 33268 KB Output is correct
3 Correct 4 ms 33116 KB Output is correct
4 Correct 4 ms 33116 KB Output is correct
5 Correct 4 ms 33116 KB Output is correct
6 Correct 4 ms 33116 KB Output is correct
7 Correct 4 ms 33116 KB Output is correct
8 Correct 4 ms 33236 KB Output is correct
9 Correct 5 ms 33116 KB Output is correct
10 Correct 4 ms 33116 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 5 ms 33116 KB Output is correct
13 Correct 4 ms 33116 KB Output is correct
14 Correct 4 ms 33268 KB Output is correct
15 Correct 4 ms 33112 KB Output is correct
16 Correct 2 ms 5468 KB Output is correct
17 Correct 4 ms 33116 KB Output is correct
18 Correct 4 ms 33244 KB Output is correct
19 Correct 4 ms 33260 KB Output is correct
20 Correct 5 ms 33116 KB Output is correct
21 Correct 2 ms 5468 KB Output is correct
22 Correct 98 ms 158740 KB Output is correct
23 Correct 82 ms 158544 KB Output is correct
24 Correct 78 ms 158548 KB Output is correct
25 Correct 78 ms 158744 KB Output is correct
26 Correct 120 ms 157268 KB Output is correct
27 Correct 111 ms 158552 KB Output is correct
28 Correct 113 ms 158548 KB Output is correct
29 Correct 113 ms 158544 KB Output is correct
30 Correct 124 ms 158912 KB Output is correct
31 Correct 151 ms 157264 KB Output is correct
32 Correct 137 ms 158556 KB Output is correct
33 Correct 144 ms 158748 KB Output is correct
34 Correct 140 ms 158548 KB Output is correct
35 Correct 143 ms 158748 KB Output is correct
36 Correct 178 ms 157264 KB Output is correct