oj.uz

답안 #233135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233135 2020-05-19T13:53:28 Z anubhavdhar Mecho (IOI09_mecho) C++14
21 / 100
 200 ms 7800 KB 
#include<bits/stdc++.h>

#define ll long long int
#define pb push_back
#define mp make_pair
#define FOR(i,n) for(i=0;i<(n);++i)
#define FORe(i,n) for(i=1;i<=(n);++i)
#define FORr(i,a,b) for(i=(a);i<(b);++i)
#define FORrev(i,n) for(i=(n);i>=0;--i)
#define F0R(i,n) for(int i=0;i<(n);++i)
#define F0Re(i,n) for(int i=1;i<=(n);++i)
#define F0Rr(i,a,b) for(ll i=(a);i<(b);++i)
#define F0Rrev(i,n) for(int i=(n);i>=0;--i)
#define ii pair<ll,ll>
#define vi vector<ll>
#define vii vector<ii>
#define ff first 
#define ss second
#define cd complex<double>
#define vcd vector<cd>
#define ldd long double
#define dbgLine cout<<"Line : "<<__LINE__<<'\n'
#define all(x) (x).begin(),(x).end()

using namespace std;

const short int __PRECISION = 10;

const ll MOD = 1e9+7;
const ll INF = 1e17 + 1101;
const ll LOGN = 17;
const ll MAXN = 2e5+5;
const ll ROOTN = 320;

const int inf = 1e9+2;

const ldd PI = acos(-1);
const ldd EPS = 1e-7;

int N, S, disB[900][900], disM[900][900], X, Y, H, K;
char grid[900][900];
bool vis[900][900];

inline bool inside(int i, int j)
{
	return ((i < N) && (i >= 0) && (j < N) && (j >= 0));
}

int main()
{
	
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	

	cin>>N>>S;
	queue<pair<int, int>> Q;

	F0R(i, N)
		F0R(j ,N)
		{
			cin>>grid[i][j];
			vis[i][j] = false;
			disB[i][j] = inf;
			if(grid[i][j] == 'H')
				Q.push(mp(i, j)), disB[i][j] = 0, vis[i][j] = true;
			else if(grid[i][j] == 'M')
				X = i, Y = j;
			else if(grid[i][j] == 'D')
				H = i, K = j;
		}

	while(!Q.empty())
	{
		int x = Q.front().ff, y = Q.front().ss;
		Q.pop();
		for(pair<int, int> p : {mp(0, -1), mp(0, 1), mp(1, 0), mp(-1, 0)})
			if(inside(x+p.ff, y+p.ss) && (!vis[x+p.ff][y+p.ss]) && (grid[x+p.ff][y+p.ss] == 'G' or grid[x+p.ff][y+p.ss] == 'D'))
			{
				disB[x+p.ff][y+p.ss] = disB[x][y] + 1;
				vis[x+p.ff][y+p.ss] = true;
				Q.push(mp(x+p.ff, y+p.ss));
			}
	}

	int lo = 0, hi = 4000, mid;


	while(lo < hi - 1)
	{
		mid = (lo + hi)/2;
		F0R(i, N)
			F0R(j, N)
				vis[i][j] = false, disM[i][j] = inf;
		vis[X][Y] = true;
		disM[X][Y] = 0;
		Q.push(mp(X, Y));
		while(!Q.empty())
		{
			int x = Q.front().ff, y = Q.front().ss;
			Q.pop();
			if (disB[x][y] < mid + 1 + (disM[x][y] - 1)/S)
			{
				disM[x][y] = inf;
				continue;
			}
			for(pair<int, int> p : {mp(0, -1), mp(0, 1), mp(1, 0), mp(-1, 0)})
				if(inside(x+p.ff, y+p.ss)&&(!vis[x+p.ff][y+p.ss])&&(grid[x+p.ff][y+p.ss] == 'G' or grid[x+p.ff][y+p.ss] == 'D'))
				{
					disM[x+p.ff][y+p.ss] = disM[x][y] + 1;
					vis[x+p.ff][y+p.ss] = true;
					Q.push(mp(x+p.ff, y+p.ss));
				}
		}
		if(disM[H][K] == inf)
			hi = mid;
		else
			lo = mid;
	}

	cout<<lo;

	return 0;
}

Subtask #1
21.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Incorrect 5 ms 384 KB Output isn't correct
5 Correct 4 ms 384 KB Output is correct
6 Incorrect 5 ms 384 KB Output isn't correct
7 Incorrect 107 ms 7680 KB Output isn't correct
8 Incorrect 5 ms 512 KB Output isn't correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Incorrect 5 ms 896 KB Output isn't correct
13 Incorrect 5 ms 768 KB Output isn't correct
14 Incorrect 5 ms 896 KB Output isn't correct
15 Incorrect 5 ms 512 KB Output isn't correct
16 Correct 5 ms 512 KB Output is correct
17 Incorrect 5 ms 512 KB Output isn't correct
18 Correct 5 ms 640 KB Output is correct
19 Incorrect 5 ms 768 KB Output isn't correct
20 Correct 5 ms 640 KB Output is correct
21 Incorrect 5 ms 768 KB Output isn't correct
22 Correct 5 ms 640 KB Output is correct
23 Incorrect 5 ms 768 KB Output isn't correct
24 Correct 5 ms 768 KB Output is correct
25 Incorrect 5 ms 896 KB Output isn't correct
26 Correct 5 ms 896 KB Output is correct
27 Incorrect 6 ms 896 KB Output isn't correct
28 Correct 5 ms 1024 KB Output is correct
29 Incorrect 5 ms 1024 KB Output isn't correct
30 Correct 5 ms 1024 KB Output is correct
31 Incorrect 5 ms 1024 KB Output isn't correct
32 Correct 5 ms 1024 KB Output is correct
33 Incorrect 20 ms 3456 KB Output isn't correct
34 Incorrect 25 ms 3456 KB Output isn't correct
35 Correct 29 ms 3456 KB Output is correct
36 Incorrect 25 ms 3840 KB Output isn't correct
37 Incorrect 32 ms 3840 KB Output isn't correct
38 Correct 35 ms 3840 KB Output is correct
39 Incorrect 31 ms 4352 KB Output isn't correct
40 Incorrect 39 ms 4352 KB Output isn't correct
41 Correct 46 ms 4352 KB Output is correct
42 Incorrect 38 ms 4736 KB Output isn't correct
43 Incorrect 48 ms 4736 KB Output isn't correct
44 Correct 54 ms 4864 KB Output is correct
45 Incorrect 44 ms 5248 KB Output isn't correct
46 Incorrect 59 ms 5248 KB Output isn't correct
47 Correct 69 ms 5248 KB Output is correct
48 Incorrect 51 ms 5632 KB Output isn't correct
49 Incorrect 68 ms 5632 KB Output isn't correct
50 Correct 83 ms 5752 KB Output is correct
51 Incorrect 61 ms 6016 KB Output isn't correct
52 Incorrect 76 ms 6016 KB Output isn't correct
53 Correct 100 ms 6016 KB Output is correct
54 Incorrect 68 ms 6528 KB Output isn't correct
55 Incorrect 91 ms 6648 KB Output isn't correct
56 Correct 115 ms 6528 KB Output is correct
57 Incorrect 79 ms 7040 KB Output isn't correct
58 Incorrect 107 ms 6912 KB Output isn't correct
59 Correct 131 ms 7044 KB Output is correct
60 Incorrect 86 ms 7544 KB Output isn't correct
61 Incorrect 119 ms 7424 KB Output isn't correct
62 Correct 144 ms 7424 KB Output is correct
63 Correct 115 ms 7444 KB Output is correct
64 Correct 200 ms 7544 KB Output is correct
65 Correct 184 ms 7416 KB Output is correct
66 Incorrect 162 ms 7544 KB Output isn't correct
67 Incorrect 133 ms 7416 KB Output isn't correct
68 Correct 78 ms 7416 KB Output is correct
69 Correct 69 ms 7416 KB Output is correct
70 Correct 63 ms 7416 KB Output is correct
71 Correct 54 ms 7416 KB Output is correct
72 Incorrect 52 ms 7548 KB Output isn't correct
73 Incorrect 90 ms 7800 KB Output isn't correct
74 Correct 77 ms 7672 KB Output is correct
75 Correct 89 ms 7680 KB Output is correct
76 Correct 75 ms 7800 KB Output is correct
77 Correct 86 ms 7672 KB Output is correct
78 Incorrect 87 ms 7672 KB Output isn't correct
79 Correct 72 ms 7672 KB Output is correct
80 Correct 82 ms 7800 KB Output is correct
81 Correct 89 ms 7672 KB Output is correct
82 Correct 84 ms 7672 KB Output is correct
83 Correct 94 ms 7672 KB Output is correct
84 Correct 92 ms 7544 KB Output is correct
85 Correct 91 ms 7544 KB Output is correct
86 Correct 100 ms 7544 KB Output is correct
87 Correct 92 ms 7672 KB Output is correct
88 Correct 89 ms 7544 KB Output is correct
89 Correct 95 ms 7552 KB Output is correct
90 Correct 102 ms 7672 KB Output is correct
91 Correct 102 ms 7544 KB Output is correct
92 Correct 98 ms 7544 KB Output is correct