Submission #389436

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
389436	2021-04-14T05:08:10 Z	arwaeystoamneg	Mecho (IOI09_mecho)	C++17	100 / 100	244 ms	8908 KB

mecho

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}

int n, m;
const int MAX = 805;
string a[MAX];
int dist[MAX][MAX];
int check(int i, int j)
{
	return i >= 0 && j >= 0 && i < n&& j < n&& a[i][j] != 'T';
}
struct T
{
	int d, extra;
	T next()
	{
		T t = (*this);
		t.extra--;
		if (t.extra == 0)
		{
			t.extra = m;
			t.d++;
		}
		return t;
	}
	bool operator<(const T& x)const
	{
		if (d == x.d)return extra > x.extra;
		return d < x.d;
	}
};
T best[MAX][MAX];
T init = { inf,0 };
pii start, finish;
int solve(int t)
{
	F0R(i, n)F0R(j, n)best[i][j] = init;
	if (t >= dist[start.f][start.s])return 0;
	best[start.f][start.s] = { t,m };
	deque<pii>todo = { {start.f,start.s} };
	while (sz(todo))
	{
		int i = todo.back().f, j = todo.back().s;
		todo.pop_back();
		F0R(k, 4)
		{
			int x = i + dx[k], y = j + dy[k];
			if (check(x, y))
			{
				T temp = best[i][j];
				temp = temp.next();
				if (dist[x][y] > temp.d && temp < best[x][y])
				{
					best[x][y] = temp;
					todo.push_front({ x,y });
				}
			}
		}
	}
	return best[finish.f][finish.s].d != inf;
}
int main()
{
	setIO("");
	cin >> n >> m;
	F0R(i, n)cin >> a[i];
	F0R(i, n)
	{
		F0R(j, n)
		{
			if (a[i][j] == 'M')start = { i,j };
			if (a[i][j] == 'D')finish = { i,j };
		}
	}
	F0R(i, n)F0R(j, n)dist[i][j] = inf;
	deque<pii> todo;
	F0R(i, n)F0R(j, n)if (a[i][j] == 'H')todo.pb({ i,j }), dist[i][j] = 0;
	while (sz(todo))
	{
		int i = todo.back().f, j = todo.back().s;
		todo.pop_back();
		F0R(k, 4)
		{
			int x = i + dx[k], y = j + dy[k];
			if (check(x, y) && a[x][y] != 'D' && dist[x][y] > dist[i][j] + 1)
			{
				dist[x][y] = dist[i][j] + 1;
				todo.push_front({ x,y });
			}
		}
	}
	if (!solve(0))
	{
		cout << -1 << endl;
		return 0;
	}
	int l = 0, r = 2 * n * n;
	while (l < r)
	{
		int m = (l + r + 1) / 2;
		if (solve(m))
		{
			l = m;
		}
		else
		{
			r = m - 1;
		}
	}
	cout << l << endl;
}

Compilation message

mecho.cpp: In function 'void setIO(std::string)':
mecho.cpp:48:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:50:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	149 ms	8756 KB	Output is correct
8	Correct	1 ms	460 KB	Output is correct
9	Correct	1 ms	460 KB	Output is correct
10	Correct	1 ms	460 KB	Output is correct
11	Correct	1 ms	460 KB	Output is correct
12	Correct	1 ms	716 KB	Output is correct
13	Correct	1 ms	716 KB	Output is correct
14	Correct	1 ms	716 KB	Output is correct
15	Correct	1 ms	460 KB	Output is correct
16	Correct	1 ms	460 KB	Output is correct
17	Correct	1 ms	460 KB	Output is correct
18	Correct	1 ms	460 KB	Output is correct
19	Correct	1 ms	460 KB	Output is correct
20	Correct	1 ms	460 KB	Output is correct
21	Correct	1 ms	588 KB	Output is correct
22	Correct	1 ms	532 KB	Output is correct
23	Correct	1 ms	716 KB	Output is correct
24	Correct	1 ms	716 KB	Output is correct
25	Correct	1 ms	716 KB	Output is correct
26	Correct	1 ms	716 KB	Output is correct
27	Correct	1 ms	844 KB	Output is correct
28	Correct	1 ms	844 KB	Output is correct
29	Correct	1 ms	844 KB	Output is correct
30	Correct	1 ms	848 KB	Output is correct
31	Correct	1 ms	844 KB	Output is correct
32	Correct	1 ms	844 KB	Output is correct
33	Correct	7 ms	3660 KB	Output is correct
34	Correct	8 ms	3660 KB	Output is correct
35	Correct	32 ms	3788 KB	Output is correct
36	Correct	9 ms	4300 KB	Output is correct
37	Correct	10 ms	4300 KB	Output is correct
38	Correct	40 ms	4300 KB	Output is correct
39	Correct	10 ms	4816 KB	Output is correct
40	Correct	13 ms	4816 KB	Output is correct
41	Correct	67 ms	4812 KB	Output is correct
42	Correct	13 ms	5324 KB	Output is correct
43	Correct	16 ms	5336 KB	Output is correct
44	Correct	71 ms	5328 KB	Output is correct
45	Correct	15 ms	5836 KB	Output is correct
46	Correct	19 ms	5836 KB	Output is correct
47	Correct	77 ms	5836 KB	Output is correct
48	Correct	17 ms	6348 KB	Output is correct
49	Correct	21 ms	6352 KB	Output is correct
50	Correct	112 ms	6400 KB	Output is correct
51	Correct	21 ms	6860 KB	Output is correct
52	Correct	29 ms	6860 KB	Output is correct
53	Correct	123 ms	6860 KB	Output is correct
54	Correct	23 ms	7372 KB	Output is correct
55	Correct	29 ms	7416 KB	Output is correct
56	Correct	145 ms	7408 KB	Output is correct
57	Correct	26 ms	8012 KB	Output is correct
58	Correct	35 ms	7920 KB	Output is correct
59	Correct	163 ms	7924 KB	Output is correct
60	Correct	29 ms	8540 KB	Output is correct
61	Correct	37 ms	8524 KB	Output is correct
62	Correct	192 ms	8524 KB	Output is correct
63	Correct	133 ms	8564 KB	Output is correct
64	Correct	244 ms	8564 KB	Output is correct
65	Correct	208 ms	8524 KB	Output is correct
66	Correct	166 ms	8660 KB	Output is correct
67	Correct	43 ms	8524 KB	Output is correct
68	Correct	61 ms	8524 KB	Output is correct
69	Correct	58 ms	8516 KB	Output is correct
70	Correct	54 ms	8556 KB	Output is correct
71	Correct	53 ms	8648 KB	Output is correct
72	Correct	44 ms	8556 KB	Output is correct
73	Correct	55 ms	8820 KB	Output is correct
74	Correct	109 ms	8812 KB	Output is correct
75	Correct	117 ms	8848 KB	Output is correct
76	Correct	128 ms	8848 KB	Output is correct
77	Correct	113 ms	8816 KB	Output is correct
78	Correct	39 ms	8908 KB	Output is correct
79	Correct	106 ms	8828 KB	Output is correct
80	Correct	100 ms	8716 KB	Output is correct
81	Correct	99 ms	8780 KB	Output is correct
82	Correct	93 ms	8776 KB	Output is correct
83	Correct	123 ms	8900 KB	Output is correct
84	Correct	126 ms	8900 KB	Output is correct
85	Correct	116 ms	8780 KB	Output is correct
86	Correct	118 ms	8772 KB	Output is correct
87	Correct	110 ms	8780 KB	Output is correct
88	Correct	120 ms	8680 KB	Output is correct
89	Correct	143 ms	8652 KB	Output is correct
90	Correct	150 ms	8728 KB	Output is correct
91	Correct	150 ms	8720 KB	Output is correct
92	Correct	127 ms	8816 KB	Output is correct