oj.uz

답안 #369345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
369345 2021-02-21T11:29:23 Z AmineWeslati Mecho (IOI09_mecho) C++14
100 / 100
 225 ms 7276 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e9;
const int MX = 850;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

//move only on grass!!!!!!!!!!!

int N,S,X,Y,Xd,Yd,t[MX][MX]; 
char g[MX][MX];

bool can(int x, int y, int p){ //0 bees / 1 Mecho
	if(!(min(x,y)>=0 && max(x,y)<N)) return 0;
	bool c=(g[x][y]!='T');
	if(!p) c&=(g[x][y]!='D');
	return c; 
}

bool check(int L){
	if(t[X][Y]<=L) return 0;

	queue<pi>q;
	q.push({X,Y});
	int dist[N][N]; FOR(i,0,N) FOR(j,0,N) dist[i][j]=INF;
	dist[X][Y]=0;

	while(!q.empty()){
		int x=q.front().fi,y=q.front().se;
		q.pop();

		FOR(m,0,4){
			int nwx=x+nx[m],nwy=y+ny[m];
			if(can(nwx,nwy,1) && dist[nwx][nwy]==INF){
				if((dist[x][y]+1)/S+L<t[nwx][nwy]){
					dist[nwx][nwy]=dist[x][y]+1;
					q.push({nwx,nwy});
				}
			}
		}
	}

	return dist[Xd][Yd]!=INF;
}

int main() {
    boost; IO();
    
    cin>>N>>S;
    FOR(i,0,N) FOR(j,0,N){
    	cin>>g[i][j];
    	if(g[i][j]=='M') X=i,Y=j;
    	if(g[i][j]=='D') Xd=i,Yd=j;
    	t[i][j]=INF;
	}

	queue<pi>q;
	FOR(i,0,N) FOR(j,0,N) if(g[i][j]=='H'){
		q.push({i,j});
		t[i][j]=0;
	}

	while(!q.empty()){
		int x=q.front().fi,y=q.front().se;
		q.pop();

		FOR(m,0,4){
			int nwx=x+nx[m],nwy=y+ny[m];
			if(can(nwx,nwy,0) && t[nwx][nwy]==INF){
				t[nwx][nwy]=t[x][y]+1;
				q.push({nwx,nwy});
			}
		}
	}

	int l=0,r=INF,ans=-1;
	while(l<=r){
		int m=(l+r)/2;
		if(check(m)){
			ans=m;
			l=m+1;
		}
		else r=m-1;
	}
	cout << ans << endl;
	

    return 0;
}
//Change your approach

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 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 364 KB Output is correct
7 Correct 124 ms 6912 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 640 KB Output is correct
13 Correct 1 ms 620 KB Output is correct
14 Correct 1 ms 620 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 512 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 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 620 KB Output is correct
24 Correct 1 ms 620 KB Output is correct
25 Correct 1 ms 620 KB Output is correct
26 Correct 1 ms 620 KB Output is correct
27 Correct 1 ms 620 KB Output is correct
28 Correct 1 ms 748 KB Output is correct
29 Correct 1 ms 620 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 1 ms 620 KB Output is correct
32 Correct 1 ms 620 KB Output is correct
33 Correct 7 ms 2412 KB Output is correct
34 Correct 8 ms 2412 KB Output is correct
35 Correct 31 ms 2540 KB Output is correct
36 Correct 8 ms 2796 KB Output is correct
37 Correct 8 ms 2924 KB Output is correct
38 Correct 40 ms 2924 KB Output is correct
39 Correct 12 ms 3180 KB Output is correct
40 Correct 10 ms 3308 KB Output is correct
41 Correct 57 ms 3180 KB Output is correct
42 Correct 10 ms 3692 KB Output is correct
43 Correct 11 ms 3692 KB Output is correct
44 Correct 68 ms 3692 KB Output is correct
45 Correct 14 ms 4076 KB Output is correct
46 Correct 14 ms 4076 KB Output is correct
47 Correct 93 ms 4204 KB Output is correct
48 Correct 18 ms 4588 KB Output is correct
49 Correct 19 ms 4588 KB Output is correct
50 Correct 97 ms 4588 KB Output is correct
51 Correct 20 ms 5100 KB Output is correct
52 Correct 22 ms 5100 KB Output is correct
53 Correct 125 ms 5196 KB Output is correct
54 Correct 26 ms 5612 KB Output is correct
55 Correct 28 ms 5612 KB Output is correct
56 Correct 143 ms 5760 KB Output is correct
57 Correct 25 ms 6252 KB Output is correct
58 Correct 23 ms 6252 KB Output is correct
59 Correct 167 ms 6380 KB Output is correct
60 Correct 30 ms 6764 KB Output is correct
61 Correct 36 ms 6764 KB Output is correct
62 Correct 196 ms 6764 KB Output is correct
63 Correct 127 ms 6764 KB Output is correct
64 Correct 225 ms 6892 KB Output is correct
65 Correct 210 ms 6764 KB Output is correct
66 Correct 145 ms 6892 KB Output is correct
67 Correct 139 ms 6764 KB Output is correct
68 Correct 64 ms 6892 KB Output is correct
69 Correct 61 ms 7020 KB Output is correct
70 Correct 43 ms 6892 KB Output is correct
71 Correct 46 ms 7020 KB Output is correct
72 Correct 41 ms 6892 KB Output is correct
73 Correct 56 ms 7148 KB Output is correct
74 Correct 114 ms 7148 KB Output is correct
75 Correct 98 ms 7276 KB Output is correct
76 Correct 87 ms 7148 KB Output is correct
77 Correct 95 ms 7276 KB Output is correct
78 Correct 111 ms 7148 KB Output is correct
79 Correct 100 ms 7020 KB Output is correct
80 Correct 84 ms 7020 KB Output is correct
81 Correct 95 ms 7020 KB Output is correct
82 Correct 79 ms 7020 KB Output is correct
83 Correct 118 ms 7148 KB Output is correct
84 Correct 126 ms 7020 KB Output is correct
85 Correct 104 ms 7040 KB Output is correct
86 Correct 111 ms 7148 KB Output is correct
87 Correct 108 ms 7148 KB Output is correct
88 Correct 114 ms 7020 KB Output is correct
89 Correct 119 ms 7020 KB Output is correct
90 Correct 124 ms 7020 KB Output is correct
91 Correct 131 ms 7020 KB Output is correct
92 Correct 118 ms 7020 KB Output is correct