oj.uz

답안 #1027023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027023 2024-07-18T18:54:26 Z lmToT27 Mecho (IOI09_mecho) C++14
100 / 100
 97 ms 7256 KB 
#include <bits/stdc++.h>
#define all(dataStructure) dataStructure.begin(),dataStructure.end()
#define ll long long
 
using namespace std;
namespace std {
        template <typename T, int D>
        struct _vector : public vector <_vector <T, D - 1>> {
                static_assert(D >= 1, "Dimension must be positive!");
                template <typename... Args>
                _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
        };
        // _vector <int, 3> a(n, m, k);: int a[n][m][k].
        // _vector <int, 3> a(n, m, k, x);: int a[n][m][k] initialized with x.
        template <typename T>
        struct _vector <T, 1> : public vector <T> {
                _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
        };
}
 
const int MAX = 8e2 + 3;
const ll MOD[] = {1000000007, 998244353};
 
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
char a[MAX][MAX];
int n, s;
int badTime[MAX][MAX];
bool vs[MAX][MAX];
int d[MAX][MAX];
 
bool ok(int i, int j) {
        return i && j && max(i, j) <= n && a[i][j] != 'T';
}
 
void Solve() {
        cin >> n >> s;
        pair <int, int> house;
        pair <int, int> start;
        queue <pair <int, int>> q;
        for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= n; j++) {
                        cin >> a[i][j];
                        if (a[i][j] == 'D') house = {i, j};
                        if (a[i][j] == 'M') start = {i, j};
                        if (a[i][j] == 'H') {
                                vs[i][j] = 1;
                                q.push({i, j});
                        }
                }
        }
        
        while (q.size()) {
                auto [u, v] = q.front();
                q.pop();
                for (int i = 0; i < 4; i++) {
                        int x = u + dx[i];
                        int y = v + dy[i];
                        if (a[x][y] == 'D') continue;
                        if (ok(x, y) && !vs[x][y]) {
                                vs[x][y] = 1;
                                badTime[x][y] = badTime[u][v] + 1;
                                q.push({x, y});
                        }
                }
        }
 
        badTime[house.first][house.second] = 1e9;
 
        auto check = [&](int val) -> bool {
                memset(vs, 0, sizeof vs);
                memset(d, 0, sizeof d);
 
                vs[start.first][start.second] = 1;
                queue <pair <int, int>> q;
                q.push(start);
                
                while (q.size()) {
                        auto [u, v] = q.front();
                        q.pop();
                        for (int i = 0; i < 4; i++) {
                                int x = u + dx[i];
                                int y = v + dy[i];
                                if (ok(x, y)) {
                                        if (vs[x][y] == 0 && (badTime[x][y] - (d[u][v] + 1) / s - 1) >= val) {
                                                vs[x][y] = 1;
                                                q.push({x, y});
                                                d[x][y] = d[u][v] + 1;
                                        }
                                }
                        }
                }
                
                return vs[house.first][house.second];
        };
 
        int ans = -1;
        int l = 0, r = badTime[start.first][start.second] - 1;
 
        while (l <= r) {
                int mid = (l + r) / 2;
                if (check(mid)) {
                        l = mid + 1;
                        ans = mid;
                } else r = mid - 1;
        }
        cout << ans;
}
 
int32_t main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);
 
        #define TASK "TASK"
        if (fopen(TASK".INP", "r")) {
                freopen(TASK".INP", "r", stdin);
                freopen(TASK".OUT", "w", stdout);
        }
        
        /* int TEST = 1; cin >> TEST; while (TEST--) */ Solve();
 
        cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
        return 0;
}

Compilation message

mecho.cpp: In function 'void Solve()':
mecho.cpp:54:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |                 auto [u, v] = q.front();
      |                      ^
mecho.cpp: In lambda function:
mecho.cpp:79:30: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   79 |                         auto [u, v] = q.front();
      |                              ^
mecho.cpp: In function 'int32_t main()':
mecho.cpp:116:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  116 |                 freopen(TASK".INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:117:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |                 freopen(TASK".OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 56 ms 6860 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct
21 Correct 1 ms 6748 KB Output is correct
22 Correct 1 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 1 ms 6748 KB Output is correct
25 Correct 2 ms 6744 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 3 ms 6748 KB Output is correct
28 Correct 2 ms 6748 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 2 ms 6588 KB Output is correct
31 Correct 2 ms 6748 KB Output is correct
32 Correct 2 ms 6748 KB Output is correct
33 Correct 4 ms 6592 KB Output is correct
34 Correct 5 ms 6768 KB Output is correct
35 Correct 13 ms 6748 KB Output is correct
36 Correct 5 ms 6748 KB Output is correct
37 Correct 5 ms 6768 KB Output is correct
38 Correct 19 ms 6744 KB Output is correct
39 Correct 6 ms 6748 KB Output is correct
40 Correct 6 ms 6772 KB Output is correct
41 Correct 23 ms 6748 KB Output is correct
42 Correct 8 ms 6748 KB Output is correct
43 Correct 7 ms 6748 KB Output is correct
44 Correct 29 ms 6776 KB Output is correct
45 Correct 8 ms 6748 KB Output is correct
46 Correct 8 ms 6748 KB Output is correct
47 Correct 34 ms 6772 KB Output is correct
48 Correct 9 ms 6748 KB Output is correct
49 Correct 9 ms 6768 KB Output is correct
50 Correct 43 ms 6748 KB Output is correct
51 Correct 10 ms 6748 KB Output is correct
52 Correct 11 ms 6592 KB Output is correct
53 Correct 48 ms 6748 KB Output is correct
54 Correct 12 ms 6744 KB Output is correct
55 Correct 16 ms 6748 KB Output is correct
56 Correct 54 ms 6748 KB Output is correct
57 Correct 13 ms 6748 KB Output is correct
58 Correct 14 ms 6776 KB Output is correct
59 Correct 62 ms 6748 KB Output is correct
60 Correct 21 ms 6744 KB Output is correct
61 Correct 15 ms 6748 KB Output is correct
62 Correct 70 ms 6748 KB Output is correct
63 Correct 64 ms 6748 KB Output is correct
64 Correct 97 ms 6744 KB Output is correct
65 Correct 95 ms 6748 KB Output is correct
66 Correct 84 ms 6744 KB Output is correct
67 Correct 70 ms 6744 KB Output is correct
68 Correct 30 ms 6748 KB Output is correct
69 Correct 26 ms 6748 KB Output is correct
70 Correct 22 ms 6744 KB Output is correct
71 Correct 19 ms 6620 KB Output is correct
72 Correct 20 ms 6744 KB Output is correct
73 Correct 21 ms 6880 KB Output is correct
74 Correct 38 ms 7004 KB Output is correct
75 Correct 39 ms 7004 KB Output is correct
76 Correct 37 ms 7004 KB Output is correct
77 Correct 40 ms 7256 KB Output is correct
78 Correct 45 ms 7000 KB Output is correct
79 Correct 35 ms 6848 KB Output is correct
80 Correct 42 ms 7156 KB Output is correct
81 Correct 39 ms 7004 KB Output is correct
82 Correct 35 ms 7004 KB Output is correct
83 Correct 49 ms 6744 KB Output is correct
84 Correct 43 ms 6748 KB Output is correct
85 Correct 45 ms 6744 KB Output is correct
86 Correct 52 ms 6744 KB Output is correct
87 Correct 48 ms 6748 KB Output is correct
88 Correct 60 ms 6748 KB Output is correct
89 Correct 54 ms 6744 KB Output is correct
90 Correct 57 ms 6748 KB Output is correct
91 Correct 54 ms 6680 KB Output is correct
92 Correct 51 ms 6744 KB Output is correct