제출 #314315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
314315		shrek12357	Nautilus (BOI19_nautilus)	C++14	66 / 100	12 ms	3072 KiB

nautilus

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0); 
 
bool dp[105][105][105];
int r, c, m;
 
bool get(int x, int y, int k) {
	if (x >= r || x < 0 || y >= c || y < 0) {
		return false;
	}
	return dp[x][y][k - 1];
}
 
int main() {
	cin >> r >> c >> m;
	int grid[105][105];
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			char x;
			cin >> x;
			if (x == '.') {
				grid[i][j] = 1;
				dp[i][j][0] = true;
			}
			else {
				grid[i][j] = 0;
			}
		}
	}
	string s;
	cin >> s;
	for (int k = 1; k <= m; k++) {
		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				if (grid[i][j] == 0) {
					dp[i][j][k] = false;
					continue;
				}
				if (s[k - 1] == 'W') {
					dp[i][j][k] = get(i, j + 1, k);
				}
				if (s[k - 1] == 'E') {
					dp[i][j][k] = get(i, j - 1, k);
				}
				if (s[k - 1] == 'N') {
					dp[i][j][k] = get(i + 1, j, k);
				}
				if (s[k - 1] == 'S') {
					dp[i][j][k] = get(i - 1, j, k);
				}
				if (s[k - 1] == '?') {
					dp[i][j][k] = get(i - 1, j, k) || get(i + 1, j, k) || get(i, j - 1, k) || get(i, j + 1, k);
				}
				//dp[i][j][k] &= dp[i][j][k - 1];
			}
		}
	}
	int counter = 0;
  	for(int i = 0; i < r; i++){
      for(int j = 0; j < c; j++){
        if(dp[i][j][m]){
          counter++;
        }
      }
    }
	cout << counter << endl;
}

• Subtask 1: 29 / 29
• Subtask 2: 37 / 37
• Subtask 3: 0 / 34