oj.uz

Submission #468613

# Submission time Handle Problem Language Result Execution time Memory
468613 2021-08-29T03:21:21 Z Yuisuyuno Mecho (IOI09_mecho) C++14
84 / 100
 239 ms 11676 KB 
//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 805
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n, s;
char a[N][N];
ii M, D;
vector<ii> bee;

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    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') M = ii(i,j);
            if (a[i][j]=='D') D = ii(i,j);
            if (a[i][j]=='H') bee.pb(ii(i,j));
        }
    }
}

int d[N][N];
int dm[N][N];
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
bool ok(int x, int y){
    if (1 <= x && x <= n && 1 <= y && y <= n) return true;
    return false;
}

void build_bee(){
    queue<ii> q;
    memset(d, -1, sizeof d);
    for(ii x : bee){
        d[x.fi][x.se]=0;
        q.push(ii(x.fi,x.se));
    }
    while (q.size()){
        int u = q.front().fi;
        int v = q.front().se;
        //cout << u << ' ' << v << ' ' << d[u][v] << endl;
        q.pop();
        for(int i=0; i<4; i++){
            int x = u + dx[i];
            int y = v + dy[i];
            if (d[x][y]==-1 && ok(x,y) && a[x][y]=='G'){
                d[x][y] = d[u][v] +1;
                q.push(ii(x,y));
            }
        }
    }
}

bool can_eat(int ti){
    queue<ii> q;
    memset(dm, -1, sizeof dm);
    dm[M.fi][M.se] = 0;
    q.push(ii(M.fi,M.se));
    while (q.size()){
        int u = q.front().fi;
        int v = q.front().se;
        q.pop();
        for(int i=0; i<4; i++){
            int x = u + dx[i];
            int y = v + dy[i];
            if (!ok(x,y) || a[x][y]=='T') continue;
            if (x==D.fi && y==D.se) return true;
            if (dm[x][y]==-1){
                dm[x][y] = dm[u][v] + 1;
                if (dm[x][y]/s + ti < d[x][y]){
                    q.push(ii(x,y));
                }
            }
        }
    }
    return false;
}

void proc()
{
    build_bee();
    int l = 0, r = 800*800, ans=-1;
    while (r-l > 0){
        int mid = (l+r)/2;
        if (can_eat(mid)){
            l = mid+1;
            ans = mid;
        }
        else r = mid;
    }
    cout << ans;
}

signed main()
{
    readfile();
    proc();
    return 0;
}

Compilation message

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

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 10444 KB Output is correct
2 Correct 10 ms 10468 KB Output is correct
3 Correct 10 ms 10444 KB Output is correct
4 Correct 10 ms 10444 KB Output is correct
5 Correct 10 ms 10476 KB Output is correct
6 Correct 10 ms 10444 KB Output is correct
7 Correct 133 ms 11320 KB Output is correct
8 Correct 12 ms 10444 KB Output is correct
9 Correct 10 ms 10436 KB Output is correct
10 Correct 11 ms 10476 KB Output is correct
11 Correct 11 ms 10476 KB Output is correct
12 Incorrect 11 ms 10484 KB Output isn't correct
13 Incorrect 10 ms 10444 KB Output isn't correct
14 Correct 11 ms 10444 KB Output is correct
15 Correct 10 ms 10444 KB Output is correct
16 Correct 10 ms 10444 KB Output is correct
17 Correct 12 ms 10444 KB Output is correct
18 Correct 11 ms 10444 KB Output is correct
19 Correct 11 ms 10444 KB Output is correct
20 Correct 12 ms 10488 KB Output is correct
21 Correct 11 ms 10464 KB Output is correct
22 Correct 12 ms 10428 KB Output is correct
23 Correct 12 ms 10508 KB Output is correct
24 Correct 13 ms 10396 KB Output is correct
25 Correct 12 ms 10444 KB Output is correct
26 Correct 10 ms 10496 KB Output is correct
27 Correct 10 ms 10520 KB Output is correct
28 Correct 11 ms 10516 KB Output is correct
29 Correct 10 ms 10444 KB Output is correct
30 Correct 10 ms 10488 KB Output is correct
31 Correct 12 ms 10528 KB Output is correct
32 Correct 10 ms 10500 KB Output is correct
33 Correct 13 ms 10700 KB Output is correct
34 Correct 13 ms 10700 KB Output is correct
35 Correct 44 ms 10700 KB Output is correct
36 Correct 17 ms 10780 KB Output is correct
37 Correct 16 ms 10760 KB Output is correct
38 Correct 51 ms 10772 KB Output is correct
39 Correct 18 ms 10828 KB Output is correct
40 Correct 18 ms 10804 KB Output is correct
41 Correct 65 ms 10816 KB Output is correct
42 Correct 17 ms 10828 KB Output is correct
43 Correct 17 ms 10868 KB Output is correct
44 Correct 81 ms 10796 KB Output is correct
45 Correct 18 ms 10780 KB Output is correct
46 Correct 19 ms 10900 KB Output is correct
47 Correct 96 ms 10848 KB Output is correct
48 Correct 19 ms 10936 KB Output is correct
49 Correct 20 ms 10828 KB Output is correct
50 Correct 116 ms 10952 KB Output is correct
51 Correct 24 ms 10956 KB Output is correct
52 Correct 21 ms 10908 KB Output is correct
53 Correct 147 ms 10972 KB Output is correct
54 Correct 24 ms 10956 KB Output is correct
55 Correct 23 ms 10972 KB Output is correct
56 Correct 156 ms 11016 KB Output is correct
57 Correct 25 ms 10988 KB Output is correct
58 Correct 27 ms 10956 KB Output is correct
59 Correct 200 ms 10956 KB Output is correct
60 Correct 28 ms 11020 KB Output is correct
61 Correct 33 ms 11024 KB Output is correct
62 Correct 213 ms 11092 KB Output is correct
63 Correct 164 ms 11204 KB Output is correct
64 Correct 239 ms 11032 KB Output is correct
65 Correct 224 ms 11096 KB Output is correct
66 Correct 171 ms 11164 KB Output is correct
67 Correct 166 ms 11076 KB Output is correct
68 Correct 69 ms 11144 KB Output is correct
69 Correct 59 ms 11064 KB Output is correct
70 Correct 57 ms 11072 KB Output is correct
71 Correct 52 ms 11072 KB Output is correct
72 Incorrect 97 ms 11072 KB Output isn't correct
73 Incorrect 100 ms 11592 KB Output isn't correct
74 Correct 83 ms 11588 KB Output is correct
75 Correct 118 ms 11636 KB Output is correct
76 Correct 84 ms 11596 KB Output is correct
77 Correct 95 ms 11676 KB Output is correct
78 Correct 119 ms 11608 KB Output is correct
79 Correct 71 ms 11588 KB Output is correct
80 Correct 82 ms 11588 KB Output is correct
81 Correct 114 ms 11544 KB Output is correct
82 Correct 81 ms 11588 KB Output is correct
83 Correct 120 ms 11448 KB Output is correct
84 Correct 117 ms 11540 KB Output is correct
85 Correct 110 ms 11460 KB Output is correct
86 Correct 130 ms 11540 KB Output is correct
87 Correct 111 ms 11460 KB Output is correct
88 Correct 126 ms 11400 KB Output is correct
89 Correct 114 ms 11372 KB Output is correct
90 Correct 128 ms 11392 KB Output is correct
91 Correct 126 ms 11400 KB Output is correct
92 Correct 120 ms 11324 KB Output is correct