oj.uz

Submission #242852

# Submission time Handle Problem Language Result Execution time Memory
242852 2020-06-29T12:20:15 Z oolimry Nautilus (BOI19_nautilus) C++14
0 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 505;
bitset<MAXN> cur[MAXN];
bitset<MAXN> walls[MAXN];

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	int rows, cols, K; cin >> rows >> cols >> K;
	
	for(int r = 0;r < rows;r++){
		string s; cin >> s;
		for(int c = 0;c < cols;c++){
			int bit = (s[c] == '.');
			cur[r][c] = bit;
			walls[r][c] = bit;
		}
	}
	
	string command; cin >> command;
	for(char c : command){
		
		
		if(c == 'W'){
			for(int r = 0;r < rows;r++) cur[r] <<= 1;
		}
		if(c == 'E'){
			for(int r = 0;r < rows;r++) cur[r] >>= 1;
		}
		if(c == 'N'){
			for(int r = 0;r < rows-1;r++) cur[r] = cur[r+1];
			for(int c = 0;c < cols;c++) cur[rows-1][c] = 0;
		}
		if(c == 'S'){
			for(int r = rows-1;r >= 1;r--) cur[r] = cur[r-1];
			for(int c = 0;c < cols;c++) cur[0][c] = 0;
		}
		if(c == '?'){
			assert(false);
		}
		
		
		for(int r = 0;r < rows;r++) cur[r] &= walls[r];
	}
	
	int ans = 0;
	for(int r = 0;r < rows;r++){
		for(int c = 0;c < cols;c++){
			ans += cur[r][c];
		}
	}
	
	cout << ans;
}

Subtask #1
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -