oj.uz

답안 #1037096

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037096 2024-07-28T04:15:07 Z sssamui Mecho (IOI09_mecho) C++17
73 / 100
 141 ms 4004 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;

vector<vector<char>> grd(802, vector<char>(802, 'T'));
vector<vector<bool>> swm(802, vector<bool>(802, false));
vector<vector<int>> btime(802, vector<int>(802, 0));
int sttr, sttc;
int dstr, dstc;
int h, s;

vector<int> radd = { -1, 0, 1, 0 };
vector<int> cadd = { 0, -1, 0, 1 };

bool check(int tchk)
{
	queue<pair<int, pair<int, int>>> bfs;
	bfs.push({ 0, {sttr, sttc} });
	vector<vector<bool>> poss(h + 2, vector<bool>(h + 2, false));
	poss[sttr][sttc] = true;
	while (!bfs.empty() && !poss[dstr][dstc])
	{
		int r = bfs.front().second.first, c = bfs.front().second.second, dst = bfs.front().first;
		bfs.pop();
		for (int dir = 0; dir < 4; dir++) if (!poss[r + radd[dir]][c + cadd[dir]]) if (grd[r + radd[dir]][c + cadd[dir]] == 'G')
			if ((dst + 1) / s < btime[r + radd[dir]][c + cadd[dir]] - tchk)
			{
				poss[r + radd[dir]][c + cadd[dir]] = true;
				bfs.push({ dst + 1, {r + radd[dir], c + cadd[dir]} });
			}
	}

	return poss[dstr][dstc];
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> h >> s;
	queue<pair<int, int>> swmpcs;
	for (int i = 1; i <= h; i++) for (int j = 1; j <= h; j++)
	{
		cin >> grd[i][j];
		if (grd[i][j] == 'M')
		{
			sttr = i;
			sttc = j;
			grd[i][j] = 'G';
		}

		else if (grd[i][j] == 'D')
		{
			dstr = i;
			dstc = j;
			grd[i][j] = 'T';
		}

		else if (grd[i][j] == 'H')
		{
			swmpcs.push({ i, j });
			swm[i][j] = true;
			grd[i][j] = 'T';
		}
	}

	while (!swmpcs.empty())
	{
		int r = swmpcs.front().first, c = swmpcs.front().second;
		swmpcs.pop();
		for (int dir = 0; dir < 4; dir++) if ((!swm[r + radd[dir]][c + cadd[dir]]) && (grd[r + radd[dir]][c + cadd[dir]] == 'G'))
		{
			swm[r + radd[dir]][c + cadd[dir]] = true;
			btime[r + radd[dir]][c + cadd[dir]] = btime[r][c] + 1;
			swmpcs.push({ r + radd[dir], c + cadd[dir] });
		}
	}


	btime[dstr][dstc] = btime[sttr][sttc];
	grd[dstr][dstc] = 'G';

	if (!check(0)) cout << -1;
	else
	{
		int l = 0, r = btime[sttr][sttc] - 1;
		while (l < r)
		{
			int mid = l + (r - l + 1) / 2;
			if (check(mid)) l = mid;
			else r = mid - 1;
		}

		cout << l;
	}
}

Subtask #1
73.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 3672 KB Output isn't correct
2 Correct 2 ms 3676 KB Output is correct
3 Incorrect 2 ms 3676 KB Output isn't correct
4 Incorrect 2 ms 3676 KB Output isn't correct
5 Incorrect 2 ms 3676 KB Output isn't correct
6 Correct 2 ms 3676 KB Output is correct
7 Correct 58 ms 3784 KB Output is correct
8 Correct 2 ms 3676 KB Output is correct
9 Incorrect 2 ms 3728 KB Output isn't correct
10 Incorrect 2 ms 3548 KB Output isn't correct
11 Incorrect 2 ms 3676 KB Output isn't correct
12 Incorrect 2 ms 3672 KB Output isn't correct
13 Incorrect 2 ms 3672 KB Output isn't correct
14 Correct 2 ms 3676 KB Output is correct
15 Correct 2 ms 3676 KB Output is correct
16 Correct 2 ms 3676 KB Output is correct
17 Correct 2 ms 3676 KB Output is correct
18 Correct 2 ms 3676 KB Output is correct
19 Correct 2 ms 3676 KB Output is correct
20 Correct 2 ms 3676 KB Output is correct
21 Correct 2 ms 3676 KB Output is correct
22 Correct 2 ms 3676 KB Output is correct
23 Correct 2 ms 3676 KB Output is correct
24 Correct 2 ms 3676 KB Output is correct
25 Correct 2 ms 3676 KB Output is correct
26 Correct 2 ms 3676 KB Output is correct
27 Correct 2 ms 3676 KB Output is correct
28 Correct 2 ms 3672 KB Output is correct
29 Correct 4 ms 3676 KB Output is correct
30 Correct 2 ms 3676 KB Output is correct
31 Correct 3 ms 3676 KB Output is correct
32 Correct 2 ms 3676 KB Output is correct
33 Correct 7 ms 3676 KB Output is correct
34 Correct 5 ms 3676 KB Output is correct
35 Correct 15 ms 3828 KB Output is correct
36 Correct 5 ms 3676 KB Output is correct
37 Correct 5 ms 3780 KB Output is correct
38 Correct 20 ms 3832 KB Output is correct
39 Correct 5 ms 3676 KB Output is correct
40 Correct 6 ms 3676 KB Output is correct
41 Correct 24 ms 3928 KB Output is correct
42 Correct 8 ms 3780 KB Output is correct
43 Correct 8 ms 3676 KB Output is correct
44 Correct 29 ms 3844 KB Output is correct
45 Correct 9 ms 3672 KB Output is correct
46 Correct 9 ms 3784 KB Output is correct
47 Correct 36 ms 3676 KB Output is correct
48 Correct 9 ms 3676 KB Output is correct
49 Correct 10 ms 3756 KB Output is correct
50 Correct 45 ms 3788 KB Output is correct
51 Correct 9 ms 3676 KB Output is correct
52 Correct 9 ms 3780 KB Output is correct
53 Correct 57 ms 3676 KB Output is correct
54 Correct 13 ms 3676 KB Output is correct
55 Correct 13 ms 3676 KB Output is correct
56 Correct 60 ms 3672 KB Output is correct
57 Correct 14 ms 3784 KB Output is correct
58 Correct 13 ms 3784 KB Output is correct
59 Correct 67 ms 3884 KB Output is correct
60 Correct 14 ms 3672 KB Output is correct
61 Correct 15 ms 3676 KB Output is correct
62 Correct 78 ms 3780 KB Output is correct
63 Correct 81 ms 3880 KB Output is correct
64 Correct 141 ms 3672 KB Output is correct
65 Correct 134 ms 3676 KB Output is correct
66 Correct 118 ms 3672 KB Output is correct
67 Correct 32 ms 3672 KB Output is correct
68 Correct 40 ms 3676 KB Output is correct
69 Correct 36 ms 3676 KB Output is correct
70 Correct 35 ms 3676 KB Output is correct
71 Correct 36 ms 3676 KB Output is correct
72 Incorrect 26 ms 3788 KB Output isn't correct
73 Incorrect 23 ms 3932 KB Output isn't correct
74 Correct 51 ms 3992 KB Output is correct
75 Correct 47 ms 3928 KB Output is correct
76 Correct 46 ms 3932 KB Output is correct
77 Correct 57 ms 3928 KB Output is correct
78 Correct 24 ms 3928 KB Output is correct
79 Correct 46 ms 3928 KB Output is correct
80 Correct 43 ms 3932 KB Output is correct
81 Correct 55 ms 3932 KB Output is correct
82 Correct 44 ms 4004 KB Output is correct
83 Correct 53 ms 3928 KB Output is correct
84 Correct 53 ms 3932 KB Output is correct
85 Correct 50 ms 3928 KB Output is correct
86 Correct 61 ms 3928 KB Output is correct
87 Correct 53 ms 3972 KB Output is correct
88 Correct 57 ms 3928 KB Output is correct
89 Correct 61 ms 3928 KB Output is correct
90 Correct 61 ms 3932 KB Output is correct
91 Correct 65 ms 3932 KB Output is correct
92 Correct 58 ms 3932 KB Output is correct