oj.uz

Submission #533131

# Submission time Handle Problem Language Result Execution time Memory
533131 2022-03-04T22:48:19 Z Bungmint Mecho (IOI09_mecho) C++17
67 / 100
 177 ms 6408 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;
			while (sz(q) && q.front().fi == tt) {
				s.push(q.front().se);
				q.pop();
			}
			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] > mecho[x][y] + 1) {
						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
67.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 1 ms 384 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 115 ms 6152 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 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 Incorrect 1 ms 332 KB Output isn't correct
16 Correct 1 ms 332 KB Output is correct
17 Incorrect 0 ms 332 KB Output isn't correct
18 Correct 1 ms 332 KB Output is correct
19 Incorrect 1 ms 332 KB Output isn't correct
20 Correct 1 ms 332 KB Output is correct
21 Incorrect 1 ms 332 KB Output isn't correct
22 Correct 1 ms 332 KB Output is correct
23 Incorrect 1 ms 460 KB Output isn't correct
24 Correct 1 ms 460 KB Output is correct
25 Incorrect 1 ms 460 KB Output isn't correct
26 Correct 1 ms 460 KB Output is correct
27 Incorrect 1 ms 460 KB Output isn't correct
28 Correct 1 ms 460 KB Output is correct
29 Incorrect 1 ms 460 KB Output isn't correct
30 Correct 1 ms 460 KB Output is correct
31 Incorrect 1 ms 588 KB Output isn't correct
32 Correct 1 ms 588 KB Output is correct
33 Incorrect 6 ms 1996 KB Output isn't correct
34 Correct 4 ms 1996 KB Output is correct
35 Correct 20 ms 2252 KB Output is correct
36 Incorrect 7 ms 2404 KB Output isn't correct
37 Correct 5 ms 2380 KB Output is correct
38 Correct 21 ms 2380 KB Output is correct
39 Incorrect 9 ms 2764 KB Output isn't correct
40 Correct 6 ms 2764 KB Output is correct
41 Correct 30 ms 2772 KB Output is correct
42 Incorrect 12 ms 3112 KB Output isn't correct
43 Correct 7 ms 3156 KB Output is correct
44 Correct 37 ms 3160 KB Output is correct
45 Incorrect 14 ms 3532 KB Output isn't correct
46 Correct 9 ms 3532 KB Output is correct
47 Correct 53 ms 3780 KB Output is correct
48 Incorrect 20 ms 3916 KB Output isn't correct
49 Correct 10 ms 3916 KB Output is correct
50 Correct 49 ms 3916 KB Output is correct
51 Incorrect 18 ms 4428 KB Output isn't correct
52 Correct 11 ms 4428 KB Output is correct
53 Correct 73 ms 4488 KB Output is correct
54 Incorrect 21 ms 4940 KB Output isn't correct
55 Correct 15 ms 4940 KB Output is correct
56 Correct 108 ms 4992 KB Output is correct
57 Incorrect 23 ms 5452 KB Output isn't correct
58 Correct 15 ms 5452 KB Output is correct
59 Correct 85 ms 5524 KB Output is correct
60 Incorrect 26 ms 5964 KB Output isn't correct
61 Correct 19 ms 5964 KB Output is correct
62 Correct 96 ms 5996 KB Output is correct
63 Correct 103 ms 6040 KB Output is correct
64 Correct 177 ms 5960 KB Output is correct
65 Correct 159 ms 6040 KB Output is correct
66 Correct 116 ms 5960 KB Output is correct
67 Correct 119 ms 6048 KB Output is correct
68 Correct 45 ms 5984 KB Output is correct
69 Correct 41 ms 5964 KB Output is correct
70 Correct 35 ms 5992 KB Output is correct
71 Correct 32 ms 6016 KB Output is correct
72 Correct 24 ms 6020 KB Output is correct
73 Correct 26 ms 6220 KB Output is correct
74 Correct 45 ms 6264 KB Output is correct
75 Correct 63 ms 6308 KB Output is correct
76 Correct 51 ms 6320 KB Output is correct
77 Correct 71 ms 6264 KB Output is correct
78 Correct 74 ms 6288 KB Output is correct
79 Correct 40 ms 6408 KB Output is correct
80 Correct 65 ms 6244 KB Output is correct
81 Correct 57 ms 6296 KB Output is correct
82 Correct 52 ms 6288 KB Output is correct
83 Correct 79 ms 6244 KB Output is correct
84 Correct 58 ms 6248 KB Output is correct
85 Correct 63 ms 6204 KB Output is correct
86 Correct 64 ms 6288 KB Output is correct
87 Correct 71 ms 6248 KB Output is correct
88 Correct 76 ms 6204 KB Output is correct
89 Correct 91 ms 6200 KB Output is correct
90 Correct 72 ms 6200 KB Output is correct
91 Correct 89 ms 6212 KB Output is correct
92 Correct 92 ms 6212 KB Output is correct