oj.uz

답안 #500731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500731 2022-01-01T01:59:54 Z kevin Mecho (IOI09_mecho) C++17
30 / 100
 227 ms 8152 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define nl cout<<"\n"
#define f first
#define s second
#define ca(v) for(auto i:v) cout<<i<<" ";

int xm[4] = {-1, 1, 0, 0};
int ym[4] = {0, 0, -1, 1};

int grid[801][801];
int dst[801][801];

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("input.in", "r")) freopen("input.in", "r", stdin);
    int n; cin>>n; int x; cin>>x;
    queue<pair<int, int>> q;
    pair<int, int> st;
    pair<int, int> ed;
    vector<vector<bool>> vis(n, vector<bool>(n, 0));
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            char c; cin>>c;
            grid[i][j] = (c != 'T');
            if(c == 'M') st = {i, j};
            if(c == 'D') ed = {i, j};
            if(c == 'H') {
                q.push({i, j});
                vis[i][j] = 1;
            }
        }
    }
    while(q.size()){
        auto c = q.front(); q.pop();
        for(int i=0; i<4; i++){
            int nx = c.f + xm[i];
            int ny = c.s + ym[i];
            if(nx >= 0 && nx < n && ny >= 0 && ny < n && grid[nx][ny] && !vis[nx][ny]){
                vis[nx][ny] = 1;
                dst[nx][ny] = dst[c.f][c.s] + 1;
                q.push({nx, ny});
            }
        }
    }
    int l = 0;
    int r = n*n+5;
    int ans = -1;
    while(l <= r){
        int m = (l + r) / 2;
        vis = vector<vector<bool>>(n, vector<bool>(n, 0));
        vector<vector<int>> d(n, vector<int>(n, 0));
        vis[st.f][st.s] = 1;
        d[st.f][st.s] = m * x;
        q.push({st.f, st.s});
        // cout<<m<<"\n";
        while(q.size()){
            auto c = q.front(); q.pop();
            int mx = (d[c.f][c.s] + x) / x;
            for(int i=0; i<4; i++){
                int nx = c.f + xm[i];
                int ny = c.s + ym[i];
                if(nx >= 0 && nx < n && ny >= 0 && ny < n && grid[nx][ny] && !vis[nx][ny] && mx <= dst[nx][ny]){
                    d[nx][ny] = d[c.f][c.s] + 1;
                    vis[nx][ny] = 1;
                    q.push({nx, ny});
                }
            }
        }
        // for(int i=0; i<n; i++){
        //     for(int j=0; j<n; j++){
        //         cout<<dst[i][j]<<"|"<<d[i][j]<<" ";
        //     } nl;
        // }
        if(vis[ed.f][ed.s]){
            l = m+1;
            ans = m;
        }
        else{
            r = m-1;
        }
        // nl;
    }
    cout<<ans;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:19:40: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     if (fopen("input.in", "r")) freopen("input.in", "r", stdin);
      |                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 332 KB Output isn't correct
2 Incorrect 0 ms 332 KB Output isn't correct
3 Incorrect 0 ms 332 KB Output isn't correct
4 Incorrect 0 ms 332 KB Output isn't correct
5 Correct 0 ms 332 KB Output is correct
6 Incorrect 0 ms 332 KB Output isn't correct
7 Incorrect 109 ms 8072 KB Output isn't correct
8 Incorrect 0 ms 332 KB Output isn't correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Incorrect 1 ms 716 KB Output isn't correct
13 Incorrect 1 ms 588 KB Output isn't correct
14 Correct 1 ms 716 KB Output is correct
15 Incorrect 1 ms 332 KB Output isn't correct
16 Correct 1 ms 332 KB Output is correct
17 Incorrect 0 ms 460 KB Output isn't correct
18 Correct 1 ms 460 KB Output is correct
19 Incorrect 1 ms 460 KB Output isn't correct
20 Correct 1 ms 460 KB Output is correct
21 Incorrect 1 ms 460 KB Output isn't correct
22 Correct 1 ms 460 KB Output is correct
23 Incorrect 1 ms 588 KB Output isn't correct
24 Correct 1 ms 588 KB Output is correct
25 Incorrect 1 ms 716 KB Output isn't correct
26 Correct 1 ms 716 KB Output is correct
27 Incorrect 1 ms 716 KB Output isn't correct
28 Correct 2 ms 716 KB Output is correct
29 Incorrect 1 ms 716 KB Output isn't correct
30 Correct 2 ms 716 KB Output is correct
31 Incorrect 1 ms 716 KB Output isn't correct
32 Correct 1 ms 716 KB Output is correct
33 Incorrect 8 ms 3048 KB Output isn't correct
34 Correct 8 ms 3048 KB Output is correct
35 Correct 26 ms 3060 KB Output is correct
36 Incorrect 9 ms 3524 KB Output isn't correct
37 Correct 10 ms 3520 KB Output is correct
38 Correct 40 ms 3556 KB Output is correct
39 Incorrect 13 ms 4080 KB Output isn't correct
40 Correct 19 ms 4004 KB Output is correct
41 Correct 52 ms 4056 KB Output is correct
42 Incorrect 17 ms 4492 KB Output isn't correct
43 Correct 18 ms 4580 KB Output is correct
44 Correct 59 ms 4512 KB Output is correct
45 Incorrect 19 ms 5076 KB Output isn't correct
46 Correct 20 ms 5040 KB Output is correct
47 Correct 61 ms 5092 KB Output is correct
48 Incorrect 23 ms 5668 KB Output isn't correct
49 Correct 24 ms 5628 KB Output is correct
50 Correct 77 ms 5628 KB Output is correct
51 Incorrect 25 ms 6208 KB Output isn't correct
52 Correct 37 ms 6180 KB Output is correct
53 Correct 103 ms 6208 KB Output is correct
54 Incorrect 35 ms 6800 KB Output isn't correct
55 Correct 33 ms 6764 KB Output is correct
56 Correct 119 ms 6780 KB Output is correct
57 Incorrect 34 ms 7412 KB Output isn't correct
58 Correct 37 ms 7408 KB Output is correct
59 Correct 140 ms 7364 KB Output is correct
60 Incorrect 39 ms 8060 KB Output isn't correct
61 Correct 41 ms 8016 KB Output is correct
62 Correct 172 ms 8116 KB Output is correct
63 Correct 124 ms 7988 KB Output is correct
64 Correct 227 ms 7992 KB Output is correct
65 Correct 179 ms 8028 KB Output is correct
66 Incorrect 178 ms 8112 KB Output isn't correct
67 Correct 165 ms 8040 KB Output is correct
68 Correct 77 ms 8016 KB Output is correct
69 Correct 72 ms 8036 KB Output is correct
70 Correct 54 ms 8076 KB Output is correct
71 Correct 61 ms 8040 KB Output is correct
72 Incorrect 54 ms 8132 KB Output isn't correct
73 Incorrect 61 ms 8072 KB Output isn't correct
74 Correct 86 ms 8052 KB Output is correct
75 Correct 122 ms 8024 KB Output is correct
76 Correct 81 ms 8064 KB Output is correct
77 Correct 80 ms 8032 KB Output is correct
78 Correct 112 ms 8152 KB Output is correct
79 Correct 67 ms 8040 KB Output is correct
80 Correct 82 ms 8108 KB Output is correct
81 Correct 86 ms 8052 KB Output is correct
82 Correct 80 ms 8064 KB Output is correct
83 Correct 102 ms 8044 KB Output is correct
84 Correct 88 ms 8032 KB Output is correct
85 Correct 99 ms 8040 KB Output is correct
86 Correct 94 ms 8028 KB Output is correct
87 Correct 100 ms 8040 KB Output is correct
88 Correct 103 ms 8036 KB Output is correct
89 Correct 106 ms 8072 KB Output is correct
90 Correct 105 ms 8032 KB Output is correct
91 Correct 102 ms 8104 KB Output is correct
92 Correct 108 ms 8016 KB Output is correct