oj.uz

Submission #386178

# Submission time Handle Problem Language Result Execution time Memory
386178 2021-04-06T00:55:21 Z ignaciocanta Mecho (IOI09_mecho) C++14
100 / 100
 226 ms 7660 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;
 
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert
 
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+9; //change this
const tint mod = 998244353;
const int MX = 805;
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-5;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
template<class T> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redondea p abajo
 
void NACHO(string name = ""){
    ios_base::sync_with_stdio(0); cin.tie(0);
    if(sz(name)){
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}

string a[MX];
int x, y, sx, sy;
int dist[MX][MX];
int distM[MX][MX];
bool vis[MX][MX];
int n, s;

void bfs(){
	queue<pi> q;
	F0R(i, n){
		F0R(j, n){
			dist[i][j] = inf;
			if(a[i][j] == 'H'){
				dist[i][j] = 0;
				vis[i][j] = 1;
				q.push(mp(i, j));
			}
		}
	}
	while(sz(q)){
		auto u = q.front(); q.pop();
		F0R(k, 4){
			int xx = u.f+dx[k], yy = u.s+dy[k];
			if(valid(xx, yy, n, n) && !vis[xx][yy] && (a[xx][yy] == 'G' || a[xx][yy] == 'M')){
				dist[xx][yy] = dist[u.f][u.s]+1;
				vis[xx][yy] = 1;
				q.push(mp(xx, yy));
			}
		}
	}
}

bool bee[MX][MX];

bool can(int m){
	F0R(i, n) F0R(j, n) vis[i][j] = 0;
	vis[x][y] = 1;
	queue<pi> q;
	q.push(mp(x, y));
	if(dist[x][y]-m <= 0) return 0;
	while(sz(q)){
		auto u = q.front(); q.pop();
		F0R(k, 4){
			int xx = u.f+dx[k], yy = u.s+dy[k];
			if(valid(xx, yy, n, n) && !vis[xx][yy] && (a[xx][yy] == 'G' || a[xx][yy] == 'D') && (distM[u.f][u.s]+1)/s < dist[xx][yy]-m){
				distM[xx][yy] = distM[u.f][u.s]+1;
				vis[xx][yy] = 1;
				q.push(mp(xx, yy));
			}
		}
	}
	return vis[sx][sy];
}

int main(){
	NACHO();
	cin >> n >> s;
	F0R(i, n){
		cin >> a[i];
		F0R(j, n){
			if(a[i][j] == 'M') x = i, y = j;
			if(a[i][j] == 'D') sx = i, sy = j;
		}
	}
	bfs();
	int low = 0, high = MX*MX+1;
	if(!can(0)){
		cout << -1 << "\n";
		return 0;
	}
	while(high-low > 1){
		int mid = low+(high-low)/2;
		if(can(mid)) low = mid;
		else high = mid;
	}
	cout << low << "\n";
}
/*
3 1
MGD
GGG
HGG
*/
/*
7 3
TTTTTTT 
TGGGGGT 
TGGGGGT 
MGGGGGD 
TGGGGGT 
TGGGGGT 
TGHHGGT
*/
/*
7 3
TTTTTTT 
TGGGGGT 
TGGGGGT 
MGGGGGD 
TGGGGGT 
TGGGGGT 
THHHHHT
*/

Compilation message

mecho.cpp: In function 'void NACHO(std::string)':
mecho.cpp:69:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   69 |         freopen((name+".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:70:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   70 |         freopen((name+".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 116 ms 7296 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 2 ms 892 KB Output is correct
13 Correct 1 ms 620 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 620 KB Output is correct
19 Correct 2 ms 620 KB Output is correct
20 Correct 1 ms 620 KB Output is correct
21 Correct 1 ms 620 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 1 ms 620 KB Output is correct
24 Correct 1 ms 748 KB Output is correct
25 Correct 1 ms 748 KB Output is correct
26 Correct 1 ms 876 KB Output is correct
27 Correct 2 ms 768 KB Output is correct
28 Correct 2 ms 876 KB Output is correct
29 Correct 2 ms 748 KB Output is correct
30 Correct 2 ms 876 KB Output is correct
31 Correct 2 ms 748 KB Output is correct
32 Correct 2 ms 876 KB Output is correct
33 Correct 7 ms 2412 KB Output is correct
34 Correct 9 ms 3052 KB Output is correct
35 Correct 29 ms 3052 KB Output is correct
36 Correct 9 ms 2796 KB Output is correct
37 Correct 12 ms 3564 KB Output is correct
38 Correct 39 ms 3436 KB Output is correct
39 Correct 10 ms 3052 KB Output is correct
40 Correct 13 ms 3820 KB Output is correct
41 Correct 62 ms 3844 KB Output is correct
42 Correct 12 ms 3436 KB Output is correct
43 Correct 14 ms 4224 KB Output is correct
44 Correct 79 ms 4224 KB Output is correct
45 Correct 19 ms 3692 KB Output is correct
46 Correct 19 ms 4604 KB Output is correct
47 Correct 70 ms 4588 KB Output is correct
48 Correct 15 ms 4076 KB Output is correct
49 Correct 19 ms 4992 KB Output is correct
50 Correct 89 ms 5100 KB Output is correct
51 Correct 18 ms 4460 KB Output is correct
52 Correct 22 ms 5484 KB Output is correct
53 Correct 114 ms 5496 KB Output is correct
54 Correct 26 ms 4716 KB Output is correct
55 Correct 28 ms 5868 KB Output is correct
56 Correct 130 ms 5868 KB Output is correct
57 Correct 25 ms 5120 KB Output is correct
58 Correct 32 ms 6380 KB Output is correct
59 Correct 161 ms 6380 KB Output is correct
60 Correct 29 ms 5484 KB Output is correct
61 Correct 38 ms 6764 KB Output is correct
62 Correct 176 ms 6764 KB Output is correct
63 Correct 129 ms 6764 KB Output is correct
64 Correct 226 ms 6764 KB Output is correct
65 Correct 194 ms 6892 KB Output is correct
66 Correct 150 ms 6892 KB Output is correct
67 Correct 37 ms 6764 KB Output is correct
68 Correct 64 ms 6784 KB Output is correct
69 Correct 56 ms 6764 KB Output is correct
70 Correct 54 ms 6764 KB Output is correct
71 Correct 48 ms 6764 KB Output is correct
72 Correct 54 ms 6892 KB Output is correct
73 Correct 48 ms 7404 KB Output is correct
74 Correct 89 ms 7660 KB Output is correct
75 Correct 95 ms 7660 KB Output is correct
76 Correct 104 ms 7660 KB Output is correct
77 Correct 87 ms 7660 KB Output is correct
78 Correct 33 ms 6124 KB Output is correct
79 Correct 77 ms 7532 KB Output is correct
80 Correct 77 ms 6124 KB Output is correct
81 Correct 88 ms 6380 KB Output is correct
82 Correct 87 ms 6252 KB Output is correct
83 Correct 101 ms 6124 KB Output is correct
84 Correct 113 ms 7404 KB Output is correct
85 Correct 98 ms 6380 KB Output is correct
86 Correct 139 ms 6252 KB Output is correct
87 Correct 106 ms 6380 KB Output is correct
88 Correct 119 ms 6380 KB Output is correct
89 Correct 146 ms 7404 KB Output is correct
90 Correct 131 ms 7276 KB Output is correct
91 Correct 111 ms 7404 KB Output is correct
92 Correct 110 ms 6380 KB Output is correct