oj.uz

답안 #125445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
125445 2019-07-05T10:22:26 Z mechfrog88 Nautilus (BOI19_nautilus) C++14
66 / 100
 316 ms 262144 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
using namespace __gnu_pbds;
using namespace std;
 
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld;
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll r,c,m;
	cin >> r >> c >> m;
	vector <string> grid(r);
	for (int z=0;z<r;z++){
		cin >> grid[z];
	}
	string signal;
	cin >> signal;
	bool dp[m+1][r][c];
	for (int i=0;i<=m;i++){
		for (int j=0;j<r;j++){
			for (int k=0;k<c;k++){
				dp[i][j][k] = false;
			}
		}
	}
	for (int j=0;j<r;j++){
		for (int k=0;k<c;k++){
			if (grid[j][k] == '#') continue;
			dp[0][j][k] = true;
		}
	}
	for (int i=1;i<=m;i++){
		char now = signal[i-1];
		for (int j=0;j<r;j++){
			for (int k=0;k<c;k++){
				if (grid[j][k] == '#') continue; 
				if ((now == 'W' || now == '?') && k < c-1)	dp[i][j][k] = dp[i][j][k] || dp[i-1][j][k+1]; 
				if ((now == 'E' || now == '?')  && k > 0)	dp[i][j][k] = dp[i][j][k] || dp[i-1][j][k-1];
				if ((now == 'S' || now == '?')  && j > 0)	dp[i][j][k] = dp[i][j][k] || dp[i-1][j-1][k];
				if ((now == 'N' || now == '?')  && j < r-1)	dp[i][j][k] = dp[i][j][k] || dp[i-1][j+1][k];
			}
		}
	}
	ll ans = 0;
	for (int z=0;z<r;z++){
		for (int x=0;x<c;x++){
			if (dp[m][z][x]) ans++;
		}
	}
	cout << ans << endl;
}

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1272 KB Output is correct
2 Correct 10 ms 1272 KB Output is correct
3 Correct 11 ms 1400 KB Output is correct
4 Correct 10 ms 1272 KB Output is correct
5 Correct 7 ms 1400 KB Output is correct
6 Correct 4 ms 1276 KB Output is correct

Subtask #2
37.0 / 37.0

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

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1272 KB Output is correct
2 Correct 10 ms 1272 KB Output is correct
3 Correct 11 ms 1400 KB Output is correct
4 Correct 10 ms 1272 KB Output is correct
5 Correct 7 ms 1400 KB Output is correct
6 Correct 4 ms 1276 KB Output is correct
7 Correct 9 ms 1372 KB Output is correct
8 Correct 12 ms 1528 KB Output is correct
9 Correct 11 ms 1272 KB Output is correct
10 Correct 8 ms 1272 KB Output is correct
11 Correct 4 ms 1400 KB Output is correct
12 Correct 9 ms 1272 KB Output is correct
13 Correct 11 ms 1272 KB Output is correct
14 Correct 13 ms 1272 KB Output is correct
15 Correct 8 ms 1400 KB Output is correct
16 Correct 4 ms 1400 KB Output is correct
17 Correct 10 ms 1272 KB Output is correct
18 Correct 11 ms 1272 KB Output is correct
19 Correct 12 ms 1272 KB Output is correct
20 Correct 8 ms 1272 KB Output is correct
21 Correct 4 ms 1272 KB Output is correct
22 Runtime error 316 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -