oj.uz

답안 #988321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988321 2024-05-24T13:48:11 Z steveonalex Mecho (IOI09_mecho) C++17
48 / 100
 266 ms 8272 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;
    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
48.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 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 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 109 ms 7744 KB Output is correct
8 Correct 2 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2516 KB Output is correct
12 Incorrect 1 ms 4700 KB Output isn't correct
13 Incorrect 2 ms 4700 KB Output isn't correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Incorrect 2 ms 2396 KB Output isn't correct
17 Correct 2 ms 2396 KB Output is correct
18 Incorrect 1 ms 2396 KB Output isn't correct
19 Correct 1 ms 2392 KB Output is correct
20 Incorrect 1 ms 2528 KB Output isn't correct
21 Correct 1 ms 2652 KB Output is correct
22 Incorrect 1 ms 2652 KB Output isn't correct
23 Correct 1 ms 4700 KB Output is correct
24 Incorrect 2 ms 4700 KB Output isn't correct
25 Correct 2 ms 4696 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 4564 KB Output isn't correct
31 Correct 2 ms 4700 KB Output is correct
32 Incorrect 2 ms 4696 KB Output isn't correct
33 Correct 4 ms 7004 KB Output is correct
34 Incorrect 18 ms 7000 KB Output isn't correct
35 Correct 33 ms 7004 KB Output is correct
36 Correct 5 ms 7000 KB Output is correct
37 Incorrect 25 ms 7004 KB Output isn't correct
38 Correct 46 ms 7252 KB Output is correct
39 Correct 7 ms 7000 KB Output is correct
40 Incorrect 33 ms 7220 KB Output isn't correct
41 Correct 54 ms 7004 KB Output is correct
42 Correct 8 ms 7260 KB Output is correct
43 Incorrect 38 ms 7260 KB Output isn't correct
44 Correct 63 ms 7260 KB Output is correct
45 Correct 9 ms 7224 KB Output is correct
46 Incorrect 48 ms 7260 KB Output isn't correct
47 Correct 92 ms 7256 KB Output is correct
48 Correct 10 ms 7340 KB Output is correct
49 Incorrect 57 ms 7260 KB Output isn't correct
50 Correct 98 ms 7448 KB Output is correct
51 Correct 11 ms 7512 KB Output is correct
52 Incorrect 70 ms 7580 KB Output isn't correct
53 Correct 121 ms 7516 KB Output is correct
54 Correct 15 ms 7772 KB Output is correct
55 Incorrect 95 ms 7560 KB Output isn't correct
56 Correct 135 ms 7508 KB Output is correct
57 Correct 16 ms 7620 KB Output is correct
58 Incorrect 97 ms 7764 KB Output isn't correct
59 Correct 151 ms 7852 KB Output is correct
60 Correct 16 ms 7772 KB Output is correct
61 Incorrect 105 ms 7968 KB Output isn't correct
62 Correct 183 ms 7864 KB Output is correct
63 Correct 83 ms 7956 KB Output is correct
64 Incorrect 266 ms 7932 KB Output isn't correct
65 Correct 120 ms 8000 KB Output is correct
66 Correct 122 ms 7940 KB Output is correct
67 Correct 88 ms 7812 KB Output is correct
68 Correct 64 ms 8024 KB Output is correct
69 Correct 47 ms 7972 KB Output is correct
70 Correct 46 ms 7864 KB Output is correct
71 Correct 32 ms 8020 KB Output is correct
72 Incorrect 26 ms 7764 KB Output isn't correct
73 Incorrect 38 ms 8256 KB Output isn't correct
74 Correct 77 ms 8028 KB Output is correct
75 Correct 76 ms 8272 KB Output is correct
76 Correct 62 ms 8228 KB Output is correct
77 Correct 74 ms 8052 KB Output is correct
78 Correct 83 ms 8224 KB Output is correct
79 Correct 78 ms 8092 KB Output is correct
80 Correct 68 ms 8196 KB Output is correct
81 Correct 76 ms 8020 KB Output is correct
82 Correct 72 ms 8064 KB Output is correct
83 Correct 85 ms 8192 KB Output is correct
84 Correct 100 ms 8016 KB Output is correct
85 Correct 83 ms 8028 KB Output is correct
86 Correct 95 ms 8208 KB Output is correct
87 Correct 95 ms 8208 KB Output is correct
88 Correct 101 ms 8156 KB Output is correct
89 Correct 124 ms 8020 KB Output is correct
90 Correct 101 ms 8156 KB Output is correct
91 Correct 117 ms 8132 KB Output is correct
92 Correct 98 ms 8168 KB Output is correct