oj.uz

답안 #499690

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499690 2021-12-29T08:55:52 Z tphuc2908 Mecho (IOI09_mecho) C++14
81 / 100
 170 ms 6256 KB 
#include<bits/stdc++.h>

using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define repi(i,x,y) for(int i = x; i >= y; --i)
#define ci(x) int x; cin>> x
#define TC(t) ci(t); while(t--)
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define cii(x, y) ci(x); ci(y)
#define ciii(x, y, z) ci(x); ci(y); ci(z)
#define mp make_pair
//#define int long long
typedef long long ll;
typedef vector<int> vi;
const int N = 8e2 + 5;
const int mod = 1e9 + 7;
const int mod1 = 1e9 + 9;
const int pi = 31;
const int inf = 1e9 + 5;
const int block = 330;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};

void readfile(){
    #ifdef ONLINE_JUDGE
    #else
        freopen("text.inp", "r", stdin);
    #endif // ONLINE_JUDGE
//    freopen("gravity.in", "r", stdin);
//    freopen("gravity.out", "w", stdout);
}

int n, s;
char a[N][N];
pair<int,int> st, e;

void inp(){
    cin >> n >> s;
    rep(i,1,n)
        rep(j,1,n){
            cin >> a[i][j];
            if(a[i][j]=='M')
                st = mp(i, j);
            if(a[i][j]=='D')
                e = mp(i, j);
        }
}

int d[N][N], d1[N][N];

void bfs_multi_source(){
    queue<pair<int,int> > q;
    rep(i,1,n)
        rep(j,1,n){
            d1[i][j] = inf;
            if(a[i][j]=='H')
                q.push(mp(i ,j)), d1[i][j] = 0;
        }
    while(!q.empty()){
        pair<int,int> top = q.front();
        q.pop();
        rep(i,0,3){
            int x = top.fi + dx[i];
            int y = top.se + dy[i];
            if(1 <= x && x <= n && 1 <= y && y <= n && a[x][y]!='T' && d1[x][y] > d1[top.fi][top.se] + 1){
                d1[x][y] = d1[top.fi][top.se] + 1;
                q.push(mp(x,y));
            }
        }
    }
}

void bfs(int x, int y, int ti){
    rep(i,1,n)
        rep(j,1,n)
            d[i][j] = inf;
    queue<pair<int,int> > q;
    q.push(mp(x, y));
    d[x][y] = ti;
    while(!q.empty()){
        auto top = q.front();
        q.pop();
        rep(i,0,3){
            int x = top.fi + dx[i];
            int y = top.se + dy[i];
            if(1 <= x && x <= n && 1 <= y && y <= n && a[x][y]!='T' && d[x][y] > d[top.fi][top.se] + 1){
                d[x][y] = d[top.fi][top.se] + 1;
                int diff = d[x][y] - ti - 1;
                diff /= s;
                diff += ti + 1;
                if(diff < d1[x][y] || (diff==d1[x][y] && d[x][y] - d[top.fi][top.se] < s))
                    q.push(mp(x, y));
            }
        }
    }
}

void process(){
    bfs_multi_source();
    int l = 0, r = n*n + 1, res = -1;
    while(l <= r){
        int mid = (l + r) >> 1;
        bfs(st.fi, st.se, mid);
        if(d[e.fi][e.se]==inf)
            r = mid - 1;
        else{
            res = mid;
            l = mid + 1;
        }
    }
    cout << res;
}

int main() {
   // readfile();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    TC(t){
        inp();
        process();
//    }
    return 0;
}

Compilation message

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

Subtask #1
81.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 85 ms 6024 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Incorrect 0 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 Correct 0 ms 460 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 0 ms 460 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 1 ms 588 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 1 ms 716 KB Output is correct
26 Correct 1 ms 716 KB Output is correct
27 Correct 1 ms 716 KB Output is correct
28 Correct 1 ms 716 KB Output is correct
29 Correct 1 ms 716 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 1 ms 844 KB Output is correct
32 Correct 1 ms 844 KB Output is correct
33 Correct 5 ms 2716 KB Output is correct
34 Correct 6 ms 2764 KB Output is correct
35 Correct 20 ms 2764 KB Output is correct
36 Correct 7 ms 3052 KB Output is correct
37 Correct 7 ms 3052 KB Output is correct
38 Correct 24 ms 3052 KB Output is correct
39 Correct 9 ms 3404 KB Output is correct
40 Correct 9 ms 3404 KB Output is correct
41 Correct 37 ms 3404 KB Output is correct
42 Correct 13 ms 3788 KB Output is correct
43 Correct 11 ms 3788 KB Output is correct
44 Correct 46 ms 3860 KB Output is correct
45 Correct 12 ms 4160 KB Output is correct
46 Correct 13 ms 4232 KB Output is correct
47 Correct 50 ms 4220 KB Output is correct
48 Correct 13 ms 4556 KB Output is correct
49 Correct 17 ms 4584 KB Output is correct
50 Correct 67 ms 4572 KB Output is correct
51 Correct 17 ms 4812 KB Output is correct
52 Correct 23 ms 4928 KB Output is correct
53 Correct 74 ms 4940 KB Output is correct
54 Correct 18 ms 5196 KB Output is correct
55 Correct 20 ms 5196 KB Output is correct
56 Correct 88 ms 5276 KB Output is correct
57 Correct 22 ms 5644 KB Output is correct
58 Correct 25 ms 5580 KB Output is correct
59 Correct 102 ms 5584 KB Output is correct
60 Correct 24 ms 5912 KB Output is correct
61 Correct 26 ms 5964 KB Output is correct
62 Correct 106 ms 5988 KB Output is correct
63 Correct 94 ms 5960 KB Output is correct
64 Correct 170 ms 5920 KB Output is correct
65 Correct 131 ms 5956 KB Output is correct
66 Incorrect 116 ms 5980 KB Output isn't correct
67 Correct 107 ms 5984 KB Output is correct
68 Correct 45 ms 5932 KB Output is correct
69 Correct 46 ms 5976 KB Output is correct
70 Correct 36 ms 5944 KB Output is correct
71 Correct 39 ms 5936 KB Output is correct
72 Incorrect 31 ms 6024 KB Output isn't correct
73 Incorrect 42 ms 6192 KB Output isn't correct
74 Correct 55 ms 6212 KB Output is correct
75 Correct 93 ms 6212 KB Output is correct
76 Correct 58 ms 6188 KB Output is correct
77 Correct 57 ms 6256 KB Output is correct
78 Correct 74 ms 6160 KB Output is correct
79 Correct 48 ms 6236 KB Output is correct
80 Correct 56 ms 6164 KB Output is correct
81 Correct 64 ms 6152 KB Output is correct
82 Correct 57 ms 6136 KB Output is correct
83 Correct 75 ms 6244 KB Output is correct
84 Correct 81 ms 6104 KB Output is correct
85 Correct 73 ms 6132 KB Output is correct
86 Correct 68 ms 6220 KB Output is correct
87 Correct 67 ms 6200 KB Output is correct
88 Correct 71 ms 6092 KB Output is correct
89 Correct 72 ms 6140 KB Output is correct
90 Correct 77 ms 6120 KB Output is correct
91 Correct 84 ms 6140 KB Output is correct
92 Correct 78 ms 6064 KB Output is correct