답안 #1078926

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1078926	2024-08-28T08:15:46 Z	Yang8on	Mecho (IOI09_mecho)	C++17	73 / 100	134 ms	7036 KB

mecho

#include <bits/stdc++.h>
#define Y8o "main"
#define maxn (int) 805
#define ll long long
#define pii pair<int, int>
#define gb(i, j) ((i >> j) & 1)
#define all(x) x.begin(), x.end()
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r

#define f first
#define s second

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll GetRandom(ll l, ll r) {
    return uniform_int_distribution<ll> (l, r) (rng);
}
void iof() {
    if(fopen(Y8o".inp", "r"))
    {
        freopen(Y8o".inp", "r", stdin);
//        freopen(Y8o".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(NULL), cout.tie(NULL);
}
void ctime() {
    cerr << "\n" << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}

int n, S;
pii st, en;
char a[maxn][maxn];
int lim[maxn][maxn], dp[maxn][maxn];
int dx[] = { 1, -1, 0, 0 };
int dy[] = { 0, 0, -1, 1 };
bool exist(int u, int v) { return 1 <= u && u <= n && 1 <= v && v <= n && a[u][v] != 'T'; }

bool check(int tg) {
    for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++)
        dp[i][j] = 1e9;
    dp[st.f][st.s] = tg * S;

    if(dp[st.f][st.s] > lim[st.f][st.s]) return false;

    queue<pii> q;
    q.push(st);
    while(q.size()) {
        int i, j; tie(i, j) = q.front();
        q.pop();
        for(int t = 0; t <= 3; t ++) {
            int u = i + dx[t], v = j + dy[t];
            if(exist(u, v) && dp[u][v] > dp[i][j] + 1) {
                if(dp[i][j] + 1 < lim[u][v]) {
                    dp[u][v] = dp[i][j] + 1;
                    q.push({ u, v });
                }
                else if(a[u][v] == 'D' && dp[i][j] + 1 <= lim[u][v]) {
                    dp[u][v] = dp[i][j] + 1;
                    q.push({ u, v });
                }
            }
        }
    }
    return dp[en.f][en.s] != 1e9;
}

void solve() {
    cin >> n >> S;
    for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++) {
        cin >> a[i][j];
        if(a[i][j] == 'M') st = {i, j};
        else if(a[i][j] == 'D') en = {i, j};
    }

    queue<pii> q;
    for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++) {
        lim[i][j] = 1e9;
        if(a[i][j] == 'H') lim[i][j] = 0, q.push({ i, j });
    }
    while(q.size()) {
        int i, j; tie(i, j) = q.front();
        q.pop();
        for(int t = 0; t <= 3; t ++) {
            int u = i + dx[t], v = j + dy[t];
            if(exist(u, v)) {
                if(lim[u][v] > lim[i][j] + S) {
                    lim[u][v] = lim[i][j] + S;
                    q.push({ u, v });
                }
            }
        }
    }

    int l = 0, r = n * n;
    while(l <= r) {
        int mid = (l + r) >> 1;
        if(check(mid)) l = mid + 1;
        else r = mid - 1;
    }
    if(r < 0) cout << -1;
    else cout << r;
}

int main() {
    iof();

    int nTest = 1;
//    cin >> nTest;

    while(nTest --) {
        solve();
    }

    ctime();
    return 0;
}

Compilation message

mecho.cpp: In function 'void iof()':
mecho.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen(Y8o".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

73.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Correct	0 ms	348 KB	Output is correct
4	Incorrect	0 ms	348 KB	Output isn't correct
5	Correct	0 ms	348 KB	Output is correct
6	Incorrect	0 ms	348 KB	Output isn't correct
7	Incorrect	62 ms	6736 KB	Output isn't correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Incorrect	1 ms	860 KB	Output isn't correct
13	Incorrect	1 ms	604 KB	Output isn't correct
14	Correct	1 ms	860 KB	Output is correct
15	Correct	0 ms	604 KB	Output is correct
16	Correct	0 ms	604 KB	Output is correct
17	Correct	0 ms	604 KB	Output is correct
18	Correct	0 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	0 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	1 ms	856 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Correct	1 ms	860 KB	Output is correct
26	Correct	2 ms	860 KB	Output is correct
27	Correct	1 ms	860 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	1 ms	860 KB	Output is correct
30	Correct	1 ms	860 KB	Output is correct
31	Correct	1 ms	860 KB	Output is correct
32	Correct	1 ms	856 KB	Output is correct
33	Correct	5 ms	2904 KB	Output is correct
34	Correct	5 ms	2908 KB	Output is correct
35	Correct	14 ms	3080 KB	Output is correct
36	Correct	6 ms	3420 KB	Output is correct
37	Correct	6 ms	3420 KB	Output is correct
38	Correct	18 ms	3480 KB	Output is correct
39	Correct	7 ms	3676 KB	Output is correct
40	Correct	7 ms	3876 KB	Output is correct
41	Correct	25 ms	3728 KB	Output is correct
42	Correct	10 ms	4188 KB	Output is correct
43	Correct	9 ms	4108 KB	Output is correct
44	Correct	30 ms	4188 KB	Output is correct
45	Correct	11 ms	4444 KB	Output is correct
46	Correct	14 ms	4440 KB	Output is correct
47	Correct	34 ms	4656 KB	Output is correct
48	Correct	11 ms	4952 KB	Output is correct
49	Correct	13 ms	4956 KB	Output is correct
50	Correct	45 ms	5052 KB	Output is correct
51	Correct	16 ms	5468 KB	Output is correct
52	Correct	14 ms	5492 KB	Output is correct
53	Correct	51 ms	5468 KB	Output is correct
54	Correct	20 ms	5720 KB	Output is correct
55	Correct	16 ms	5724 KB	Output is correct
56	Correct	58 ms	5724 KB	Output is correct
57	Correct	19 ms	6236 KB	Output is correct
58	Correct	19 ms	6236 KB	Output is correct
59	Correct	71 ms	6228 KB	Output is correct
60	Correct	21 ms	6744 KB	Output is correct
61	Correct	20 ms	6748 KB	Output is correct
62	Correct	76 ms	6744 KB	Output is correct
63	Correct	73 ms	6552 KB	Output is correct
64	Correct	134 ms	6740 KB	Output is correct
65	Correct	106 ms	6744 KB	Output is correct
66	Correct	91 ms	6748 KB	Output is correct
67	Correct	79 ms	6756 KB	Output is correct
68	Correct	38 ms	6736 KB	Output is correct
69	Correct	38 ms	6736 KB	Output is correct
70	Correct	37 ms	6740 KB	Output is correct
71	Correct	33 ms	6648 KB	Output is correct
72	Incorrect	26 ms	6748 KB	Output isn't correct
73	Incorrect	30 ms	7036 KB	Output isn't correct
74	Correct	40 ms	6828 KB	Output is correct
75	Correct	50 ms	7000 KB	Output is correct
76	Correct	43 ms	7004 KB	Output is correct
77	Correct	49 ms	7000 KB	Output is correct
78	Correct	50 ms	7000 KB	Output is correct
79	Correct	35 ms	6812 KB	Output is correct
80	Correct	42 ms	6992 KB	Output is correct
81	Correct	48 ms	7000 KB	Output is correct
82	Correct	42 ms	7012 KB	Output is correct
83	Correct	58 ms	6736 KB	Output is correct
84	Correct	46 ms	6744 KB	Output is correct
85	Correct	51 ms	6972 KB	Output is correct
86	Correct	54 ms	6748 KB	Output is correct
87	Correct	52 ms	6964 KB	Output is correct
88	Correct	89 ms	6720 KB	Output is correct
89	Correct	53 ms	6748 KB	Output is correct
90	Correct	54 ms	6740 KB	Output is correct
91	Correct	54 ms	6724 KB	Output is correct
92	Correct	57 ms	6748 KB	Output is correct