oj.uz

답안 #445848

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
445848 2021-07-19T20:56:53 Z Bungmint Mecho (IOI09_mecho) C++17
100 / 100
 196 ms 4372 KB 
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pair<int, int>>;
using pl = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pl>;
using ld = long double;

#define all(v) (v).begin(), (v).end()
#define ar array
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound

template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
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(...)
#endif

struct custom_hash
{
    static uint64_t splitmix64(uint64_t x)
    {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const
    {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

void setIO(string s)
{
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7; //998244353;
int n, s;
int dx[] = {0,0,-1, 1}, dy[] = {-1, 1, 0,0};
char grid[801][801];
bool vis[801][801];

bool good(int x, int y){
	return (x>=0&&x<n&&y>=0&&y<n);
}


void solve()
{
	cin >> n >> s;
	for (int i=0;i<n;++i) for (int j=0;j<n;++j)cin >> grid[i][j];
	vector<vi> distFromHives(n, vi(n, INF));
	queue<pi> q;
	int mX, mY, homeX, homeY;
	for (int i=0;i<n;++i) for (int j=0;j<n;++j){
		if (grid[i][j]=='M'){
			mX = i, mY = j;
		}else if (grid[i][j]=='D'){
			homeX = i, homeY = j;
		}else if (grid[i][j] == 'H'){
			q.push({i,j});
			distFromHives[i][j] = 0;
		}
	}
	while(sz(q)){
		auto [x,y] = q.front();
		q.pop();
		for (int i=0;i<4;++i){
			int nX = x + dx[i], nY = y + dy[i];
			if (good(nX, nY)&&grid[nX][nY]!='D'&&grid[nX][nY]!='T'&&distFromHives[nX][nY]>distFromHives[x][y]+1){
				distFromHives[nX][nY] = distFromHives[x][y] + 1;
				q.push({nX, nY});
			}
		}
	}
	dbg(distFromHives);
	int l = 0, r = distFromHives[mX][mY]-1, ans = -1;
	while(l<=r){
		int start = l + (r-l)/2, t = start;
		queue<pi> nxt;
		queue<pair<int,pi>> cur;
		memset(vis, 0, sizeof(vis));
		vis[mX][mY] = 1;
		cur.push({0,{mX, mY}});
		while(sz(cur)){
			while(sz(cur)){
				int d = cur.front().fi;
				auto [x,y] = cur.front().se;
				cur.pop();
				if (d==s){
					if (distFromHives[x][y]>t+1)nxt.push({x,y});
					continue;
				}
				for (int i=0;i<4;++i){
					int nX = x + dx[i], nY = y + dy[i];
					if (good(nX, nY)&&!vis[nX][nY]&&grid[nX][nY]!='T'&&distFromHives[nX][nY]>t){
						vis[nX][nY] = 1;
						cur.push({d+1,{nX, nY}});
					}
				}
			}
			while(sz(nxt)) cur.push({0, nxt.front()}), nxt.pop();
			t++;
		}
		
		if (vis[homeX][homeY]) ans = start, l = start+1;
		else r = start-1;
	}
	
	cout << ans << endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int testcase=1;
    // cin >> testcase;
    while (testcase--)
    {
        solve();
    }
}

Compilation message

mecho.cpp: In function 'void setIO(std::string)':
mecho.cpp:74:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:75:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp: In function 'void solve()':
mecho.cpp:122:37: warning: 'mY' may be used uninitialized in this function [-Wmaybe-uninitialized]
  122 |  int l = 0, r = distFromHives[mX][mY]-1, ans = -1;
      |                                     ^
mecho.cpp:122:33: warning: 'mX' may be used uninitialized in this function [-Wmaybe-uninitialized]
  122 |  int l = 0, r = distFromHives[mX][mY]-1, ans = -1;
      |                                 ^
mecho.cpp:151:23: warning: 'homeY' may be used uninitialized in this function [-Wmaybe-uninitialized]
  151 |   if (vis[homeX][homeY]) ans = start, l = start+1;
      |       ~~~~~~~~~~~~~~~~^
mecho.cpp:151:23: warning: 'homeX' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 844 KB Output is correct
6 Correct 1 ms 844 KB Output is correct
7 Correct 102 ms 4212 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 1 ms 844 KB Output is correct
11 Correct 1 ms 844 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 1 ms 844 KB Output is correct
16 Correct 1 ms 844 KB Output is correct
17 Correct 1 ms 972 KB Output is correct
18 Correct 1 ms 972 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 1 ms 972 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 1 ms 972 KB Output is correct
24 Correct 1 ms 972 KB Output is correct
25 Correct 1 ms 972 KB Output is correct
26 Correct 1 ms 972 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 1 ms 972 KB Output is correct
29 Correct 1 ms 972 KB Output is correct
30 Correct 1 ms 972 KB Output is correct
31 Correct 1 ms 972 KB Output is correct
32 Correct 1 ms 972 KB Output is correct
33 Correct 7 ms 1612 KB Output is correct
34 Correct 7 ms 1612 KB Output is correct
35 Correct 22 ms 1724 KB Output is correct
36 Correct 8 ms 1868 KB Output is correct
37 Correct 8 ms 1908 KB Output is correct
38 Correct 33 ms 1796 KB Output is correct
39 Correct 12 ms 1996 KB Output is correct
40 Correct 10 ms 2108 KB Output is correct
41 Correct 41 ms 2004 KB Output is correct
42 Correct 12 ms 2236 KB Output is correct
43 Correct 12 ms 2348 KB Output is correct
44 Correct 50 ms 2240 KB Output is correct
45 Correct 14 ms 2492 KB Output is correct
46 Correct 14 ms 2548 KB Output is correct
47 Correct 62 ms 2596 KB Output is correct
48 Correct 17 ms 2764 KB Output is correct
49 Correct 17 ms 2756 KB Output is correct
50 Correct 75 ms 2868 KB Output is correct
51 Correct 19 ms 3140 KB Output is correct
52 Correct 21 ms 3020 KB Output is correct
53 Correct 86 ms 3152 KB Output is correct
54 Correct 22 ms 3404 KB Output is correct
55 Correct 22 ms 3448 KB Output is correct
56 Correct 106 ms 3440 KB Output is correct
57 Correct 27 ms 3688 KB Output is correct
58 Correct 25 ms 3768 KB Output is correct
59 Correct 125 ms 3760 KB Output is correct
60 Correct 29 ms 3988 KB Output is correct
61 Correct 29 ms 4004 KB Output is correct
62 Correct 181 ms 4112 KB Output is correct
63 Correct 126 ms 3992 KB Output is correct
64 Correct 181 ms 4096 KB Output is correct
65 Correct 196 ms 4096 KB Output is correct
66 Correct 162 ms 4104 KB Output is correct
67 Correct 173 ms 4100 KB Output is correct
68 Correct 79 ms 4016 KB Output is correct
69 Correct 47 ms 4044 KB Output is correct
70 Correct 45 ms 4032 KB Output is correct
71 Correct 37 ms 4028 KB Output is correct
72 Correct 40 ms 4024 KB Output is correct
73 Correct 60 ms 4272 KB Output is correct
74 Correct 79 ms 4372 KB Output is correct
75 Correct 72 ms 4276 KB Output is correct
76 Correct 74 ms 4280 KB Output is correct
77 Correct 76 ms 4372 KB Output is correct
78 Correct 87 ms 4348 KB Output is correct
79 Correct 67 ms 4240 KB Output is correct
80 Correct 85 ms 4348 KB Output is correct
81 Correct 83 ms 4348 KB Output is correct
82 Correct 74 ms 4360 KB Output is correct
83 Correct 97 ms 4308 KB Output is correct
84 Correct 81 ms 4308 KB Output is correct
85 Correct 82 ms 4292 KB Output is correct
86 Correct 96 ms 4300 KB Output is correct
87 Correct 84 ms 4212 KB Output is correct
88 Correct 99 ms 4252 KB Output is correct
89 Correct 96 ms 4236 KB Output is correct
90 Correct 103 ms 4252 KB Output is correct
91 Correct 126 ms 4156 KB Output is correct
92 Correct 101 ms 4140 KB Output is correct