oj.uz

답안 #571362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571362 2022-06-02T02:41:50 Z f4t4nt Mecho (IOI09_mecho) C++11
84 / 100
 323 ms 16864 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;
    cin >> n >> s;
    ll hi = n * n;
    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);
    if(!valid(lo, n, s, d_b, g, bfs_m, d_m)) {
        cout << "-1\n";
        return 0;
    }
    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 << '\n';
    return 0;
}

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 212 ms 16772 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 296 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 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 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 304 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 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 1 ms 340 KB Output is correct
33 Correct 16 ms 3512 KB Output is correct
34 Correct 15 ms 3460 KB Output is correct
35 Correct 41 ms 3448 KB Output is correct
36 Correct 19 ms 4472 KB Output is correct
37 Correct 19 ms 4472 KB Output is correct
38 Correct 44 ms 4448 KB Output is correct
39 Correct 25 ms 5508 KB Output is correct
40 Correct 25 ms 5520 KB Output is correct
41 Correct 67 ms 5532 KB Output is correct
42 Correct 31 ms 6756 KB Output is correct
43 Correct 32 ms 6776 KB Output is correct
44 Correct 77 ms 6748 KB Output is correct
45 Correct 43 ms 8212 KB Output is correct
46 Correct 42 ms 8120 KB Output is correct
47 Correct 101 ms 8104 KB Output is correct
48 Correct 50 ms 9592 KB Output is correct
49 Correct 48 ms 9576 KB Output is correct
50 Correct 128 ms 9540 KB Output is correct
51 Correct 66 ms 11264 KB Output is correct
52 Correct 57 ms 11212 KB Output is correct
53 Correct 140 ms 11224 KB Output is correct
54 Correct 71 ms 12968 KB Output is correct
55 Correct 73 ms 12948 KB Output is correct
56 Correct 167 ms 12872 KB Output is correct
57 Correct 76 ms 14808 KB Output is correct
58 Correct 78 ms 14824 KB Output is correct
59 Correct 218 ms 14776 KB Output is correct
60 Correct 88 ms 16832 KB Output is correct
61 Correct 87 ms 16844 KB Output is correct
62 Correct 240 ms 16796 KB Output is correct
63 Correct 215 ms 16752 KB Output is correct
64 Correct 323 ms 16748 KB Output is correct
65 Correct 250 ms 16780 KB Output is correct
66 Correct 212 ms 16780 KB Output is correct
67 Correct 76 ms 16640 KB Output is correct
68 Correct 134 ms 16780 KB Output is correct
69 Correct 139 ms 16776 KB Output is correct
70 Correct 126 ms 16812 KB Output is correct
71 Correct 126 ms 16852 KB Output is correct
72 Incorrect 108 ms 16792 KB Output isn't correct
73 Incorrect 133 ms 16788 KB Output isn't correct
74 Correct 176 ms 16796 KB Output is correct
75 Correct 164 ms 16864 KB Output is correct
76 Correct 175 ms 16780 KB Output is correct
77 Correct 166 ms 16808 KB Output is correct
78 Correct 78 ms 16632 KB Output is correct
79 Correct 157 ms 16780 KB Output is correct
80 Correct 146 ms 16780 KB Output is correct
81 Correct 148 ms 16792 KB Output is correct
82 Correct 154 ms 16764 KB Output is correct
83 Correct 177 ms 16800 KB Output is correct
84 Correct 206 ms 16828 KB Output is correct
85 Correct 200 ms 16844 KB Output is correct
86 Correct 202 ms 16856 KB Output is correct
87 Correct 181 ms 16836 KB Output is correct
88 Correct 198 ms 16784 KB Output is correct
89 Correct 219 ms 16776 KB Output is correct
90 Correct 203 ms 16780 KB Output is correct
91 Correct 218 ms 16772 KB Output is correct
92 Correct 186 ms 16768 KB Output is correct