oj.uz

Submission #440361

# Submission time Handle Problem Language Result Execution time Memory
440361 2021-07-02T07:21:28 Z Karliver Mecho (IOI09_mecho) C++14
100 / 100
 245 ms 6232 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' || c[ei][ej] == 'M')) {
                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 = bee[sx][sy] - 1;
    
    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
100.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 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 276 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 127 ms 6232 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is 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 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 7 ms 1436 KB Output is correct
34 Correct 8 ms 1428 KB Output is correct
35 Correct 34 ms 1416 KB Output is correct
36 Correct 9 ms 1740 KB Output is correct
37 Correct 10 ms 1772 KB Output is correct
38 Correct 47 ms 1780 KB Output is correct
39 Correct 12 ms 2200 KB Output is correct
40 Correct 14 ms 2184 KB Output is correct
41 Correct 56 ms 2132 KB Output is correct
42 Correct 14 ms 2580 KB Output is correct
43 Correct 18 ms 2584 KB Output is correct
44 Correct 72 ms 2580 KB Output is correct
45 Correct 19 ms 3108 KB Output is correct
46 Correct 20 ms 3048 KB Output is correct
47 Correct 86 ms 3048 KB Output is correct
48 Correct 21 ms 3628 KB Output is correct
49 Correct 23 ms 3636 KB Output is correct
50 Correct 101 ms 3560 KB Output is correct
51 Correct 26 ms 4136 KB Output is correct
52 Correct 28 ms 4160 KB Output is correct
53 Correct 127 ms 4124 KB Output is correct
54 Correct 29 ms 4792 KB Output is correct
55 Correct 33 ms 4784 KB Output is correct
56 Correct 152 ms 4732 KB Output is correct
57 Correct 34 ms 5416 KB Output is correct
58 Correct 38 ms 5416 KB Output is correct
59 Correct 175 ms 5364 KB Output is correct
60 Correct 38 ms 6140 KB Output is correct
61 Correct 43 ms 6124 KB Output is correct
62 Correct 203 ms 6060 KB Output is correct
63 Correct 143 ms 6072 KB Output is correct
64 Correct 245 ms 6164 KB Output is correct
65 Correct 227 ms 6060 KB Output is correct
66 Correct 203 ms 6072 KB Output is correct
67 Correct 174 ms 6064 KB Output is correct
68 Correct 76 ms 6100 KB Output is correct
69 Correct 56 ms 6124 KB Output is correct
70 Correct 58 ms 6080 KB Output is correct
71 Correct 54 ms 6216 KB Output is correct
72 Correct 45 ms 6108 KB Output is correct
73 Correct 50 ms 6128 KB Output is correct
74 Correct 98 ms 6084 KB Output is correct
75 Correct 104 ms 6100 KB Output is correct
76 Correct 103 ms 6108 KB Output is correct
77 Correct 106 ms 6096 KB Output is correct
78 Correct 120 ms 6208 KB Output is correct
79 Correct 91 ms 6092 KB Output is correct
80 Correct 91 ms 6084 KB Output is correct
81 Correct 127 ms 6104 KB Output is correct
82 Correct 98 ms 6104 KB Output is correct
83 Correct 118 ms 6188 KB Output is correct
84 Correct 106 ms 6152 KB Output is correct
85 Correct 105 ms 6124 KB Output is correct
86 Correct 122 ms 6096 KB Output is correct
87 Correct 108 ms 6064 KB Output is correct
88 Correct 117 ms 6088 KB Output is correct
89 Correct 122 ms 6084 KB Output is correct
90 Correct 137 ms 6148 KB Output is correct
91 Correct 137 ms 6132 KB Output is correct
92 Correct 134 ms 6028 KB Output is correct