oj.uz

Submission #499700

# Submission time Handle Problem Language Result Execution time Memory
499700 2021-12-29T09:19:21 Z tphuc2908 Mecho (IOI09_mecho) C++14
81 / 100
 184 ms 6332 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));
            }
        }
    }
}

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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 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 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 99 ms 6084 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 316 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 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 0 ms 452 KB Output is correct
18 Correct 1 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 572 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 580 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 696 KB Output is correct
29 Correct 1 ms 816 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 828 KB Output is correct
33 Correct 6 ms 2764 KB Output is correct
34 Correct 7 ms 2764 KB Output is correct
35 Correct 29 ms 2832 KB Output is correct
36 Correct 9 ms 3172 KB Output is correct
37 Correct 8 ms 3172 KB Output is correct
38 Correct 60 ms 3200 KB Output is correct
39 Correct 10 ms 3528 KB Output is correct
40 Correct 11 ms 3560 KB Output is correct
41 Correct 41 ms 3572 KB Output is correct
42 Correct 13 ms 3912 KB Output is correct
43 Correct 13 ms 3912 KB Output is correct
44 Correct 48 ms 3884 KB Output is correct
45 Correct 15 ms 4156 KB Output is correct
46 Correct 16 ms 4160 KB Output is correct
47 Correct 49 ms 4184 KB Output is correct
48 Correct 16 ms 4540 KB Output is correct
49 Correct 19 ms 4548 KB Output is correct
50 Correct 61 ms 4640 KB Output is correct
51 Correct 20 ms 4932 KB Output is correct
52 Correct 21 ms 5000 KB Output is correct
53 Correct 75 ms 4984 KB Output is correct
54 Correct 22 ms 5312 KB Output is correct
55 Correct 25 ms 5304 KB Output is correct
56 Correct 95 ms 5356 KB Output is correct
57 Correct 25 ms 5628 KB Output is correct
58 Correct 32 ms 5684 KB Output is correct
59 Correct 107 ms 5572 KB Output is correct
60 Correct 32 ms 5956 KB Output is correct
61 Correct 31 ms 5976 KB Output is correct
62 Correct 114 ms 6048 KB Output is correct
63 Correct 127 ms 5956 KB Output is correct
64 Correct 184 ms 5956 KB Output is correct
65 Correct 147 ms 6048 KB Output is correct
66 Incorrect 127 ms 6052 KB Output isn't correct
67 Correct 145 ms 6048 KB Output is correct
68 Correct 57 ms 6000 KB Output is correct
69 Correct 52 ms 5956 KB Output is correct
70 Correct 44 ms 6072 KB Output is correct
71 Correct 73 ms 5956 KB Output is correct
72 Incorrect 37 ms 5984 KB Output isn't correct
73 Incorrect 80 ms 6220 KB Output isn't correct
74 Correct 88 ms 6332 KB Output is correct
75 Correct 74 ms 6268 KB Output is correct
76 Correct 87 ms 6248 KB Output is correct
77 Correct 65 ms 6208 KB Output is correct
78 Correct 115 ms 6212 KB Output is correct
79 Correct 52 ms 6200 KB Output is correct
80 Correct 62 ms 6200 KB Output is correct
81 Correct 68 ms 6236 KB Output is correct
82 Correct 75 ms 6252 KB Output is correct
83 Correct 76 ms 6256 KB Output is correct
84 Correct 82 ms 6172 KB Output is correct
85 Correct 75 ms 6256 KB Output is correct
86 Correct 82 ms 6172 KB Output is correct
87 Correct 83 ms 6260 KB Output is correct
88 Correct 84 ms 6212 KB Output is correct
89 Correct 100 ms 6208 KB Output is correct
90 Correct 80 ms 6216 KB Output is correct
91 Correct 93 ms 6084 KB Output is correct
92 Correct 86 ms 6256 KB Output is correct