답안 #97902

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97902	2019-02-19T13:08:13 Z	SuperJava	Mecho (IOI09_mecho)	C++17	41 / 100	1000 ms	13136 KB

mecho

//fold
#ifndef KHALIL
#include <bits/stdc++.h>
#else
#include "header.h"
#endif
#define endl '\n'
#define mp make_pair
#define tostr(x) static_cast<ostringstream&>((ostringstream()<<dec<<x)).str()
#define rep(i,begin,end) for(auto i = begin;i < end;i++)
#define repr(i,begin,end) for(auto i = begin-1;i >= end;i--)
#define pb push_back
#define sz(a) ((int)(a).size())
#define fi first
#define se second
#define abs(a) ((a) < (0) ? (-1)*(a) : (a))
#define SQ(a) ((a)*(a))
#define eqd(a,b) (abs(a-b)<1e-9)
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;
template <typename t> t in(t q){cin >> q;return q;}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v){os << "[";for (int i = 0; i < sz(v); ++i) { os << v[i]; if (i != sz(v) - 1) os << ",";}os << "]";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const map<T, S>& v){for (auto it : v)os << "(" << it.first << ":" << it.second << ")";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const pair<T, S>& v){os << "(" << v.first << "," << v.second << ")";return os;}
const long double PI = acosl(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng);}
//endfold
#define  N  (805)
#define MOD (1000000000l + 7l)
#define OO (1050000000)
#define OOL (1100000000000000000)

int b[N][N];
int z[N][N];
int n,s;

int dr[4] = {1,-1,0,0};
int dc[4] = {0,0,1,-1};

pair<int,int> target;

void reset(){
	rep(i,0,n){
		rep(j,0,n){
			z[i][j] = b[i][j];
		}
	}
}

void simulate(int steps){
	if(steps == 0) return;
	queue<pair<pair<int,int>,int>> q;
	rep(i,0,n){
		rep(j,0,n){
			if(z[i][j] == 1){
				q.push({{i,j},0});
			}
		}
	}
	while(!q.empty()){
		auto t = q.front(); q.pop();
		int r = t.first.first;
		int c = t.first.second;
		rep(i,0,4){
			int nr = r+dr[i];
			int nc = c+dc[i];
			if(nr >= 0 && nr < n && nc >= 0 && nc < n){
				if(z[nr][nc] != -1 && z[nr][nc] != 1 && mp(nr,nc) != target){
					z[nr][nc] = 1;
					if(t.second != steps-1){
						q.push({{nr,nc},t.second+1});
					}
				}
			}
		}
	}
}

int simulate2(int steps){
	queue<pair<pair<int,int>,int>> q;
	rep(i,0,n){
		rep(j,0,n){
			if(z[i][j] == 2){
				q.push({{i,j},0});
			}
		}
	}
	if(q.size() == 0) return -1;
	while(!q.empty()){
		auto t = q.front(); q.pop();
		int r = t.first.first;
		int c = t.first.second;
		rep(i,0,4){
			int nr = r+dr[i];
			int nc = c+dc[i];
			if(nr >= 0 && nr < n && nc >= 0 && nc < n){
				if(z[nr][nc] == 0){
					z[nr][nc] = 2;
					if(t.second != steps-1){
						q.push({{nr,nc},t.second+1});
					}
				}
			}
		}
	}
	return 1;
}

int main(){
	//fold
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cout << setprecision(10);
	//endfold
	cin >> n >> s;
	rep(i,0,n){
		string q;
		cin >> q;
		map<char,int> pw = {{'T',-1},{'G',0},
					{'H',1},{'M',2},{'D',0}};
		rep(j,0,n){
			if(q[j] == 'D') target = {i,j};
			b[i][j] = pw[q[j]];
		}
	}
	int l = 1,r = n*n/2,best = -1;
	while(l <= r){
		int mid = (l+r)/2;
		reset();
		simulate(mid);
		bool good = false;
		while(simulate2(s) > 0){
			if(z[target.first][target.second] == 2){
				good = true;
				break;
			}
			if(z[target.first][target.second] == 1){
				good = false;
				break;
			}
			simulate(1);
			if(z[target.first][target.second] == 1){
				good = false;
				break;
			}
		}
		if(good){
			best = mid;
			l = mid+1;
		}else{
			r = mid-1;
		}
	}
	cout << best;
	return 0;
}

Subtask #1

41.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	384 KB	Output is correct
4	Correct	2 ms	356 KB	Output is correct
5	Incorrect	3 ms	384 KB	Output isn't correct
6	Correct	3 ms	384 KB	Output is correct
7	Execution timed out	1070 ms	12704 KB	Time limit exceeded
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	4 ms	768 KB	Output is correct
13	Incorrect	3 ms	768 KB	Output isn't correct
14	Correct	14 ms	768 KB	Output is correct
15	Correct	3 ms	512 KB	Output is correct
16	Correct	2 ms	512 KB	Output is correct
17	Correct	3 ms	512 KB	Output is correct
18	Correct	3 ms	512 KB	Output is correct
19	Correct	3 ms	512 KB	Output is correct
20	Correct	3 ms	512 KB	Output is correct
21	Correct	4 ms	700 KB	Output is correct
22	Correct	3 ms	640 KB	Output is correct
23	Correct	5 ms	640 KB	Output is correct
24	Correct	5 ms	768 KB	Output is correct
25	Correct	7 ms	768 KB	Output is correct
26	Correct	5 ms	768 KB	Output is correct
27	Correct	7 ms	812 KB	Output is correct
28	Correct	7 ms	768 KB	Output is correct
29	Correct	12 ms	896 KB	Output is correct
30	Correct	6 ms	896 KB	Output is correct
31	Correct	11 ms	896 KB	Output is correct
32	Correct	7 ms	896 KB	Output is correct
33	Execution timed out	1073 ms	3556 KB	Time limit exceeded
34	Correct	401 ms	3364 KB	Output is correct
35	Execution timed out	1067 ms	4024 KB	Time limit exceeded
36	Execution timed out	1077 ms	4208 KB	Time limit exceeded
37	Correct	615 ms	4108 KB	Output is correct
38	Execution timed out	1071 ms	4460 KB	Time limit exceeded
39	Execution timed out	1066 ms	4652 KB	Time limit exceeded
40	Correct	835 ms	4804 KB	Output is correct
41	Execution timed out	1080 ms	4900 KB	Time limit exceeded
42	Execution timed out	1067 ms	5324 KB	Time limit exceeded
43	Execution timed out	1070 ms	5228 KB	Time limit exceeded
44	Execution timed out	1067 ms	5216 KB	Time limit exceeded
45	Execution timed out	1065 ms	5824 KB	Time limit exceeded
46	Execution timed out	1065 ms	5952 KB	Time limit exceeded
47	Execution timed out	1074 ms	6416 KB	Time limit exceeded
48	Execution timed out	1055 ms	6500 KB	Time limit exceeded
49	Execution timed out	1052 ms	6532 KB	Time limit exceeded
50	Execution timed out	1037 ms	7152 KB	Time limit exceeded
51	Execution timed out	1059 ms	7252 KB	Time limit exceeded
52	Execution timed out	1070 ms	7300 KB	Time limit exceeded
53	Execution timed out	1042 ms	7832 KB	Time limit exceeded
54	Execution timed out	1068 ms	7892 KB	Time limit exceeded
55	Execution timed out	1051 ms	7964 KB	Time limit exceeded
56	Execution timed out	1060 ms	8532 KB	Time limit exceeded
57	Execution timed out	1073 ms	8772 KB	Time limit exceeded
58	Execution timed out	1078 ms	8632 KB	Time limit exceeded
59	Execution timed out	1066 ms	9392 KB	Time limit exceeded
60	Execution timed out	1051 ms	9632 KB	Time limit exceeded
61	Execution timed out	1036 ms	9452 KB	Time limit exceeded
62	Execution timed out	1058 ms	10096 KB	Time limit exceeded
63	Execution timed out	1034 ms	7556 KB	Time limit exceeded
64	Execution timed out	1038 ms	10408 KB	Time limit exceeded
65	Execution timed out	1052 ms	10560 KB	Time limit exceeded
66	Execution timed out	1060 ms	7932 KB	Time limit exceeded
67	Execution timed out	1068 ms	10320 KB	Time limit exceeded
68	Execution timed out	1026 ms	9604 KB	Time limit exceeded
69	Execution timed out	1070 ms	9612 KB	Time limit exceeded
70	Execution timed out	1089 ms	9588 KB	Time limit exceeded
71	Execution timed out	1063 ms	9716 KB	Time limit exceeded
72	Correct	555 ms	9940 KB	Output is correct
73	Execution timed out	1065 ms	9952 KB	Time limit exceeded
74	Execution timed out	1016 ms	12728 KB	Time limit exceeded
75	Execution timed out	1065 ms	12668 KB	Time limit exceeded
76	Execution timed out	1037 ms	13016 KB	Time limit exceeded
77	Execution timed out	1034 ms	12712 KB	Time limit exceeded
78	Execution timed out	1061 ms	13044 KB	Time limit exceeded
79	Execution timed out	1057 ms	13124 KB	Time limit exceeded
80	Execution timed out	1072 ms	13028 KB	Time limit exceeded
81	Execution timed out	1064 ms	12844 KB	Time limit exceeded
82	Execution timed out	1052 ms	13136 KB	Time limit exceeded
83	Execution timed out	1084 ms	12640 KB	Time limit exceeded
84	Execution timed out	1085 ms	13072 KB	Time limit exceeded
85	Execution timed out	1074 ms	11700 KB	Time limit exceeded
86	Execution timed out	1079 ms	13088 KB	Time limit exceeded
87	Execution timed out	1045 ms	12936 KB	Time limit exceeded
88	Execution timed out	1060 ms	13008 KB	Time limit exceeded
89	Execution timed out	1055 ms	11852 KB	Time limit exceeded
90	Execution timed out	1034 ms	12724 KB	Time limit exceeded
91	Execution timed out	1070 ms	12928 KB	Time limit exceeded
92	Execution timed out	1074 ms	12948 KB	Time limit exceeded