oj.uz

Submission #440357

# Submission time Handle Problem Language Result Execution time Memory
440357 2021-07-02T07:09:43 Z Karliver Mecho (IOI09_mecho) C++14
53 / 100
 445 ms 6240 KB 
	
 #include <bits/stdc++.h>
 
 #define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
 #define all(v) (v).begin(), (v).end()
 using namespace  std;
 #define forn(i,n) for (int i = 0; i < (n); ++i)
 #define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
 using ll = long long;
 int mod = (ll)1e9 + 7;
 #define PI acos(-1)
 typedef pair<int, int> pairs;
 
 const int INF = 1e9 + 1;
 const int N = 2e5 + 100;
 const double eps = 1e-7;
 
 template <class T> using V = vector<T>;  
 template <class T> using VV = V<V<T>>;  
 
 template <typename XPAX>
 void ckma(XPAX &x, XPAX y) {
     x = (x < y ? y : x);
 }
 template <typename XPAX>
 void ckmi(XPAX &x, XPAX y) {
     x = (x > y ? y : x);
 }
 void __print(int x) {cerr << x;}
 void __print(long x) {cerr << x;}
 void __print(long long x) {cerr << x;}
 void __print(unsigned x) {cerr << x;}
 void __print(unsigned long x) {cerr << x;}
 void __print(unsigned long long x) {cerr << x;}
 void __print(float x) {cerr << x;}
 void __print(double x) {cerr << x;}
 void __print(long double x) {cerr << x;}
 void __print(char x) {cerr << '\'' << x << '\'';}
 void __print(const char *x) {cerr << '\"' << x << '\"';}
 void __print(const string &x) {cerr << '\"' << x << '\"';}
 void __print(bool x) {cerr << (x ? "true" : "false");}
 
 template<typename T, typename V>
 void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
 template<typename T>
 void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
 void _print() {cerr << "]\n";}
 template <typename T, typename... V>
 void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
 #define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
 void solve() {
 
 
 	
 	int n;
 	cin >> n;
 	int s;
 	cin >> s;

 	queue<pairs> q;

 	V<string> c(n);

 	forn(i, n) {
        cin >> c[i];
        //debug(c[i]);
    }

 	auto valid = [&](int i, int j) {
 		return (i < n && j < n && i > -1 && j > -1 && c[i][j] != 'T');
 	};
    
 	int sx, sy;
 	int tx, ty;
 	V<pairs> directions{{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

 	auto dv = [&](int x) {
        return x / s;
    };

 	VV<int> bee(n, V<int>(n, INF));
 	forn(i, n) forn(j, n) {
 		if(c[i][j] == 'H') {
 			q.push({i, j});
 			bee[i][j] = 0;
 		}
 		if(c[i][j] == 'D') {
 			tx = i;
 			ty = j;
 		}
 		if(c[i][j] == 'M') {
 			sx = i;
 			sy = j;
 		}
 	}

   // debug(bee);
 	while(q.size()) {
		int i = q.front().first;
		int j = q.front().second;
		q.pop();
		for(auto dir : directions) {
			int ei = i + dir.first;
			int ej = j + dir.second;

			if(valid(ei, ej) && bee[ei][ej] == INF && c[ei][ej] == 'G') {
				bee[ei][ej] = bee[i][j] + 1;
				q.push({ei, ej});
			}
		}
 	}
   
 	auto ck = [&](int mid) -> bool {
 		VV<int> dis(n, V<int>(n, -1));

 		dis[sx][sy] = 0;
 		queue<pairs> q;

 		q.push({sx, sy});

 		while(q.size()) {
 			int i = q.front().first;
 			int j = q.front().second;
 			q.pop();
 			for(auto dir : directions) {
 				int ei = i + dir.first;
 				int ej = j + dir.second;

 				if(valid(ei, ej) && dis[ei][ej] == -1 && bee[ei][ej] >  dv(dis[i][j] + 1) + mid) {
 					dis[ei][ej] = dis[i][j] + 1;
 					q.push({ei, ej});
 				}
 			}
 		}
        //debug(dis);
 		return (dis[tx][ty] != -1);
 	};


 	int low = 0;
 	int high = 1002;
    
 	while(low < high) {
 		int mid = (low + high + 1) / 2;

 		if(ck(mid))
 			low = mid;
 		else high = mid - 1;
 	}
    
    
 	cout << (ck(low) ? low : -1) << '\n';





 
 
 
 }
 void test_case() {
     int t;
     cin >> t;
     forn(p, t) {
 
         //cout << "Case #" << p + 1 << ": ";
         solve();
     }
 }
 int main() {
 
     ios::sync_with_stdio(false);
     cin.tie(0);
 
     solve();
 
 }

Subtask #1
53.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 140 ms 6172 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 3 ms 204 KB Output is correct
12 Incorrect 1 ms 332 KB Output isn't correct
13 Incorrect 1 ms 332 KB Output isn't correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 5 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Incorrect 1 ms 332 KB Output isn't correct
24 Correct 1 ms 332 KB Output is correct
25 Incorrect 1 ms 332 KB Output isn't correct
26 Correct 1 ms 332 KB Output is correct
27 Incorrect 1 ms 332 KB Output isn't correct
28 Correct 1 ms 332 KB Output is correct
29 Incorrect 1 ms 332 KB Output isn't correct
30 Incorrect 1 ms 332 KB Output isn't correct
31 Incorrect 1 ms 332 KB Output isn't correct
32 Incorrect 1 ms 332 KB Output isn't correct
33 Incorrect 16 ms 1472 KB Output isn't correct
34 Incorrect 25 ms 1428 KB Output isn't correct
35 Correct 149 ms 1420 KB Output is correct
36 Incorrect 27 ms 1740 KB Output isn't correct
37 Incorrect 33 ms 1740 KB Output isn't correct
38 Correct 43 ms 1784 KB Output is correct
39 Incorrect 26 ms 2152 KB Output isn't correct
40 Incorrect 43 ms 2132 KB Output isn't correct
41 Correct 56 ms 2160 KB Output is correct
42 Incorrect 34 ms 2588 KB Output isn't correct
43 Incorrect 62 ms 2644 KB Output isn't correct
44 Correct 69 ms 2588 KB Output is correct
45 Incorrect 40 ms 3072 KB Output isn't correct
46 Incorrect 67 ms 3036 KB Output isn't correct
47 Correct 92 ms 3020 KB Output is correct
48 Incorrect 47 ms 3576 KB Output isn't correct
49 Incorrect 80 ms 3580 KB Output isn't correct
50 Correct 111 ms 3568 KB Output is correct
51 Incorrect 60 ms 4140 KB Output isn't correct
52 Incorrect 95 ms 4124 KB Output isn't correct
53 Correct 173 ms 4120 KB Output is correct
54 Incorrect 137 ms 4748 KB Output isn't correct
55 Incorrect 110 ms 4736 KB Output isn't correct
56 Correct 157 ms 4844 KB Output is correct
57 Incorrect 76 ms 5412 KB Output isn't correct
58 Incorrect 124 ms 5368 KB Output isn't correct
59 Correct 175 ms 5404 KB Output is correct
60 Incorrect 151 ms 6088 KB Output isn't correct
61 Incorrect 137 ms 6072 KB Output isn't correct
62 Correct 212 ms 6064 KB Output is correct
63 Correct 137 ms 6060 KB Output is correct
64 Correct 445 ms 6168 KB Output is correct
65 Correct 258 ms 6068 KB Output is correct
66 Correct 320 ms 6112 KB Output is correct
67 Correct 158 ms 6180 KB Output is correct
68 Correct 68 ms 6108 KB Output is correct
69 Correct 192 ms 6080 KB Output is correct
70 Correct 56 ms 6084 KB Output is correct
71 Correct 49 ms 6116 KB Output is correct
72 Incorrect 45 ms 6100 KB Output isn't correct
73 Incorrect 105 ms 6076 KB Output isn't correct
74 Correct 177 ms 6100 KB Output is correct
75 Correct 108 ms 6104 KB Output is correct
76 Correct 90 ms 6112 KB Output is correct
77 Correct 145 ms 6108 KB Output is correct
78 Correct 120 ms 6100 KB Output is correct
79 Correct 95 ms 6120 KB Output is correct
80 Correct 97 ms 6100 KB Output is correct
81 Correct 228 ms 6104 KB Output is correct
82 Correct 106 ms 6124 KB Output is correct
83 Correct 119 ms 6092 KB Output is correct
84 Correct 217 ms 6092 KB Output is correct
85 Correct 114 ms 6240 KB Output is correct
86 Correct 198 ms 6212 KB Output is correct
87 Correct 122 ms 6092 KB Output is correct
88 Correct 119 ms 6092 KB Output is correct
89 Correct 135 ms 6220 KB Output is correct
90 Correct 136 ms 6092 KB Output is correct
91 Correct 130 ms 6100 KB Output is correct
92 Correct 294 ms 6084 KB Output is correct