oj.uz

Submission #533124

# Submission time Handle Problem Language Result Execution time Memory
533124 2022-03-04T21:57:56 Z Bungmint Mecho (IOI09_mecho) C++17
74 / 100
 1000 ms 9128 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>
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];
int timeT[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), fill(timeT[i], timeT[i] + n, INF);
		mecho[st.fi][st.se] = 0;
		timeT[st.fi][st.se] = mid;
		queue<pii> q;
		q.push(st);
		while (sz(q)) {
			auto [r, c] = q.front();
			q.pop();
			if (timeT[r][c] >= 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({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] <= timeT[r][c]) continue;
					if (ckmin(mecho[nx][ny], mecho[x][y] + 1)) {
						s.push({nx, ny});
						timeT[nx][ny] = timeT[r][c] + 1;
					}
				}
			}
		}
		if (timeT[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
74.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 0 ms 332 KB Output is correct
4 Correct 0 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 751 ms 8908 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 716 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 2 ms 712 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 0 ms 332 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 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 1 ms 588 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 716 KB Output is correct
28 Correct 1 ms 716 KB Output is correct
29 Correct 1 ms 716 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 2 ms 844 KB Output is correct
32 Correct 1 ms 716 KB Output is correct
33 Correct 6 ms 3148 KB Output is correct
34 Correct 5 ms 3148 KB Output is correct
35 Correct 260 ms 3148 KB Output is correct
36 Correct 8 ms 3788 KB Output is correct
37 Correct 7 ms 3788 KB Output is correct
38 Correct 411 ms 3772 KB Output is correct
39 Correct 11 ms 4308 KB Output is correct
40 Correct 9 ms 4312 KB Output is correct
41 Correct 649 ms 4300 KB Output is correct
42 Correct 11 ms 4812 KB Output is correct
43 Correct 11 ms 4812 KB Output is correct
44 Correct 882 ms 4852 KB Output is correct
45 Correct 14 ms 5324 KB Output is correct
46 Correct 11 ms 5324 KB Output is correct
47 Execution timed out 1089 ms 5324 KB Time limit exceeded
48 Correct 16 ms 5996 KB Output is correct
49 Correct 14 ms 5964 KB Output is correct
50 Execution timed out 1091 ms 6008 KB Time limit exceeded
51 Correct 31 ms 6604 KB Output is correct
52 Correct 16 ms 6604 KB Output is correct
53 Execution timed out 1089 ms 6596 KB Time limit exceeded
54 Correct 33 ms 7312 KB Output is correct
55 Correct 20 ms 7412 KB Output is correct
56 Execution timed out 1076 ms 7372 KB Time limit exceeded
57 Correct 24 ms 8012 KB Output is correct
58 Correct 26 ms 8104 KB Output is correct
59 Execution timed out 1092 ms 8008 KB Time limit exceeded
60 Correct 33 ms 8808 KB Output is correct
61 Correct 33 ms 8780 KB Output is correct
62 Execution timed out 1081 ms 8916 KB Time limit exceeded
63 Correct 154 ms 8800 KB Output is correct
64 Correct 207 ms 8792 KB Output is correct
65 Correct 175 ms 8900 KB Output is correct
66 Correct 177 ms 8788 KB Output is correct
67 Correct 155 ms 8796 KB Output is correct
68 Correct 44 ms 8780 KB Output is correct
69 Correct 78 ms 8832 KB Output is correct
70 Correct 38 ms 8824 KB Output is correct
71 Correct 46 ms 8772 KB Output is correct
72 Correct 33 ms 8824 KB Output is correct
73 Correct 49 ms 9064 KB Output is correct
74 Correct 311 ms 9028 KB Output is correct
75 Correct 217 ms 9076 KB Output is correct
76 Correct 159 ms 9064 KB Output is correct
77 Correct 248 ms 9076 KB Output is correct
78 Correct 279 ms 9048 KB Output is correct
79 Correct 223 ms 9044 KB Output is correct
80 Correct 200 ms 9052 KB Output is correct
81 Correct 200 ms 9104 KB Output is correct
82 Correct 286 ms 9052 KB Output is correct
83 Correct 253 ms 9012 KB Output is correct
84 Execution timed out 1016 ms 9128 KB Time limit exceeded
85 Correct 391 ms 9024 KB Output is correct
86 Correct 321 ms 9012 KB Output is correct
87 Correct 635 ms 9016 KB Output is correct
88 Correct 454 ms 9036 KB Output is correct
89 Execution timed out 1077 ms 9092 KB Time limit exceeded
90 Correct 777 ms 8956 KB Output is correct
91 Execution timed out 1075 ms 8828 KB Time limit exceeded
92 Correct 598 ms 8956 KB Output is correct