oj.uz

답안 #533123

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533123 2022-03-04T21:52:18 Z Bungmint Mecho (IOI09_mecho) C++17
74 / 100
 1000 ms 9284 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
}

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));
	vector<vi> mecho(n, vi(n, INF)), time(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(all(mecho[i]), INF), fill(all(time[i]), INF);
		mecho[st.fi][st.se] = 0;
		time[st.fi][st.se] = mid;
		queue<pii> q;
		q.push(st);
		while (sz(q)) {
			auto [r, c] = q.front();
			q.pop();
			if (r == 3 && c == 3) dbg(time[r][c], distHive[r][c]);
			if (time[r][c] >= distHive[r][c]) continue;
			queue<pii> s;
			dbg(r, c);
			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] <= time[r][c]) continue;
					if (ckmin(mecho[nx][ny], mecho[x][y] + 1)) {
						s.push({nx, ny});
						time[nx][ny] = time[r][c] + 1;
					}
				}
			}
		}
		dbg(mecho);
		if (time[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 solve()':
mecho.cpp:71:18: warning: statement has no effect [-Wunused-value]
   71 | #define dbg(...) 42
      |                  ^~
mecho.cpp:144:26: note: in expansion of macro 'dbg'
  144 |    if (r == 3 && c == 3) dbg(time[r][c], distHive[r][c]);
      |                          ^~~
mecho.cpp:71:18: warning: statement has no effect [-Wunused-value]
   71 | #define dbg(...) 42
      |                  ^~
mecho.cpp:147:4: note: in expansion of macro 'dbg'
  147 |    dbg(r, c);
      |    ^~~
mecho.cpp:71:18: warning: statement has no effect [-Wunused-value]
   71 | #define dbg(...) 42
      |                  ^~
mecho.cpp:168:3: note: in expansion of macro 'dbg'
  168 |   dbg(mecho);
      |   ^~~
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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 771 ms 9096 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 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 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 6 ms 2044 KB Output is correct
34 Correct 5 ms 1996 KB Output is correct
35 Correct 296 ms 2028 KB Output is correct
36 Correct 8 ms 2584 KB Output is correct
37 Correct 9 ms 2584 KB Output is correct
38 Correct 424 ms 2508 KB Output is correct
39 Correct 9 ms 3136 KB Output is correct
40 Correct 8 ms 3168 KB Output is correct
41 Correct 721 ms 3152 KB Output is correct
42 Correct 11 ms 3832 KB Output is correct
43 Correct 12 ms 3764 KB Output is correct
44 Correct 935 ms 3812 KB Output is correct
45 Correct 13 ms 4428 KB Output is correct
46 Correct 10 ms 4428 KB Output is correct
47 Execution timed out 1081 ms 4548 KB Time limit exceeded
48 Correct 16 ms 5376 KB Output is correct
49 Correct 12 ms 5324 KB Output is correct
50 Execution timed out 1080 ms 5324 KB Time limit exceeded
51 Correct 20 ms 6176 KB Output is correct
52 Correct 21 ms 6092 KB Output is correct
53 Execution timed out 1084 ms 6172 KB Time limit exceeded
54 Correct 20 ms 6988 KB Output is correct
55 Correct 16 ms 6988 KB Output is correct
56 Execution timed out 1081 ms 6988 KB Time limit exceeded
57 Correct 23 ms 7884 KB Output is correct
58 Correct 20 ms 7980 KB Output is correct
59 Execution timed out 1082 ms 8004 KB Time limit exceeded
60 Correct 27 ms 8908 KB Output is correct
61 Correct 21 ms 8904 KB Output is correct
62 Execution timed out 1092 ms 8908 KB Time limit exceeded
63 Correct 152 ms 8988 KB Output is correct
64 Correct 196 ms 8908 KB Output is correct
65 Correct 166 ms 9000 KB Output is correct
66 Correct 142 ms 8908 KB Output is correct
67 Correct 169 ms 8988 KB Output is correct
68 Correct 48 ms 9016 KB Output is correct
69 Correct 48 ms 9012 KB Output is correct
70 Correct 37 ms 8908 KB Output is correct
71 Correct 52 ms 8940 KB Output is correct
72 Correct 28 ms 8964 KB Output is correct
73 Correct 51 ms 9164 KB Output is correct
74 Correct 368 ms 9260 KB Output is correct
75 Correct 246 ms 9268 KB Output is correct
76 Correct 158 ms 9264 KB Output is correct
77 Correct 270 ms 9164 KB Output is correct
78 Correct 312 ms 9240 KB Output is correct
79 Correct 246 ms 9232 KB Output is correct
80 Correct 191 ms 9244 KB Output is correct
81 Correct 209 ms 9236 KB Output is correct
82 Correct 342 ms 9240 KB Output is correct
83 Correct 268 ms 9200 KB Output is correct
84 Execution timed out 1053 ms 9196 KB Time limit exceeded
85 Correct 437 ms 9284 KB Output is correct
86 Correct 307 ms 9196 KB Output is correct
87 Correct 677 ms 9196 KB Output is correct
88 Correct 426 ms 9164 KB Output is correct
89 Execution timed out 1093 ms 9156 KB Time limit exceeded
90 Correct 734 ms 9280 KB Output is correct
91 Execution timed out 1085 ms 9036 KB Time limit exceeded
92 Correct 644 ms 9144 KB Output is correct