oj.uz

Submission #171551

# Submission time Handle Problem Language Result Execution time Memory
171551 2019-12-29T07:01:52 Z dndhk Nautilus (BOI19_nautilus) C++14
100 / 100
 261 ms 1308 KB 
#include <bits/stdc++.h>

#define all(v) (v).begin(), (v).end()
#define sortv(v) sort(all(v))
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define pb push_back
#define FI first
#define SE second
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define test 1
#define TEST if(test)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

const int MOD = 1000000007; // 998244353
const int INF = 2e9;
const ll INFLL = 1e18;
const int MAX_N = 500;

int N, M, Q;
string arr[MAX_N+1];
string str;
bitset<MAX_N> stage[MAX_N+1], dp[2][MAX_N+1], bt;

int main(){
	scanf("%d%d%d", &N, &M, &Q);	
	for(int i=0; i<N; i++){
		cin>>arr[i];
		for(int j=0; j<M; j++){
			if(arr[i][j]=='.'){
				stage[i][j] = 1;
				dp[0][i][j] = 1;
			}
		}
	}
	for(int i=0; i<M; i++){
		bt[i] = 1;
	}
	cin>>str;
	for(int i=0; i<Q; i++){
		if(str[i]=='N'){
			for(int i=0; i<N-1; i++){
				dp[0][i] = (stage[i] & dp[0][i+1]);
			}
			dp[0][N-1].reset();
		}else if(str[i]=='E'){
			for(int i=0; i<N; i++){
				dp[0][i] = ((dp[0][i]<<1) & stage[i]);
			}
		}else if(str[i]=='S'){
			for(int i=N; i>0; i--){
				dp[0][i] = (stage[i] & dp[0][i-1]);
			}
			dp[0][0].reset();
		}else if(str[i]=='W'){
			for(int i=0; i<N; i++){
				dp[0][i] = ((dp[0][i]>>1) & stage[i]);
			}
		}else{
			for(int i=0; i<N; i++){
				dp[1][i] = ((dp[0][i]>>1) | (dp[0][i]<<1));
				if(i!=0){
					dp[1][i] = (dp[1][i] | dp[0][i-1]);
				}if(i!=N-1){
					dp[1][i] = (dp[1][i] | dp[0][i+1]);
				}
				dp[1][i] = (dp[1][i] & stage[i]);
			}
			for(int i=0; i<N; i++){
				dp[0][i] = dp[1][i];
			}
		}
		for(int i=0; i<N; i++){
			dp[0][i] = (dp[0][i] & bt);
			//for(int j=0; j<M; j++){
			//	cout<<dp[0][i][j];
			//}cout<<endl;
			//cout<<dp[0][i].to_string()<<endl;
		}//cout<<endl;
	}
	int ans=0;
	for(int i=0; i<N; i++){
		for(int j=0; j<M; j++){
			ans+=dp[0][i][j];
		}
	}
	cout<<ans;
	return 0;
}

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &N, &M, &Q); 
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 380 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 4 ms 416 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 4 ms 376 KB Output is correct
20 Correct 4 ms 376 KB Output is correct
21 Correct 4 ms 376 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 380 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 4 ms 416 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 4 ms 376 KB Output is correct
20 Correct 4 ms 376 KB Output is correct
21 Correct 4 ms 376 KB Output is correct
22 Correct 143 ms 1236 KB Output is correct
23 Correct 144 ms 1204 KB Output is correct
24 Correct 142 ms 1308 KB Output is correct
25 Correct 143 ms 1208 KB Output is correct
26 Correct 139 ms 1272 KB Output is correct
27 Correct 206 ms 1144 KB Output is correct
28 Correct 187 ms 1272 KB Output is correct
29 Correct 207 ms 1244 KB Output is correct
30 Correct 208 ms 1272 KB Output is correct
31 Correct 205 ms 1292 KB Output is correct
32 Correct 256 ms 1216 KB Output is correct
33 Correct 256 ms 1144 KB Output is correct
34 Correct 261 ms 1272 KB Output is correct
35 Correct 255 ms 1208 KB Output is correct
36 Correct 255 ms 1276 KB Output is correct