oj.uz

답안 #499758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499758 2021-12-29T12:07:39 Z tphuc2908 Mecho (IOI09_mecho) C++14
100 / 100
 214 ms 11580 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' && a[x][y]!='D' && d1[x][y] > d1[top.fi][top.se] + 1){
                d1[x][y] = d1[top.fi][top.se] + 1;
                q.push(mp(x,y));
            }
        }
    }
}

int vis[N][N], m[N][N];

void bfs(int x, int y, int ti){
    rep(i,1,n)
        rep(j,1,n)
            d[i][j] = inf, vis[i][j] = 0;
    queue<pair<int,int> > q;
    q.push(mp(x, y));
    d[x][y] = ti;
    if(ti >= d1[x][y]) return;
    while(!q.empty()){
        auto top = q.front();
        q.pop();
        vis[top.fi][top.se] = 1;
        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;
                m[x][y] = (m[top.fi][top.se] + 1) % s;
                int diff = d[x][y] - ti - 1;
                diff /= s;
                diff += ti + 1;
                if(diff < d1[x][y] || (diff==d1[x][y] && m[x][y]))
                    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;
        if(mid==240)
            int h = 0;
        bfs(st.fi, st.se, mid);
        if(!vis[e.fi][e.se])
            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 process()':
mecho.cpp:115:17: warning: unused variable 'h' [-Wunused-variable]
  115 |             int h = 0;
      |                 ^
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
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 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 1 ms 460 KB Output is correct
7 Correct 113 ms 10436 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 448 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 844 KB Output is correct
14 Correct 1 ms 968 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 1 ms 568 KB Output is correct
17 Correct 1 ms 580 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 716 KB Output is correct
22 Correct 1 ms 704 KB Output is correct
23 Correct 1 ms 844 KB Output is correct
24 Correct 1 ms 844 KB Output is correct
25 Correct 1 ms 972 KB Output is correct
26 Correct 1 ms 972 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 1 ms 1100 KB Output is correct
29 Correct 1 ms 1092 KB Output is correct
30 Correct 1 ms 1100 KB Output is correct
31 Correct 1 ms 1100 KB Output is correct
32 Correct 1 ms 1220 KB Output is correct
33 Correct 7 ms 4284 KB Output is correct
34 Correct 7 ms 4540 KB Output is correct
35 Correct 35 ms 5124 KB Output is correct
36 Correct 9 ms 4812 KB Output is correct
37 Correct 10 ms 5192 KB Output is correct
38 Correct 31 ms 5836 KB Output is correct
39 Correct 10 ms 5456 KB Output is correct
40 Correct 11 ms 5836 KB Output is correct
41 Correct 41 ms 6528 KB Output is correct
42 Correct 12 ms 5960 KB Output is correct
43 Correct 13 ms 6348 KB Output is correct
44 Correct 60 ms 7228 KB Output is correct
45 Correct 17 ms 6580 KB Output is correct
46 Correct 22 ms 6980 KB Output is correct
47 Correct 63 ms 7912 KB Output is correct
48 Correct 18 ms 7116 KB Output is correct
49 Correct 24 ms 7620 KB Output is correct
50 Correct 70 ms 8564 KB Output is correct
51 Correct 20 ms 7744 KB Output is correct
52 Correct 22 ms 8256 KB Output is correct
53 Correct 89 ms 9268 KB Output is correct
54 Correct 23 ms 8200 KB Output is correct
55 Correct 32 ms 8748 KB Output is correct
56 Correct 153 ms 9936 KB Output is correct
57 Correct 26 ms 8780 KB Output is correct
58 Correct 32 ms 9412 KB Output is correct
59 Correct 141 ms 10556 KB Output is correct
60 Correct 35 ms 9276 KB Output is correct
61 Correct 32 ms 9932 KB Output is correct
62 Correct 146 ms 11192 KB Output is correct
63 Correct 108 ms 11184 KB Output is correct
64 Correct 214 ms 11272 KB Output is correct
65 Correct 162 ms 11380 KB Output is correct
66 Correct 124 ms 11372 KB Output is correct
67 Correct 134 ms 11272 KB Output is correct
68 Correct 67 ms 11288 KB Output is correct
69 Correct 57 ms 11296 KB Output is correct
70 Correct 48 ms 11332 KB Output is correct
71 Correct 50 ms 11212 KB Output is correct
72 Correct 37 ms 9412 KB Output is correct
73 Correct 44 ms 11468 KB Output is correct
74 Correct 66 ms 11452 KB Output is correct
75 Correct 80 ms 11580 KB Output is correct
76 Correct 73 ms 11548 KB Output is correct
77 Correct 79 ms 11456 KB Output is correct
78 Correct 125 ms 10184 KB Output is correct
79 Correct 57 ms 9860 KB Output is correct
80 Correct 66 ms 10052 KB Output is correct
81 Correct 74 ms 10048 KB Output is correct
82 Correct 74 ms 10064 KB Output is correct
83 Correct 93 ms 10100 KB Output is correct
84 Correct 80 ms 9968 KB Output is correct
85 Correct 82 ms 10024 KB Output is correct
86 Correct 94 ms 10068 KB Output is correct
87 Correct 94 ms 10176 KB Output is correct
88 Correct 116 ms 10308 KB Output is correct
89 Correct 98 ms 10180 KB Output is correct
90 Correct 97 ms 10140 KB Output is correct
91 Correct 93 ms 10304 KB Output is correct
92 Correct 160 ms 10292 KB Output is correct