oj.uz

답안 #330135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330135 2020-11-24T03:23:01 Z ignaciocanta Nautilus (BOI19_nautilus) C++14
66 / 100
 21 ms 3948 KB 
#include <bits/stdc++.h>
//#include <traffic.h>
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define forsn(i, s, n) for(int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define trav(a, x) for(auto& a : x)
 
using vi = vector<int>;
using vl = vector<tint>;
using vb = vector<bool>;
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert
#define esta(x,c) ((c).find(x) != (c).end())
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7;
const tint mod = 998244353;
const int MX = 1e6+5; 
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-8;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
 bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}

int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redonde p abajo
 
void NACHO(string name = "cbarn"){
    ios_base::sync_with_stdio(0); cin.tie(0);
    //freopen((name+".in").c_str(), "r", stdin);
    //freopen((name+".out").c_str(), "w", stdout);
}

bool dp[105][105][105];

int main(){
	NACHO();
	int n, m, K; cin >> n >> m >> K;
	vector<string> a (n);
	forn(i, n) cin >> a[i];
	string s; cin >> s;
	forn(i, n){
		forn(j, m){
			if(a[i][j] == '#'){
				forn(k, sz(s)+1){
					dp[i][j][k] = 0;
				}
			}else dp[i][j][0] = 1;
		}
	}
	
	forsn(k, 1, K+1){
		forn(i, n){
			forn(j, m){
				if(a[i][j] == '#') continue;
				if(s[k-1] == '?'){
					forn(kk, 4){
						if(valid(i+dx[kk], j+dy[kk], n, m) && a[i+dx[kk]][j+dy[kk]] != '#'){
							if(dp[i+dx[kk]][j+dy[kk]][k-1] == 1) dp[i][j][k] = 1;
						}
					}
				}else if(s[k-1] == 'N'){
					if(i+1 < n && a[i+1][j] != '#'){
						if(dp[i+1][j][k-1] == 1) dp[i][j][k] = 1;
					}
				}else if(s[k-1] == 'S'){
					if(i-1 >= 0 && a[i-1][j] != '#'){
						if(dp[i-1][j][k-1] == 1) dp[i][j][k] = 1;
					}
				}else if(s[k-1] == 'E'){
					if(j-1 >= 0 && a[i][j-1] != '#'){
						if(dp[i][j-1][k-1] == 1) dp[i][j][k] = 1;
					}
				}else if(s[k-1] == 'W'){
					if(j+1 < m && a[i][j+1] != '#'){
						if(dp[i][j+1][k-1] == 1) dp[i][j][k] = 1;
					}
				}
			}
		}
	}
	int ret = 0;
	forn(i, n) forn(j, m) if(dp[i][j][K]) ++ret;
	cout << ret << "\n";
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
0 / 34.0

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