oj.uz

답안 #493797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493797 2021-12-13T02:53:36 Z Haruto810198 Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 1604 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = INT_MAX;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

const int MAX = 5010;

int r, c, m;
string str;
bitset<MAX> arr[MAX], dp[MAX], newdp[MAX];
int res;

signed main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin>>r>>c>>m;
	FOR(i, 1, r, 1){
		FOR(j, 1, c, 1){
			char ch;
			cin>>ch;
			if(ch == '.') dp[i][c+1-j] = arr[i][c+1-j] = 1;
		}
	}

	cin>>str;
	for(char ch : str){
				
		FOR(i, 1, r, 1){
			newdp[i].reset();
		}
		
		if(ch == 'N'){
			FOR(i, 1, r-1, 1){
				newdp[i] |= dp[i+1] & arr[i];
			}
		}
		if(ch == 'S'){
			FOR(i, 2, r, 1){
				newdp[i] |= dp[i-1] & arr[i];
			}
		}
		if(ch == 'E'){
			FOR(i, 1, r, 1){
				newdp[i] |= (dp[i] >> 1) & arr[i];
			}
		}
		if(ch == 'W'){
			FOR(i, 1, r, 1){
				newdp[i] |= (dp[i] << 1) & arr[i];
			}
		}
		
		if(ch == '?'){
			FOR(i, 1, r-1, 1){
				newdp[i] |= dp[i+1] & arr[i];
			}
			FOR(i, 2, r, 1){
				newdp[i] |= dp[i-1] & arr[i];
			}
			
			FOR(i, 1, r, 1){
				newdp[i] |= ((dp[i] >> 1) | (dp[i] << 1)) & arr[i];
			}
		}
		
		FOR(i, 1, r, 1){
			dp[i] = newdp[i];
		}
		
	}

	FOR(i, 1, r, 1){
		FOR(j, 1, c, 1){
			res += dp[i][j];
		}
	}

	cout<<res<<'\n';
	
	return 0;

}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 3 ms 580 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 5 ms 460 KB Output is correct
11 Correct 4 ms 456 KB Output is correct
12 Correct 6 ms 460 KB Output is correct
13 Correct 6 ms 460 KB Output is correct
14 Correct 6 ms 588 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 8 ms 456 KB Output is correct
17 Correct 7 ms 460 KB Output is correct
18 Correct 7 ms 460 KB Output is correct
19 Correct 7 ms 460 KB Output is correct
20 Correct 6 ms 460 KB Output is correct
21 Correct 8 ms 460 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 3 ms 580 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 5 ms 460 KB Output is correct
11 Correct 4 ms 456 KB Output is correct
12 Correct 6 ms 460 KB Output is correct
13 Correct 6 ms 460 KB Output is correct
14 Correct 6 ms 588 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 8 ms 456 KB Output is correct
17 Correct 7 ms 460 KB Output is correct
18 Correct 7 ms 460 KB Output is correct
19 Correct 7 ms 460 KB Output is correct
20 Correct 6 ms 460 KB Output is correct
21 Correct 8 ms 460 KB Output is correct
22 Correct 893 ms 1264 KB Output is correct
23 Correct 898 ms 1604 KB Output is correct
24 Correct 903 ms 1520 KB Output is correct
25 Correct 900 ms 1508 KB Output is correct
26 Correct 854 ms 1252 KB Output is correct
27 Execution timed out 1096 ms 1504 KB Time limit exceeded
28 Halted 0 ms 0 KB -