oj.uz

Submission #533128

# Submission time Handle Problem Language Result Execution time Memory
533128 2022-03-04T22:18:43 Z Bungmint Mecho (IOI09_mecho) C++17
81 / 100
 190 ms 6316 KB 
//Copyright © 2022 Youngmin Park. All rights reserved.
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
template <typename T, size_t SZ>
using ar = array<T, SZ>;
 
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#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 REP(a) F0R(_, a)
 
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7; //998244353;
const ld PI = acos((ld)-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
inline bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <typename T>
bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; }
 
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p)
{
    return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v)
{
    os << '{';
    string sep;
    for (const T &x : v)
        os << sep << x, sep = ", ";
    return os << '}';
}
void dbg_out()
{
    cerr << endl;
}
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T)
{
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif
 
inline namespace RecursiveLambda{
	template <typename Fun>
	struct y_combinator_result{
		Fun fun_;
		template <typename T> 
		explicit y_combinator_result(T &&fun): fun_(forward<T>(fun)){}
		template <typename...Args>
		decltype(auto) operator()(Args &&...args){
			return fun_(ref(*this), forward<Args>(args)...);
		}
	};
	template <typename Fun>
	decltype(auto) y_combinator(Fun &&fun){
		return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun));
	}
};
 
void setIO(string s) // USACO
{
	#ifndef LOCAL
	    freopen((s + ".in").c_str(), "r", stdin);
	    freopen((s + ".out").c_str(), "w", stdout);
	#endif
}
 
int mecho[800][800];
 
void solve()
{
	int n, S;
	cin >> n >> S;
	vector<string> grid(n);
	for (auto &s : grid) cin >> s;
	pii st, en{};
	vector<vi> distHive(n, vi(n, INF));
	queue<pii> bee;
	F0R(i, n) F0R(j, n) {
		if (grid[i][j] == 'M') {
			st = {i, j};
		}
		if (grid[i][j] == 'H') {
			distHive[i][j] = 0;
			bee.push({i, j});
		}
		if (grid[i][j] == 'D') {
			en = {i, j};
		}
	}
	while (sz(bee)) {
		auto [r, c] = bee.front();
		bee.pop();
		F0R(i, 4) {
			int nr = r + dx[i], nc = c + dy[i];
			if (nr < 0 || nc < 0 || nr >= n || nc >= n) continue;
			if (grid[nr][nc] == 'T' || grid[nr][nc] == 'D') continue;
			if (ckmin(distHive[nr][nc], distHive[r][c] + 1)) {
				bee.push({nr, nc});
			}
		}
	}
	int l = 0, r = n * n, ans = -1;
	while (l <= r) {
		int mid = (l + r) / 2;
		F0R(i, n) fill(mecho[i], mecho[i] + n, INF);
		mecho[st.fi][st.se] = 0;
		queue<pair<int, pii>> q;
		q.push({mid, st});
		while (sz(q)) {
			auto [r, c] = q.front().se;
			auto tt = q.front().fi;
			q.pop();
			if (tt >= distHive[r][c]) continue;
			queue<pii> s;
			s.push({r, c});
			while (sz(s)) {
				auto [x, y] = s.front();
				s.pop();
				if (mecho[x][y] == mecho[r][c] + S) {
					q.push({tt + 1, {x, y}});
					continue;
				}
				F0R(i, 4) {
					int nx = x + dx[i], ny = y + dy[i];
					if (nx < 0 || ny < 0 || nx >= n || ny >= n) continue;
					if (grid[nx][ny] == 'T') continue;
					if (distHive[nx][ny] <= tt) continue;
					if (mecho[nx][ny] == INF) {
						mecho[nx][ny] = mecho[x][y] + 1;
						s.push({nx, ny});
					}
				}
			}
		}
		if (mecho[en.fi][en.se] < INF) ans = mid, l = mid + 1;
		else r = mid - 1;
	}
	cout << ans;
}
 
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int testcase=1;
    // cin >> testcase;
    while (testcase--)
    {
        solve();
    }
}

Compilation message

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

Subtask #1
81.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Incorrect 102 ms 6152 KB Output isn't correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 588 KB Output is correct
32 Correct 1 ms 588 KB Output is correct
33 Correct 6 ms 2048 KB Output is correct
34 Correct 6 ms 1996 KB Output is correct
35 Correct 22 ms 2060 KB Output is correct
36 Correct 7 ms 2380 KB Output is correct
37 Correct 5 ms 2380 KB Output is correct
38 Correct 29 ms 2500 KB Output is correct
39 Correct 9 ms 2764 KB Output is correct
40 Correct 6 ms 2768 KB Output is correct
41 Correct 31 ms 2764 KB Output is correct
42 Correct 11 ms 3148 KB Output is correct
43 Correct 7 ms 3156 KB Output is correct
44 Correct 39 ms 3164 KB Output is correct
45 Correct 15 ms 3532 KB Output is correct
46 Correct 9 ms 3532 KB Output is correct
47 Correct 44 ms 3564 KB Output is correct
48 Correct 15 ms 4032 KB Output is correct
49 Correct 10 ms 3952 KB Output is correct
50 Correct 60 ms 3952 KB Output is correct
51 Correct 18 ms 4428 KB Output is correct
52 Correct 12 ms 4428 KB Output is correct
53 Correct 61 ms 4428 KB Output is correct
54 Correct 20 ms 4940 KB Output is correct
55 Correct 12 ms 4940 KB Output is correct
56 Correct 73 ms 4988 KB Output is correct
57 Correct 22 ms 5472 KB Output is correct
58 Correct 17 ms 5432 KB Output is correct
59 Correct 89 ms 5516 KB Output is correct
60 Correct 26 ms 5964 KB Output is correct
61 Correct 16 ms 5964 KB Output is correct
62 Correct 97 ms 6040 KB Output is correct
63 Correct 131 ms 5992 KB Output is correct
64 Correct 163 ms 6044 KB Output is correct
65 Correct 163 ms 6048 KB Output is correct
66 Correct 141 ms 6040 KB Output is correct
67 Correct 190 ms 6048 KB Output is correct
68 Correct 49 ms 6072 KB Output is correct
69 Correct 37 ms 5964 KB Output is correct
70 Correct 33 ms 6016 KB Output is correct
71 Correct 39 ms 6024 KB Output is correct
72 Correct 27 ms 5956 KB Output is correct
73 Correct 33 ms 6232 KB Output is correct
74 Correct 63 ms 6220 KB Output is correct
75 Correct 77 ms 6316 KB Output is correct
76 Correct 71 ms 6276 KB Output is correct
77 Correct 62 ms 6316 KB Output is correct
78 Correct 90 ms 6292 KB Output is correct
79 Correct 39 ms 6240 KB Output is correct
80 Incorrect 62 ms 6220 KB Output isn't correct
81 Incorrect 78 ms 6288 KB Output isn't correct
82 Incorrect 56 ms 6288 KB Output isn't correct
83 Incorrect 102 ms 6248 KB Output isn't correct
84 Correct 58 ms 6208 KB Output is correct
85 Incorrect 68 ms 6200 KB Output isn't correct
86 Incorrect 82 ms 6244 KB Output isn't correct
87 Incorrect 65 ms 6252 KB Output isn't correct
88 Incorrect 78 ms 6196 KB Output isn't correct
89 Incorrect 87 ms 6092 KB Output isn't correct
90 Incorrect 92 ms 6196 KB Output isn't correct
91 Correct 99 ms 6084 KB Output is correct
92 Incorrect 85 ms 6200 KB Output isn't correct