oj.uz

Submission #386173

# Submission time Handle Problem Language Result Execution time Memory
386173 2021-04-06T00:20:10 Z ignaciocanta Mecho (IOI09_mecho) C++14
40 / 100
 168 ms 7148 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'){
				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));
	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 < max(0, 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 = 2*MX+5;
	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
40.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 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 97 ms 6252 KB Output is correct
8 Incorrect 2 ms 492 KB Output isn't correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Incorrect 1 ms 620 KB Output isn't correct
13 Incorrect 2 ms 620 KB Output isn't correct
14 Incorrect 2 ms 748 KB Output isn't 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 492 KB Output is correct
19 Correct 1 ms 492 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 2 ms 620 KB Output is correct
24 Correct 1 ms 620 KB Output is correct
25 Incorrect 2 ms 748 KB Output isn't correct
26 Correct 1 ms 768 KB Output is correct
27 Incorrect 2 ms 748 KB Output isn't correct
28 Correct 1 ms 748 KB Output is correct
29 Incorrect 2 ms 748 KB Output isn't correct
30 Correct 1 ms 748 KB Output is correct
31 Incorrect 2 ms 748 KB Output isn't correct
32 Correct 2 ms 748 KB Output is correct
33 Incorrect 15 ms 2540 KB Output isn't correct
34 Incorrect 25 ms 3180 KB Output isn't correct
35 Correct 34 ms 3052 KB Output is correct
36 Incorrect 20 ms 2924 KB Output isn't correct
37 Incorrect 29 ms 3564 KB Output isn't correct
38 Correct 34 ms 3584 KB Output is correct
39 Incorrect 23 ms 3308 KB Output isn't correct
40 Incorrect 36 ms 3948 KB Output isn't correct
41 Correct 49 ms 3948 KB Output is correct
42 Incorrect 28 ms 3692 KB Output isn't correct
43 Incorrect 43 ms 4460 KB Output isn't correct
44 Correct 56 ms 4460 KB Output is correct
45 Incorrect 41 ms 4204 KB Output isn't correct
46 Incorrect 53 ms 4844 KB Output isn't correct
47 Correct 69 ms 4844 KB Output is correct
48 Incorrect 39 ms 4460 KB Output isn't correct
49 Incorrect 63 ms 5356 KB Output isn't correct
50 Correct 93 ms 4972 KB Output is correct
51 Incorrect 45 ms 4460 KB Output isn't correct
52 Incorrect 73 ms 5356 KB Output isn't correct
53 Correct 98 ms 5484 KB Output is correct
54 Incorrect 60 ms 4716 KB Output isn't correct
55 Incorrect 88 ms 5868 KB Output isn't correct
56 Correct 119 ms 5868 KB Output is correct
57 Incorrect 70 ms 5100 KB Output isn't correct
58 Incorrect 99 ms 6404 KB Output isn't correct
59 Correct 138 ms 6252 KB Output is correct
60 Incorrect 67 ms 5484 KB Output isn't correct
61 Incorrect 118 ms 6636 KB Output isn't correct
62 Correct 166 ms 6892 KB Output is correct
63 Correct 109 ms 6764 KB Output is correct
64 Correct 155 ms 6764 KB Output is correct
65 Correct 168 ms 6764 KB Output is correct
66 Correct 140 ms 6764 KB Output is correct
67 Incorrect 127 ms 6696 KB Output isn't correct
68 Correct 49 ms 6636 KB Output is correct
69 Correct 41 ms 6764 KB Output is correct
70 Correct 43 ms 6764 KB Output is correct
71 Correct 38 ms 6764 KB Output is correct
72 Incorrect 33 ms 4716 KB Output isn't correct
73 Incorrect 88 ms 7148 KB Output isn't correct
74 Correct 57 ms 7020 KB Output is correct
75 Correct 76 ms 7020 KB Output is correct
76 Correct 66 ms 7020 KB Output is correct
77 Correct 74 ms 7020 KB Output is correct
78 Incorrect 82 ms 5844 KB Output isn't correct
79 Correct 64 ms 5484 KB Output is correct
80 Correct 70 ms 5484 KB Output is correct
81 Correct 99 ms 5612 KB Output is correct
82 Correct 70 ms 5484 KB Output is correct
83 Correct 90 ms 5740 KB Output is correct
84 Correct 92 ms 5740 KB Output is correct
85 Correct 89 ms 5612 KB Output is correct
86 Correct 93 ms 5740 KB Output is correct
87 Correct 82 ms 5640 KB Output is correct
88 Correct 95 ms 5740 KB Output is correct
89 Correct 103 ms 5740 KB Output is correct
90 Correct 123 ms 5740 KB Output is correct
91 Correct 100 ms 5740 KB Output is correct
92 Correct 128 ms 5740 KB Output is correct