oj.uz

답안 #988333

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988333 2024-05-24T14:08:59 Z steveonalex Mecho (IOI09_mecho) C++17
64 / 100
 249 ms 8016 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

const int N = 900;
const int INF = 1e9 + 69;
int n, s;
bitset<N> grid[N];
int dis1[N][N], dis2[N][N];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> s;
    vector<string> field(n);
    for(int i = 0; i<n; ++i) cin >> field[i];

    for(int i = 0; i<=n+1; ++i) grid[i][0] = grid[0][i] = grid[i][n+1] = grid[n+1][i] = 1;
    for(int i = 0; i<n; ++i) for(int j = 0 ;j<n; ++j) if (field[i][j] == 'T' || field[i][j] == 'D'){
        grid[i+1][j+1] = 1;
    }

    for(int i = 0; i<=n+1; ++i) for(int j = 0; j<=n+1; ++j) dis1[i][j] = INF;

    deque<pair<int, int>> q;
    for(int i = 0; i<n; ++i) for(int j = 0; j<n; ++j) if (field[i][j] == 'H') {
        q.push_back({i + 1, j+1});
        dis1[i+1][j+1] = 0;
    }

    while(q.size()){
        pair<int, int> u = q.front(); q.pop_front();

        for(int dir = 0; dir < 4; ++dir){
            pair<int, int> v = {u.first + dx[dir], u.second + dy[dir]};
            if (!grid[v.first][v.second] && minimize(dis1[v.first][v.second], dis1[u.first][u.second] + 1)){
                q.push_back(v);
            }
        }
    }

    pair<int, int> S, E;
    for(int i = 0; i<n; ++i) for(int j = 0; j<n; ++j){
        if (field[i][j] == 'D') E = {i+1, j+1};
        if (field[i][j] == 'M') S = {i+1, j+1};
    }

    grid[E.first][E.second] = 0;

    ll l = -1, r = n * n;
    minimize(r, dis1[S.first][S.second] * s - 1);
    while(l < r){
        ll mid = (l + r + 1) >> 1;
        for(int i = 0; i<=n+1; ++i) for(int j = 0; j<=n+1; ++j) dis2[i][j] = INF;

        dis2[S.first][S.second] = mid;

        deque<pair<int, int>> q; q.push_back(S);
        while(q.size()){
            pair<int, int> u = q.front(); q.pop_front();

            int cur = dis2[u.first][u.second];

            for(int dir = 0; dir < 4; ++dir){
                pair<int, int> v = {u.first + dx[dir], u.second + dy[dir]};
                if (!grid[v.first][v.second] && dis1[v.first][v.second] > (cur + 1) / s && minimize(dis2[v.first][v.second], dis2[u.first][u.second] + 1)){
                    q.push_back(v);
                }
            }
        }
        if (dis2[E.first][E.second] == INF) r = mid - 1;
        else l = mid;
    }

    if (l >= 0) l /= s;

    cout << l << "\n";

    return 0;
}

Subtask #1
64.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2516 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 103 ms 7516 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Incorrect 1 ms 2396 KB Output isn't correct
17 Correct 1 ms 2396 KB Output is correct
18 Incorrect 1 ms 2396 KB Output isn't correct
19 Correct 1 ms 2396 KB Output is correct
20 Incorrect 1 ms 2396 KB Output isn't correct
21 Correct 1 ms 2652 KB Output is correct
22 Incorrect 1 ms 2648 KB Output isn't correct
23 Correct 1 ms 4700 KB Output is correct
24 Incorrect 1 ms 4576 KB Output isn't correct
25 Correct 2 ms 4700 KB Output is correct
26 Incorrect 2 ms 4700 KB Output isn't correct
27 Correct 1 ms 4700 KB Output is correct
28 Incorrect 2 ms 4700 KB Output isn't correct
29 Correct 1 ms 4700 KB Output is correct
30 Incorrect 2 ms 4896 KB Output isn't correct
31 Correct 1 ms 4700 KB Output is correct
32 Incorrect 2 ms 4696 KB Output isn't correct
33 Correct 5 ms 6748 KB Output is correct
34 Incorrect 21 ms 6748 KB Output isn't correct
35 Correct 32 ms 6748 KB Output is correct
36 Correct 5 ms 7004 KB Output is correct
37 Incorrect 28 ms 7004 KB Output isn't correct
38 Correct 41 ms 7004 KB Output is correct
39 Correct 6 ms 7004 KB Output is correct
40 Incorrect 34 ms 7004 KB Output isn't correct
41 Correct 56 ms 7004 KB Output is correct
42 Correct 7 ms 7000 KB Output is correct
43 Incorrect 45 ms 7124 KB Output isn't correct
44 Correct 66 ms 7004 KB Output is correct
45 Correct 8 ms 7000 KB Output is correct
46 Incorrect 52 ms 7004 KB Output isn't correct
47 Correct 79 ms 7004 KB Output is correct
48 Correct 9 ms 7260 KB Output is correct
49 Incorrect 61 ms 7084 KB Output isn't correct
50 Correct 94 ms 7256 KB Output is correct
51 Correct 11 ms 7260 KB Output is correct
52 Incorrect 76 ms 7260 KB Output isn't correct
53 Correct 116 ms 7316 KB Output is correct
54 Correct 13 ms 7412 KB Output is correct
55 Incorrect 91 ms 7392 KB Output isn't correct
56 Correct 134 ms 7260 KB Output is correct
57 Correct 14 ms 7260 KB Output is correct
58 Incorrect 99 ms 7260 KB Output isn't correct
59 Correct 157 ms 7480 KB Output is correct
60 Correct 16 ms 7512 KB Output is correct
61 Incorrect 117 ms 7712 KB Output isn't correct
62 Correct 183 ms 7576 KB Output is correct
63 Correct 84 ms 7564 KB Output is correct
64 Incorrect 249 ms 7512 KB Output isn't correct
65 Correct 144 ms 7568 KB Output is correct
66 Correct 95 ms 7504 KB Output is correct
67 Correct 91 ms 7508 KB Output is correct
68 Correct 51 ms 7516 KB Output is correct
69 Correct 47 ms 7516 KB Output is correct
70 Correct 34 ms 7516 KB Output is correct
71 Correct 30 ms 7512 KB Output is correct
72 Correct 26 ms 7512 KB Output is correct
73 Correct 46 ms 7768 KB Output is correct
74 Correct 85 ms 7772 KB Output is correct
75 Correct 67 ms 7772 KB Output is correct
76 Correct 63 ms 7768 KB Output is correct
77 Correct 73 ms 8016 KB Output is correct
78 Correct 85 ms 7768 KB Output is correct
79 Correct 80 ms 7772 KB Output is correct
80 Correct 71 ms 7768 KB Output is correct
81 Correct 77 ms 8016 KB Output is correct
82 Correct 65 ms 7776 KB Output is correct
83 Correct 84 ms 7772 KB Output is correct
84 Correct 108 ms 7772 KB Output is correct
85 Correct 87 ms 7768 KB Output is correct
86 Correct 87 ms 7776 KB Output is correct
87 Correct 91 ms 7772 KB Output is correct
88 Correct 96 ms 7516 KB Output is correct
89 Correct 127 ms 7768 KB Output is correct
90 Correct 102 ms 7512 KB Output is correct
91 Correct 106 ms 7516 KB Output is correct
92 Correct 105 ms 7720 KB Output is correct