답안 #117604

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
117604	2019-06-16T18:19:38 Z	KieranHorgan	Mecho (IOI09_mecho)	C++17	53 / 100	99 ms	8824 KB

mecho

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
 
using namespace std;
#define endl '\n'
#define ll long long
#define int short
#define ld double
#define pii pair<int,int>
#define rand() abs((rand()<<15)|rand())
#define randll() abs(((long long)rand()<<30)|rand())
const int MOD = 1000000007;
 
char grid[805][805];
int dist1[805][805];
pair<int,int> dist3[805][805];
int dist2[805][805];
int dist[805][805];
int vis[805][805];
 
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	long long seed;
	asm("rdtsc" : "=A"(seed));
	srand(seed);
 
	int n, s;
	cin >> n >> s;
	int si, sj;
	int fi, fj;
	vector<pair<int,int>> p;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			cin >> grid[i][j];
			if(grid[i][j]=='M') {
				si = i;
				sj = j;
			}
			if(grid[i][j]=='D') {
				fi = i;
				fj = j;
			}
			if(grid[i][j]=='H') {
				p.push_back({i,j});
			}
			if(grid[i][j]=='T') grid[i][j]=0;
		}
	}
 
	vector<int> di = {1,0,-1,0};
	vector<int> dj = {0,1,0,-1};
 
	queue<pair<int,pair<int,int>>> q;
 
	memset(dist1,-1,sizeof(dist1));
	dist1[si][sj]=0;
	q.push({0,{si,sj}});
	while(!q.empty()) {
		int d = q.front().first;
		int i = q.front().second.first;
		int j = q.front().second.second;
		q.pop();
		for(int x = 0; x < 4; x++) {
			if(grid[i+di[x]][j+dj[x]] == 0) continue;
			if(dist1[i+di[x]][j+dj[x]] != -1) continue;
			dist1[i+di[x]][j+dj[x]] = d+1;
			q.push({d+1,{i+di[x],j+dj[x]}});
		}
	}
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			if(dist1[i][j]>0) {
				dist3[i][j] = {(dist1[i][j]+s-1)/s,(dist1[i][j]+s-1)%s};
			}
 
 
 
	memset(dist2,-1,sizeof(dist2));
	for(auto pp: p) {
		int pi = pp.first;
		int pj = pp.second;
		dist2[pi][pj]=0;
		q.push({0,{pi,pj}});
	}
	while(!q.empty()) {
		int d = q.front().first;
		int i = q.front().second.first;
		int j = q.front().second.second;
		q.pop();
		for(int x = 0; x < 4; x++) {
			if(grid[i+di[x]][j+dj[x]] == 0) continue;
			if(dist2[i+di[x]][j+dj[x]] != -1) continue;
			if(grid[i+di[x]][j+dj[x]] == 'D') continue;
			dist2[i+di[x]][j+dj[x]] = d+1;
			q.push({d+1,{i+di[x],j+dj[x]}});
		}
	}
 
 
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			if(dist1[i][j]>=0) {
				dist[i][j] = dist2[i][j]-dist3[i][j].first-(dist3[i][j].second==s-1);
			}
 
	// for(int i = 1; i <= n; i++) {
		// for(int j = 1; j <= n; j++) {
			// cerr << dist3[i][j].first << ":" << dist3[i][j].second << " ";
		// }
		// cerr << endl;
	// }
	// cerr << endl;
	// for(int i = 1; i <= n; i++) {
		// for(int j = 1; j <= n; j++) {
			// cerr << dist2[i][j] << " ";
		// }
		// cerr << endl;
	// }
	// cerr << endl;
	// for(int i = 1; i <= n; i++) {
		// for(int j = 1; j <= n; j++) {
			// cerr << dist[i][j] << " ";
		// }
		// cerr << endl;
	// }
	// cerr << endl;
 
	priority_queue<pair<int,pair<int,int>>> pq;
	pq.push({dist[si][sj], {si, sj}});
	int ans = dist[si][sj];
	bool toBreak = 0;
	while(!pq.empty()) {
		int d = pq.top().first;
		int i = pq.top().second.first;
		int j = pq.top().second.second;
		pq.pop();
		ans = min(ans, d);
		if(i==fi && j == fj) break;
		for(int x = 0; x < 4; x++) {
			if(grid[i+di[x]][j+dj[x]] == 'D') {toBreak = 1; break;}
			if(grid[i+di[x]][j+dj[x]] == 0) continue;
			if(dist1[i+di[x]][j+dj[x]] <= 0) continue;
			if(vis[i+di[x]][j+dj[x]]) continue;
			vis[i+di[x]][j+dj[x]] = 1;
			pq.push({dist[i+di[x]][j+dj[x]],{i+di[x],j+dj[x]}});
		}
		if(toBreak)break;
	}
	cout << ans << endl;
}

Compilation message

mecho.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
mecho.cpp:14:17: warning: overflow in implicit constant conversion [-Woverflow]
 const int MOD = 1000000007;
                 ^~~~~~~~~~
mecho.cpp: In function 'int main()':
mecho.cpp:141:17: warning: 'fj' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if(i==fi && j == fj) break;
               ~~^~~~~
mecho.cpp:141:7: warning: 'fi' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if(i==fi && j == fj) break;
      ~^~~~

Subtask #1

53.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2944 KB	Output is correct
2	Correct	5 ms	2944 KB	Output is correct
3	Correct	4 ms	2944 KB	Output is correct
4	Correct	4 ms	2944 KB	Output is correct
5	Correct	4 ms	2944 KB	Output is correct
6	Correct	4 ms	2944 KB	Output is correct
7	Correct	85 ms	8056 KB	Output is correct
8	Correct	4 ms	2944 KB	Output is correct
9	Correct	4 ms	3072 KB	Output is correct
10	Correct	4 ms	2944 KB	Output is correct
11	Correct	4 ms	3072 KB	Output is correct
12	Correct	4 ms	3172 KB	Output is correct
13	Incorrect	4 ms	3200 KB	Output isn't correct
14	Incorrect	4 ms	3328 KB	Output isn't correct
15	Correct	4 ms	2944 KB	Output is correct
16	Correct	4 ms	3072 KB	Output is correct
17	Correct	4 ms	3072 KB	Output is correct
18	Correct	4 ms	3044 KB	Output is correct
19	Correct	4 ms	3072 KB	Output is correct
20	Correct	4 ms	3072 KB	Output is correct
21	Correct	4 ms	3200 KB	Output is correct
22	Correct	4 ms	3200 KB	Output is correct
23	Correct	5 ms	3200 KB	Output is correct
24	Correct	4 ms	3200 KB	Output is correct
25	Correct	4 ms	3200 KB	Output is correct
26	Correct	5 ms	3200 KB	Output is correct
27	Correct	4 ms	3200 KB	Output is correct
28	Correct	4 ms	3200 KB	Output is correct
29	Correct	4 ms	3328 KB	Output is correct
30	Correct	5 ms	3328 KB	Output is correct
31	Correct	4 ms	3328 KB	Output is correct
32	Correct	4 ms	3328 KB	Output is correct
33	Incorrect	8 ms	4096 KB	Output isn't correct
34	Correct	9 ms	4864 KB	Output is correct
35	Incorrect	20 ms	5376 KB	Output isn't correct
36	Incorrect	10 ms	4352 KB	Output isn't correct
37	Incorrect	10 ms	4864 KB	Output isn't correct
38	Incorrect	26 ms	5760 KB	Output isn't correct
39	Incorrect	11 ms	4608 KB	Output isn't correct
40	Incorrect	11 ms	4736 KB	Output isn't correct
41	Incorrect	32 ms	6016 KB	Output isn't correct
42	Incorrect	14 ms	4608 KB	Output isn't correct
43	Incorrect	12 ms	4608 KB	Output isn't correct
44	Incorrect	39 ms	6528 KB	Output isn't correct
45	Incorrect	14 ms	4864 KB	Output isn't correct
46	Incorrect	13 ms	4864 KB	Output isn't correct
47	Incorrect	44 ms	6784 KB	Output isn't correct
48	Incorrect	17 ms	4904 KB	Output isn't correct
49	Incorrect	16 ms	5248 KB	Output isn't correct
50	Incorrect	54 ms	7128 KB	Output isn't correct
51	Incorrect	18 ms	5120 KB	Output isn't correct
52	Incorrect	19 ms	5376 KB	Output isn't correct
53	Incorrect	61 ms	7544 KB	Output isn't correct
54	Incorrect	21 ms	5248 KB	Output isn't correct
55	Incorrect	19 ms	5248 KB	Output isn't correct
56	Incorrect	70 ms	7808 KB	Output isn't correct
57	Incorrect	22 ms	5496 KB	Output isn't correct
58	Incorrect	21 ms	5504 KB	Output isn't correct
59	Incorrect	83 ms	8364 KB	Output isn't correct
60	Incorrect	25 ms	5496 KB	Output isn't correct
61	Incorrect	25 ms	5880 KB	Output isn't correct
62	Incorrect	94 ms	8636 KB	Output isn't correct
63	Correct	77 ms	8568 KB	Output is correct
64	Correct	80 ms	8724 KB	Output is correct
65	Correct	78 ms	8568 KB	Output is correct
66	Correct	80 ms	8540 KB	Output is correct
67	Incorrect	81 ms	8600 KB	Output isn't correct
68	Correct	69 ms	8604 KB	Output is correct
69	Correct	65 ms	8568 KB	Output is correct
70	Correct	65 ms	8568 KB	Output is correct
71	Correct	66 ms	8568 KB	Output is correct
72	Incorrect	60 ms	7544 KB	Output isn't correct
73	Incorrect	73 ms	8824 KB	Output isn't correct
74	Correct	65 ms	8824 KB	Output is correct
75	Correct	69 ms	8824 KB	Output is correct
76	Correct	72 ms	8824 KB	Output is correct
77	Correct	69 ms	8824 KB	Output is correct
78	Incorrect	80 ms	8184 KB	Output isn't correct
79	Correct	61 ms	7928 KB	Output is correct
80	Correct	67 ms	7944 KB	Output is correct
81	Correct	78 ms	8056 KB	Output is correct
82	Correct	66 ms	7932 KB	Output is correct
83	Correct	99 ms	8056 KB	Output is correct
84	Correct	74 ms	8056 KB	Output is correct
85	Correct	83 ms	8056 KB	Output is correct
86	Correct	85 ms	8056 KB	Output is correct
87	Correct	79 ms	8056 KB	Output is correct
88	Correct	88 ms	8184 KB	Output is correct
89	Correct	82 ms	8056 KB	Output is correct
90	Correct	86 ms	8056 KB	Output is correct
91	Correct	85 ms	8060 KB	Output is correct
92	Correct	83 ms	8184 KB	Output is correct