oj.uz

Submission #571015

# Submission time Handle Problem Language Result Execution time Memory
571015 2022-06-01T04:30:37 Z f4t4nt Mecho (IOI09_mecho) C++11
84 / 100
 354 ms 16428 KB 
#include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using ch = char;
using str = string;

#define pb push_back
#define elif else if
#define sz(C) (ll) C.size()
#define mp make_pair
#define mt make_tuple
#define flip(C) reverse(C.begin(), C.end())
#define ssort(C) sort(C.begin(), C.end())
#define rsort(C) sort(C.begin(), C.end(), greater<>())

#define FOR(x, e) for(ll  x = 0; x < (ll) e; x++)
#define FORR(x, e) for(ll x = (ll) e - 1; x >= 0; x--)
#define FOB(x, b, e) for(auto x = b; x < e; x++)
#define FOI(x, e, i) for(ll x = 0; x < (ll) e; x += (ll) i)
#define FOBI(x, b, e, i) for(ll x = (ll) b; x < (ll) e; x += (ll) i)
#define FORE(x, C) for(auto &x : C)

#ifdef LOCAL
#include "tester.cpp"
#define main test_main
extern istringstream fin;
extern ostringstream fout;
string test_file_name = "tests";
#define cin fin
#define cout fout
#endif

vector<int> di { -1, 0, 1, 0};
vector<int> dj { 0, -1, 0, 1};

void fill_b(ll &n, vector<vector<char>> &g, queue<pair<ll, ll>> &bfs_b, vector<vector<ll>> &d_b) {
    while(sz(bfs_b)) {
        ll i0 = bfs_b.front().first, j0 = bfs_b.front().second;
        bfs_b.pop();
        FOR(k, 4) {
            ll i1 = i0 + di[k], j1 = j0 + dj[k];
            if(i1 < 0 || i1 >= n || j1 < 0 || j1 >= n) continue;
            if(g[i1][j1] == 'T' || g[i1][j1] == 'D') continue;
            if(d_b[i1][j1] != 1e18) continue;
            d_b[i1][j1] = d_b[i0][j0] + 1;
            bfs_b.push({i1, j1});
        }
    }
}

bool valid(ll &mid, ll &n, ll &s, vector<vector<ll>> &d_b, vector<vector<char>> &g, queue<pair<ll, ll>> bfs_m, vector<vector<ll>> d_m) {
    while(sz(bfs_m)) {
        ll i0 = bfs_m.front().first, j0 = bfs_m.front().second, d = d_m[i0][j0] + 1;
        bfs_m.pop();
        FOR(k, 4) {
            ll i1 = i0 + di[k], j1 = j0 + dj[k];
            if(i1 < 0 || i1 >= n || j1 < 0 || j1 >= n) continue;
            if(g[i1][j1] == 'T') continue;
            if(d_m[i1][j1] != 1e18) continue;
            if(d_b[i1][j1] < mid + d / s) continue;
            if(g[i1][j1] == 'D') return true;
            d_m[i1][j1] = d;
            bfs_m.push({i1, j1});
        }
    }
    return false;
}

int main() {
    ll n, s, lo = 0, hi = 1e18;
    cin >> n >> s;
    vector<vector<char>> g(n, vector<char>(n));
    vector<vector<ll>> d_b(n, vector<ll>(n, 1e18)), d_m(n, vector<ll>(n, 1e18));
    queue<pair<ll, ll>> bfs_b, bfs_m;
    FOR(i, n) FOR(j, n) {
        cin >> g[i][j];
        if(g[i][j] == 'H') {
            bfs_b.push({i, j});
            d_b[i][j] = 0;
        }
        elif(g[i][j] == 'M') {
            bfs_m.push({i, j});
            d_m[i][j] = 0;
        }
    }
    fill_b(n, g, bfs_b, d_b);
    while(hi - lo > 0) {
        ll mid = lo + (hi - lo + 1) / 2;
        if(valid(mid, n, s, d_b, g, bfs_m, d_m)) lo = mid;
        else hi = mid - 1;
    }
    cout << lo - 1 << '\n';
    return 0;
}

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 271 ms 16340 KB Output is correct
8 Correct 1 ms 260 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 1 ms 340 KB Output isn't correct
13 Incorrect 1 ms 340 KB Output isn't correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 26 ms 3344 KB Output is correct
34 Correct 26 ms 3340 KB Output is correct
35 Correct 42 ms 3352 KB Output is correct
36 Correct 37 ms 4260 KB Output is correct
37 Correct 34 ms 4252 KB Output is correct
38 Correct 59 ms 4280 KB Output is correct
39 Correct 45 ms 5252 KB Output is correct
40 Correct 43 ms 5580 KB Output is correct
41 Correct 81 ms 5320 KB Output is correct
42 Correct 60 ms 6464 KB Output is correct
43 Correct 60 ms 6620 KB Output is correct
44 Correct 91 ms 6648 KB Output is correct
45 Correct 69 ms 7880 KB Output is correct
46 Correct 69 ms 7924 KB Output is correct
47 Correct 120 ms 7888 KB Output is correct
48 Correct 91 ms 9340 KB Output is correct
49 Correct 92 ms 9372 KB Output is correct
50 Correct 147 ms 9268 KB Output is correct
51 Correct 106 ms 10780 KB Output is correct
52 Correct 101 ms 10860 KB Output is correct
53 Correct 200 ms 10808 KB Output is correct
54 Correct 122 ms 12548 KB Output is correct
55 Correct 125 ms 12512 KB Output is correct
56 Correct 227 ms 12616 KB Output is correct
57 Correct 154 ms 14296 KB Output is correct
58 Correct 148 ms 14316 KB Output is correct
59 Correct 269 ms 14296 KB Output is correct
60 Correct 174 ms 16276 KB Output is correct
61 Correct 173 ms 16304 KB Output is correct
62 Correct 285 ms 16240 KB Output is correct
63 Correct 283 ms 16172 KB Output is correct
64 Correct 354 ms 16160 KB Output is correct
65 Correct 329 ms 16184 KB Output is correct
66 Correct 294 ms 16180 KB Output is correct
67 Correct 278 ms 16264 KB Output is correct
68 Correct 212 ms 16308 KB Output is correct
69 Correct 191 ms 16204 KB Output is correct
70 Correct 197 ms 16312 KB Output is correct
71 Correct 204 ms 16212 KB Output is correct
72 Incorrect 188 ms 16204 KB Output isn't correct
73 Incorrect 179 ms 16236 KB Output isn't correct
74 Correct 210 ms 16268 KB Output is correct
75 Correct 236 ms 16292 KB Output is correct
76 Correct 224 ms 16216 KB Output is correct
77 Correct 233 ms 16172 KB Output is correct
78 Correct 227 ms 16224 KB Output is correct
79 Correct 213 ms 16180 KB Output is correct
80 Correct 213 ms 16212 KB Output is correct
81 Correct 226 ms 16428 KB Output is correct
82 Correct 206 ms 16220 KB Output is correct
83 Correct 257 ms 16216 KB Output is correct
84 Correct 251 ms 16240 KB Output is correct
85 Correct 244 ms 16236 KB Output is correct
86 Correct 251 ms 16204 KB Output is correct
87 Correct 233 ms 16340 KB Output is correct
88 Correct 253 ms 16204 KB Output is correct
89 Correct 255 ms 16204 KB Output is correct
90 Correct 285 ms 16208 KB Output is correct
91 Correct 259 ms 16276 KB Output is correct
92 Correct 272 ms 16308 KB Output is correct