oj.uz

답안 #288065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288065 2020-09-01T08:25:57 Z MKutayBozkurt Awesome Arrowland Adventure (eJOI19_adventure) C++17
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}

const int inf = 1e9;
int n, m;
vector<vector<char>> a;
int sp() {
	priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> pq;
	vector<vector<int>> ans(n, vector<int>(m, inf));
	pq.push({0, {0, 0}});
	while (pq.size()) {
		int z = pq.top().first;
		int x = pq.top().second.first;
		int y = pq.top().second.second;
		pq.pop();
		if (x < 0 || y < 0 || x >= n || y >= m || ans[x][y] != inf) continue;
		ans[x][y] = z;
		//cout << "x: " << x << " y: " << y << " z: " << z << '\n';
		if (a[x][y] == 'E') {
			pq.push({z, {x, y + 1}});
			pq.push({z + 1, {x + 1, y}});
			pq.push({z + 2, {x, y - 1}});
			pq.push({z + 3, {x - 1, y}});
		} else if (a[x][y] == 'S') {
			pq.push({z, {x + 1, y}});
			pq.push({z + 1, {x, y - 1}});
			pq.push({z + 2, {x - 1, y}});
			pq.push({z + 3, {x, y + 1}});
		} else if (a[x][y] == 'W') {
			pq.push({z, {x, y - 1}});
			pq.push({z + 1, {x - 1, y}});
			pq.push({z + 2, {x, y + 1}});
			pq.push({z + 3, {x + 1, y}});
		} else if (a[x][y] == 'N') {
			pq.push({z, {x - 1, y}});
			pq.push({z + 1, {x, y + 1}});
			pq.push({z + 2, {x + 1, y}});
			pq.push({z + 3, {x, y - 1}});
		} else if (a[x][y] == 'X'){
			// nothing
		} else {
			cout << "What!?\n";
		}
	}
	return ans[n - 1][m - 1];
}

int main() {
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	/*
	her 4 yere bir cost ile gidiyon
	*/
	cin >> n >> m;
	a = vector<vector<char>>(n, vector<char>(m)); cin >> a;
	cout << sp() << '\n';
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -