| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 233137 |
2020-05-19T14:00:59 Z |
anubhavdhar |
Mecho (IOI09_mecho) |
C++14 |
|
206 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 = -1, 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 ((disM[x][y]%S==0) ? (disB[x][y] <= mid + disM[x][y]/S) : (disB[x][y] < mid + (disM[x][y])/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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 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 |
4 ms |
384 KB |
Output isn't correct |
| 5 |
Incorrect |
4 ms |
384 KB |
Output isn't correct |
| 6 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 7 |
Correct |
105 ms |
7552 KB |
Output is correct |
| 8 |
Correct |
5 ms |
512 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
512 KB |
Output is correct |
| 11 |
Incorrect |
4 ms |
512 KB |
Output isn't 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 |
Incorrect |
4 ms |
512 KB |
Output isn't correct |
| 17 |
Correct |
5 ms |
640 KB |
Output is correct |
| 18 |
Incorrect |
5 ms |
640 KB |
Output isn't correct |
| 19 |
Correct |
5 ms |
640 KB |
Output is correct |
| 20 |
Incorrect |
5 ms |
640 KB |
Output isn't correct |
| 21 |
Correct |
5 ms |
640 KB |
Output is correct |
| 22 |
Incorrect |
5 ms |
768 KB |
Output isn't correct |
| 23 |
Correct |
5 ms |
768 KB |
Output is correct |
| 24 |
Incorrect |
5 ms |
768 KB |
Output isn't correct |
| 25 |
Correct |
5 ms |
896 KB |
Output is correct |
| 26 |
Incorrect |
5 ms |
896 KB |
Output isn't correct |
| 27 |
Correct |
5 ms |
896 KB |
Output is correct |
| 28 |
Incorrect |
5 ms |
896 KB |
Output isn't correct |
| 29 |
Correct |
5 ms |
1024 KB |
Output is correct |
| 30 |
Incorrect |
5 ms |
1024 KB |
Output isn't correct |
| 31 |
Correct |
5 ms |
1024 KB |
Output is correct |
| 32 |
Incorrect |
5 ms |
1152 KB |
Output isn't correct |
| 33 |
Incorrect |
20 ms |
3456 KB |
Output isn't correct |
| 34 |
Incorrect |
24 ms |
3456 KB |
Output isn't correct |
| 35 |
Incorrect |
29 ms |
3456 KB |
Output isn't correct |
| 36 |
Incorrect |
25 ms |
3968 KB |
Output isn't correct |
| 37 |
Incorrect |
32 ms |
3840 KB |
Output isn't correct |
| 38 |
Incorrect |
36 ms |
3840 KB |
Output isn't correct |
| 39 |
Incorrect |
31 ms |
4352 KB |
Output isn't correct |
| 40 |
Incorrect |
40 ms |
4352 KB |
Output isn't correct |
| 41 |
Incorrect |
44 ms |
4352 KB |
Output isn't correct |
| 42 |
Incorrect |
37 ms |
4736 KB |
Output isn't correct |
| 43 |
Incorrect |
46 ms |
4736 KB |
Output isn't correct |
| 44 |
Incorrect |
56 ms |
4736 KB |
Output isn't correct |
| 45 |
Incorrect |
43 ms |
5248 KB |
Output isn't correct |
| 46 |
Incorrect |
56 ms |
5248 KB |
Output isn't correct |
| 47 |
Incorrect |
72 ms |
5248 KB |
Output isn't correct |
| 48 |
Incorrect |
51 ms |
5632 KB |
Output isn't correct |
| 49 |
Incorrect |
68 ms |
5632 KB |
Output isn't correct |
| 50 |
Incorrect |
81 ms |
5632 KB |
Output isn't correct |
| 51 |
Incorrect |
59 ms |
6016 KB |
Output isn't correct |
| 52 |
Incorrect |
79 ms |
6136 KB |
Output isn't correct |
| 53 |
Incorrect |
95 ms |
6016 KB |
Output isn't correct |
| 54 |
Incorrect |
67 ms |
6528 KB |
Output isn't correct |
| 55 |
Incorrect |
92 ms |
6528 KB |
Output isn't correct |
| 56 |
Incorrect |
114 ms |
6528 KB |
Output isn't correct |
| 57 |
Incorrect |
78 ms |
7004 KB |
Output isn't correct |
| 58 |
Incorrect |
100 ms |
7032 KB |
Output isn't correct |
| 59 |
Incorrect |
131 ms |
7032 KB |
Output isn't correct |
| 60 |
Incorrect |
86 ms |
7424 KB |
Output isn't correct |
| 61 |
Incorrect |
122 ms |
7424 KB |
Output isn't correct |
| 62 |
Incorrect |
152 ms |
7424 KB |
Output isn't correct |
| 63 |
Correct |
134 ms |
7544 KB |
Output is correct |
| 64 |
Correct |
206 ms |
7424 KB |
Output is correct |
| 65 |
Incorrect |
201 ms |
7416 KB |
Output isn't correct |
| 66 |
Correct |
170 ms |
7416 KB |
Output is correct |
| 67 |
Correct |
133 ms |
7416 KB |
Output is correct |
| 68 |
Incorrect |
71 ms |
7544 KB |
Output isn't correct |
| 69 |
Correct |
67 ms |
7416 KB |
Output is correct |
| 70 |
Incorrect |
56 ms |
7416 KB |
Output isn't correct |
| 71 |
Incorrect |
56 ms |
7424 KB |
Output isn't correct |
| 72 |
Incorrect |
52 ms |
7424 KB |
Output isn't correct |
| 73 |
Incorrect |
89 ms |
7672 KB |
Output isn't correct |
| 74 |
Correct |
84 ms |
7680 KB |
Output is correct |
| 75 |
Incorrect |
89 ms |
7672 KB |
Output isn't correct |
| 76 |
Correct |
83 ms |
7672 KB |
Output is correct |
| 77 |
Incorrect |
86 ms |
7648 KB |
Output isn't correct |
| 78 |
Correct |
96 ms |
7680 KB |
Output is correct |
| 79 |
Incorrect |
80 ms |
7672 KB |
Output isn't correct |
| 80 |
Incorrect |
85 ms |
7800 KB |
Output isn't correct |
| 81 |
Incorrect |
94 ms |
7672 KB |
Output isn't correct |
| 82 |
Incorrect |
86 ms |
7672 KB |
Output isn't correct |
| 83 |
Incorrect |
96 ms |
7552 KB |
Output isn't correct |
| 84 |
Correct |
98 ms |
7672 KB |
Output is correct |
| 85 |
Incorrect |
89 ms |
7656 KB |
Output isn't correct |
| 86 |
Incorrect |
100 ms |
7672 KB |
Output isn't correct |
| 87 |
Incorrect |
94 ms |
7552 KB |
Output isn't correct |
| 88 |
Incorrect |
96 ms |
7672 KB |
Output isn't correct |
| 89 |
Correct |
97 ms |
7544 KB |
Output is correct |
| 90 |
Incorrect |
106 ms |
7544 KB |
Output isn't correct |
| 91 |
Incorrect |
99 ms |
7544 KB |
Output isn't correct |
| 92 |
Incorrect |
100 ms |
7544 KB |
Output isn't correct |
