oj.uz

답안 #386180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386180 2021-04-06T00:57:41 Z ignaciocanta Mecho (IOI09_mecho) C++14
100 / 100
 235 ms 7276 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+5;
	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";
}

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

# 결과 실행 시간 메모리 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 115 ms 7276 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 432 KB Output is correct
12 Correct 1 ms 876 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 1 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 1 ms 620 KB Output is correct
20 Correct 2 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 2 ms 748 KB Output is correct
25 Correct 1 ms 748 KB Output is correct
26 Correct 2 ms 876 KB Output is correct
27 Correct 2 ms 748 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 876 KB Output is correct
32 Correct 2 ms 876 KB Output is correct
33 Correct 8 ms 2540 KB Output is correct
34 Correct 9 ms 3052 KB Output is correct
35 Correct 28 ms 3052 KB Output is correct
36 Correct 9 ms 2924 KB Output is correct
37 Correct 11 ms 3564 KB Output is correct
38 Correct 37 ms 3564 KB Output is correct
39 Correct 10 ms 3308 KB Output is correct
40 Correct 12 ms 3948 KB Output is correct
41 Correct 47 ms 3948 KB Output is correct
42 Correct 12 ms 3692 KB Output is correct
43 Correct 14 ms 4460 KB Output is correct
44 Correct 64 ms 4588 KB Output is correct
45 Correct 15 ms 3948 KB Output is correct
46 Correct 19 ms 4844 KB Output is correct
47 Correct 70 ms 4844 KB Output is correct
48 Correct 16 ms 4332 KB Output is correct
49 Correct 19 ms 5228 KB Output is correct
50 Correct 86 ms 5356 KB Output is correct
51 Correct 18 ms 4716 KB Output is correct
52 Correct 23 ms 5740 KB Output is correct
53 Correct 111 ms 5740 KB Output is correct
54 Correct 22 ms 4972 KB Output is correct
55 Correct 26 ms 6124 KB Output is correct
56 Correct 134 ms 6124 KB Output is correct
57 Correct 25 ms 5356 KB Output is correct
58 Correct 32 ms 6636 KB Output is correct
59 Correct 156 ms 6636 KB Output is correct
60 Correct 31 ms 5888 KB Output is correct
61 Correct 37 ms 7148 KB Output is correct
62 Correct 183 ms 7276 KB Output is correct
63 Correct 127 ms 7148 KB Output is correct
64 Correct 235 ms 7148 KB Output is correct
65 Correct 197 ms 7148 KB Output is correct
66 Correct 149 ms 7148 KB Output is correct
67 Correct 36 ms 7148 KB Output is correct
68 Correct 64 ms 7148 KB Output is correct
69 Correct 58 ms 7148 KB Output is correct
70 Correct 53 ms 7148 KB Output is correct
71 Correct 48 ms 6764 KB Output is correct
72 Correct 43 ms 6764 KB Output is correct
73 Correct 48 ms 7020 KB Output is correct
74 Correct 87 ms 7172 KB Output is correct
75 Correct 85 ms 7020 KB Output is correct
76 Correct 85 ms 7148 KB Output is correct
77 Correct 92 ms 7020 KB Output is correct
78 Correct 33 ms 5612 KB Output is correct
79 Correct 79 ms 7148 KB Output is correct
80 Correct 75 ms 5612 KB Output is correct
81 Correct 85 ms 5612 KB Output is correct
82 Correct 82 ms 5740 KB Output is correct
83 Correct 105 ms 5740 KB Output is correct
84 Correct 106 ms 6892 KB Output is correct
85 Correct 92 ms 5740 KB Output is correct
86 Correct 113 ms 5740 KB Output is correct
87 Correct 108 ms 5868 KB Output is correct
88 Correct 104 ms 5868 KB Output is correct
89 Correct 142 ms 6892 KB Output is correct
90 Correct 127 ms 6764 KB Output is correct
91 Correct 115 ms 6892 KB Output is correct
92 Correct 108 ms 5932 KB Output is correct