oj.uz

답안 #257319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257319 2020-08-04T05:55:52 Z 임성재(#5052) Dangerous Skating (JOI16_skating) C++17
78 / 100
 1073 ms 262148 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(NULL)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define all(v) (v).begin(), (v).end()
#define pre(a) cout<<fixed; cout.precision(a)
#define mp make_pair

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,pii> pipii;
const int inf = 1e9;
const ll INF = 1e18;

int n, m;
string s[1010];
priority_queue<pipii, vector<pipii>, greater<pipii>> pQ;
pii S;
pii E;
bool chk[1010][1010];

int main() {
	fast;

	cin >> n >> m;

	for(int i=0; i<n; i++) {
		cin >> s[i];
	}

	cin >> S.fi >> S.se;
	cin >> E.fi >> E.se;

	S.fi--;
	S.se--;
	E.fi--;
	E.se--;

	pQ.em(0, S);

	while(pQ.size()) {
		int cost = pQ.top().fi;
		pii cur = pQ.top().se;

		pQ.pop();

		if(cur == E) {
			cout << cost << "\n";
			return 0;
		}
		if(chk[cur.fi][cur.se]) continue;

		chk[cur.fi][cur.se] = true;
		//cout << cur.fi << " " << cur.se << " : " << cost << endl;

		int l, r;
		for(l = cur.fi; 0 <= l && s[l][cur.se] == '.'; l--);
		for(r = cur.fi; r < n && s[r][cur.se] == '.'; r++);

		l++;
		r--;

		//cout << l << " " << r << endl;

		for(int i=l; i<=r; i++) {
			if(i < cur.fi) {
				int d = min(2 * i - 2 * l + 1, 2 * cur.fi - 2 * i);

				//cout << i << " " << d << endl;
				pQ.em(cost + d, mp(i, cur.se));
			}
			else if(i > cur.fi) {
				int d = min(2 * r - 2 * i + 1, 2 * i - 2 * cur.fi);				
				
				//cout << i << " " << d << endl;
				pQ.em(cost + d, mp(i, cur.se));
			}
		}

		for(l = cur.se; 0 <= l && s[cur.fi][l] == '.'; l--);
		for(r = cur.se; r < m && s[cur.fi][r] == '.'; r++);

		l++;
		r--;

		//cout << l << " " << r << endl;

		for(int i=l; i<=r; i++) {
			if(i < cur.se) {
				int d = min(2 * i - 2 * l + 1, 2 * cur.se - 2 * i);

				//cout << i << " " << d << endl;
				pQ.em(cost + d, mp(cur.fi, i));
			}
			else if(i > cur.se) {
				int d = min(2 * r - 2 * i + 1, 2 * i - 2 * cur.se);				
				
				//cout << i << " " << d << endl;
				pQ.em(cost + d, mp(cur.fi, i));
			}
		}
	}

	cout << "-1\n";
}

Subtask #1
13.0 / 13.0

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

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1073 ms 99360 KB Output is correct
12 Correct 615 ms 99196 KB Output is correct
13 Correct 96 ms 25420 KB Output is correct
14 Correct 45 ms 1524 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 528 ms 25416 KB Output is correct
17 Correct 100 ms 996 KB Output is correct
18 Correct 42 ms 760 KB Output is correct
19 Correct 177 ms 3860 KB Output is correct
20 Correct 658 ms 49924 KB Output is correct
21 Correct 10 ms 960 KB Output is correct
22 Correct 281 ms 1080 KB Output is correct
23 Correct 40 ms 896 KB Output is correct
24 Correct 855 ms 13184 KB Output is correct
25 Correct 16 ms 640 KB Output is correct
26 Correct 27 ms 692 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1073 ms 99360 KB Output is correct
12 Correct 615 ms 99196 KB Output is correct
13 Correct 96 ms 25420 KB Output is correct
14 Correct 45 ms 1524 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 528 ms 25416 KB Output is correct
17 Correct 100 ms 996 KB Output is correct
18 Correct 42 ms 760 KB Output is correct
19 Correct 177 ms 3860 KB Output is correct
20 Correct 658 ms 49924 KB Output is correct
21 Correct 10 ms 960 KB Output is correct
22 Correct 281 ms 1080 KB Output is correct
23 Correct 40 ms 896 KB Output is correct
24 Correct 855 ms 13184 KB Output is correct
25 Correct 16 ms 640 KB Output is correct
26 Correct 27 ms 692 KB Output is correct
27 Runtime error 767 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -