oj.uz

답안 #233147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233147 2020-05-19T14:41:07 Z anubhavdhar Mecho (IOI09_mecho) C++14
49 / 100
 232 ms 8484 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;

	// F0R(i, N)
	// {
	// 	F0R(j, N)
	// 		if(disB[i][j] == inf) cout<<'-';
	// 		else	cout<<disB[i][j];
	// 	cout<<'\n';
	// }


	while(lo < hi - 1)
	{
		mid = (lo + hi)/2;
		// cout<<"mid = "<<mid<<'\n';
		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();
			// cout<<"disM["<<x<<"]["<<y<<"] = "<<disM[x][y]<<'\n';
			if (disB[x][y] <= mid + (disM[x][y])/S)
			{
				disM[x][y] = inf;
				// cout<<x<<','<<y<<" is unreachable\n";
				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;
		// F0R(i, N)	
		// {
		// 	F0R(j, N)
		// 		if(disM[i][j] == inf) cout<<'-' ;
		// 		else cout<<disM[i][j];
		// 	cout<<'\n';
		// }
	}
	mid = 0;//(lo + hi)/2;
	// cout<<"mid = "<<mid<<'\n';
	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();
		// cout<<"disM["<<x<<"]["<<y<<"] = "<<disM[x][y]<<'\n';
		if (disB[x][y] <= mid + (disM[x][y])/S)
		{
			disM[x][y] = inf;
			// cout<<x<<','<<y<<" is unreachable\n";
			continue;
		}
		// else
		// {
		// 	cout<<"doable as "<<disB[x][y]<<" >= "<<mid<<"+"<<disM[x][y]<<'/'<<S<<" = "<<mid + disM[x][y]/S<<'\n';
		// }
		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));
			}
	}
	// F0R(i, N)	
	// {
	// 	F0R(j, N)
	// 		if(disM[i][j] == inf) cout<<'-' ;
	// 		else cout<<disM[i][j];
	// 	cout<<' '<<'\n';
	// }



	cout<<((disM[H][K] == inf) ? -1 : lo );

	return 0;
}

Subtask #1
49.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Correct 5 ms 384 KB Output is correct
4 Incorrect 5 ms 384 KB Output isn't correct
5 Correct 5 ms 512 KB Output is correct
6 Incorrect 5 ms 512 KB Output isn't correct
7 Incorrect 113 ms 8312 KB Output isn't correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 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 Correct 5 ms 896 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 640 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 5 ms 640 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 5 ms 768 KB Output is correct
24 Correct 5 ms 768 KB Output is correct
25 Correct 5 ms 896 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 5 ms 896 KB Output is correct
28 Correct 5 ms 896 KB Output is correct
29 Correct 5 ms 1024 KB Output is correct
30 Correct 5 ms 1024 KB Output is correct
31 Correct 5 ms 1024 KB Output is correct
32 Correct 5 ms 1024 KB Output is correct
33 Incorrect 21 ms 3584 KB Output isn't correct
34 Incorrect 27 ms 3584 KB Output isn't correct
35 Correct 30 ms 3584 KB Output is correct
36 Incorrect 26 ms 4096 KB Output isn't correct
37 Incorrect 33 ms 3968 KB Output isn't correct
38 Correct 40 ms 4096 KB Output is correct
39 Incorrect 32 ms 4480 KB Output isn't correct
40 Incorrect 45 ms 4560 KB Output isn't correct
41 Correct 47 ms 4480 KB Output is correct
42 Incorrect 39 ms 4992 KB Output isn't correct
43 Incorrect 49 ms 4992 KB Output isn't correct
44 Correct 57 ms 4992 KB Output is correct
45 Incorrect 45 ms 5504 KB Output isn't correct
46 Incorrect 61 ms 5504 KB Output isn't correct
47 Correct 73 ms 5504 KB Output is correct
48 Incorrect 53 ms 6016 KB Output isn't correct
49 Incorrect 70 ms 6016 KB Output isn't correct
50 Correct 86 ms 6016 KB Output is correct
51 Incorrect 63 ms 6528 KB Output isn't correct
52 Incorrect 85 ms 6528 KB Output isn't correct
53 Correct 107 ms 6528 KB Output is correct
54 Incorrect 72 ms 7040 KB Output isn't correct
55 Incorrect 97 ms 7040 KB Output isn't correct
56 Correct 118 ms 7040 KB Output is correct
57 Incorrect 80 ms 7552 KB Output isn't correct
58 Incorrect 107 ms 7552 KB Output isn't correct
59 Correct 139 ms 7672 KB Output is correct
60 Incorrect 93 ms 8184 KB Output isn't correct
61 Incorrect 123 ms 8064 KB Output isn't correct
62 Correct 165 ms 8184 KB Output is correct
63 Correct 127 ms 8056 KB Output is correct
64 Correct 232 ms 8184 KB Output is correct
65 Correct 206 ms 8056 KB Output is correct
66 Correct 179 ms 8184 KB Output is correct
67 Correct 144 ms 8072 KB Output is correct
68 Correct 72 ms 8064 KB Output is correct
69 Correct 80 ms 8056 KB Output is correct
70 Correct 65 ms 8064 KB Output is correct
71 Correct 59 ms 8060 KB Output is correct
72 Incorrect 60 ms 8056 KB Output isn't correct
73 Incorrect 96 ms 8440 KB Output isn't correct
74 Correct 100 ms 8312 KB Output is correct
75 Correct 96 ms 8312 KB Output is correct
76 Correct 82 ms 8312 KB Output is correct
77 Correct 94 ms 8484 KB Output is correct
78 Correct 94 ms 8312 KB Output is correct
79 Correct 90 ms 8320 KB Output is correct
80 Correct 88 ms 8312 KB Output is correct
81 Correct 94 ms 8440 KB Output is correct
82 Correct 93 ms 8440 KB Output is correct
83 Correct 98 ms 8184 KB Output is correct
84 Correct 105 ms 8184 KB Output is correct
85 Correct 100 ms 8288 KB Output is correct
86 Correct 103 ms 8184 KB Output is correct
87 Correct 102 ms 8284 KB Output is correct
88 Correct 101 ms 8188 KB Output is correct
89 Correct 113 ms 8184 KB Output is correct
90 Correct 112 ms 8312 KB Output is correct
91 Correct 114 ms 8184 KB Output is correct
92 Correct 107 ms 8184 KB Output is correct