답안 #97907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97907	2019-02-19T13:32:52 Z	SuperJava	Mecho (IOI09_mecho)	C++17	37 / 100	1000 ms	13320 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 && !(nr == target.first && nc == target.second)){
					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 = 0,r = n*n/3,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;
			}
			simulate(1);
		}
		if(good){
			best = mid;
			l = mid+1;
		}else{
			r = mid-1;
		}
	}
	cout << best;
	return 0;
}

Subtask #1

37.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Execution timed out	1066 ms	11552 KB	Time limit exceeded
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	3 ms	768 KB	Output is correct
13	Correct	4 ms	768 KB	Output is correct
14	Correct	16 ms	768 KB	Output is correct
15	Incorrect	2 ms	512 KB	Output isn't correct
16	Correct	2 ms	512 KB	Output is correct
17	Incorrect	2 ms	512 KB	Output isn't correct
18	Correct	3 ms	512 KB	Output is correct
19	Incorrect	2 ms	512 KB	Output isn't correct
20	Correct	3 ms	560 KB	Output is correct
21	Incorrect	3 ms	640 KB	Output isn't correct
22	Correct	4 ms	640 KB	Output is correct
23	Incorrect	4 ms	640 KB	Output isn't correct
24	Correct	4 ms	640 KB	Output is correct
25	Incorrect	4 ms	896 KB	Output isn't correct
26	Correct	7 ms	768 KB	Output is correct
27	Incorrect	4 ms	768 KB	Output isn't correct
28	Correct	6 ms	768 KB	Output is correct
29	Incorrect	4 ms	896 KB	Output isn't correct
30	Correct	7 ms	768 KB	Output is correct
31	Incorrect	5 ms	896 KB	Output isn't correct
32	Correct	9 ms	896 KB	Output is correct
33	Incorrect	58 ms	3180 KB	Output isn't correct
34	Correct	502 ms	3616 KB	Output is correct
35	Execution timed out	1074 ms	4004 KB	Time limit exceeded
36	Incorrect	75 ms	3596 KB	Output isn't correct
37	Correct	654 ms	4164 KB	Output is correct
38	Execution timed out	1035 ms	4344 KB	Time limit exceeded
39	Incorrect	98 ms	4204 KB	Output isn't correct
40	Execution timed out	1036 ms	4848 KB	Time limit exceeded
41	Execution timed out	1036 ms	4856 KB	Time limit exceeded
42	Incorrect	125 ms	4604 KB	Output isn't correct
43	Execution timed out	1062 ms	5288 KB	Time limit exceeded
44	Execution timed out	1068 ms	5476 KB	Time limit exceeded
45	Incorrect	168 ms	5248 KB	Output isn't correct
46	Execution timed out	1037 ms	5968 KB	Time limit exceeded
47	Execution timed out	1065 ms	6144 KB	Time limit exceeded
48	Incorrect	150 ms	5752 KB	Output isn't correct
49	Execution timed out	1042 ms	6612 KB	Time limit exceeded
50	Execution timed out	1060 ms	6772 KB	Time limit exceeded
51	Incorrect	159 ms	6200 KB	Output isn't correct
52	Execution timed out	1075 ms	7224 KB	Time limit exceeded
53	Execution timed out	1045 ms	7496 KB	Time limit exceeded
54	Incorrect	205 ms	6780 KB	Output isn't correct
55	Execution timed out	1072 ms	7896 KB	Time limit exceeded
56	Execution timed out	1050 ms	8112 KB	Time limit exceeded
57	Incorrect	319 ms	7592 KB	Output isn't correct
58	Execution timed out	1037 ms	8692 KB	Time limit exceeded
59	Execution timed out	1079 ms	8872 KB	Time limit exceeded
60	Incorrect	306 ms	8268 KB	Output isn't correct
61	Execution timed out	1064 ms	9504 KB	Time limit exceeded
62	Execution timed out	1063 ms	10792 KB	Time limit exceeded
63	Execution timed out	1043 ms	8876 KB	Time limit exceeded
64	Execution timed out	1055 ms	7964 KB	Time limit exceeded
65	Execution timed out	1067 ms	8208 KB	Time limit exceeded
66	Execution timed out	1068 ms	9200 KB	Time limit exceeded
67	Execution timed out	1054 ms	8532 KB	Time limit exceeded
68	Execution timed out	1059 ms	9836 KB	Time limit exceeded
69	Execution timed out	1073 ms	9716 KB	Time limit exceeded
70	Execution timed out	1068 ms	9808 KB	Time limit exceeded
71	Execution timed out	1038 ms	9700 KB	Time limit exceeded
72	Correct	459 ms	9848 KB	Output is correct
73	Execution timed out	1073 ms	9892 KB	Time limit exceeded
74	Execution timed out	1072 ms	11804 KB	Time limit exceeded
75	Execution timed out	1070 ms	11744 KB	Time limit exceeded
76	Execution timed out	1022 ms	11828 KB	Time limit exceeded
77	Execution timed out	1059 ms	11636 KB	Time limit exceeded
78	Execution timed out	1061 ms	13228 KB	Time limit exceeded
79	Execution timed out	1056 ms	12420 KB	Time limit exceeded
80	Execution timed out	1062 ms	12316 KB	Time limit exceeded
81	Execution timed out	1057 ms	13312 KB	Time limit exceeded
82	Execution timed out	1068 ms	13132 KB	Time limit exceeded
83	Execution timed out	1060 ms	13160 KB	Time limit exceeded
84	Execution timed out	1045 ms	13320 KB	Time limit exceeded
85	Execution timed out	1063 ms	11464 KB	Time limit exceeded
86	Execution timed out	1056 ms	13248 KB	Time limit exceeded
87	Execution timed out	1055 ms	13188 KB	Time limit exceeded
88	Execution timed out	1064 ms	13068 KB	Time limit exceeded
89	Execution timed out	1077 ms	12404 KB	Time limit exceeded
90	Execution timed out	1065 ms	13144 KB	Time limit exceeded
91	Execution timed out	1077 ms	13064 KB	Time limit exceeded
92	Execution timed out	1060 ms	13228 KB	Time limit exceeded