oj.uz

Submission #468615

# Submission time Handle Problem Language Result Execution time Memory
468615 2021-08-29T03:26:00 Z Yuisuyuno Mecho (IOI09_mecho) C++14
84 / 100
 223 ms 11636 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' || a[x][y]=='H') 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 = 1e9, 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 14 ms 10444 KB Output is correct
2 Correct 13 ms 10444 KB Output is correct
3 Correct 13 ms 10468 KB Output is correct
4 Correct 13 ms 10468 KB Output is correct
5 Correct 13 ms 10444 KB Output is correct
6 Correct 13 ms 10472 KB Output is correct
7 Correct 128 ms 11252 KB Output is correct
8 Correct 12 ms 10484 KB Output is correct
9 Correct 12 ms 10476 KB Output is correct
10 Correct 12 ms 10480 KB Output is correct
11 Correct 12 ms 10444 KB Output is correct
12 Incorrect 12 ms 10520 KB Output isn't correct
13 Incorrect 13 ms 10444 KB Output isn't correct
14 Correct 13 ms 10524 KB Output is correct
15 Correct 13 ms 10472 KB Output is correct
16 Correct 13 ms 10444 KB Output is correct
17 Correct 13 ms 10444 KB Output is correct
18 Correct 13 ms 10488 KB Output is correct
19 Correct 14 ms 10488 KB Output is correct
20 Correct 12 ms 10440 KB Output is correct
21 Correct 14 ms 10488 KB Output is correct
22 Correct 15 ms 10496 KB Output is correct
23 Correct 12 ms 10444 KB Output is correct
24 Correct 12 ms 10444 KB Output is correct
25 Correct 13 ms 10512 KB Output is correct
26 Correct 12 ms 10444 KB Output is correct
27 Correct 13 ms 10524 KB Output is correct
28 Correct 13 ms 10444 KB Output is correct
29 Correct 12 ms 10524 KB Output is correct
30 Correct 14 ms 10444 KB Output is correct
31 Correct 13 ms 10532 KB Output is correct
32 Correct 13 ms 10524 KB Output is correct
33 Correct 16 ms 10728 KB Output is correct
34 Correct 16 ms 10700 KB Output is correct
35 Correct 41 ms 10700 KB Output is correct
36 Correct 17 ms 10780 KB Output is correct
37 Correct 17 ms 10700 KB Output is correct
38 Correct 51 ms 10768 KB Output is correct
39 Correct 18 ms 10820 KB Output is correct
40 Correct 18 ms 10700 KB Output is correct
41 Correct 62 ms 10828 KB Output is correct
42 Correct 22 ms 10792 KB Output is correct
43 Correct 19 ms 10860 KB Output is correct
44 Correct 73 ms 10856 KB Output is correct
45 Correct 22 ms 10828 KB Output is correct
46 Correct 21 ms 10896 KB Output is correct
47 Correct 95 ms 10892 KB Output is correct
48 Correct 22 ms 10936 KB Output is correct
49 Correct 28 ms 10828 KB Output is correct
50 Correct 115 ms 10948 KB Output is correct
51 Correct 23 ms 10876 KB Output is correct
52 Correct 31 ms 10964 KB Output is correct
53 Correct 121 ms 10916 KB Output is correct
54 Correct 25 ms 10956 KB Output is correct
55 Correct 33 ms 10944 KB Output is correct
56 Correct 161 ms 11016 KB Output is correct
57 Correct 27 ms 11036 KB Output is correct
58 Correct 28 ms 10976 KB Output is correct
59 Correct 164 ms 10992 KB Output is correct
60 Correct 30 ms 11072 KB Output is correct
61 Correct 30 ms 10968 KB Output is correct
62 Correct 189 ms 11084 KB Output is correct
63 Correct 141 ms 11076 KB Output is correct
64 Correct 223 ms 11096 KB Output is correct
65 Correct 216 ms 11028 KB Output is correct
66 Correct 161 ms 11024 KB Output is correct
67 Correct 155 ms 11012 KB Output is correct
68 Correct 67 ms 11144 KB Output is correct
69 Correct 63 ms 11080 KB Output is correct
70 Correct 69 ms 11068 KB Output is correct
71 Correct 52 ms 11072 KB Output is correct
72 Incorrect 92 ms 11148 KB Output isn't correct
73 Incorrect 96 ms 11588 KB Output isn't correct
74 Correct 88 ms 11580 KB Output is correct
75 Correct 95 ms 11604 KB Output is correct
76 Correct 91 ms 11588 KB Output is correct
77 Correct 103 ms 11636 KB Output is correct
78 Correct 108 ms 11504 KB Output is correct
79 Correct 79 ms 11616 KB Output is correct
80 Correct 87 ms 11532 KB Output is correct
81 Correct 101 ms 11548 KB Output is correct
82 Correct 82 ms 11596 KB Output is correct
83 Correct 116 ms 11460 KB Output is correct
84 Correct 106 ms 11472 KB Output is correct
85 Correct 100 ms 11456 KB Output is correct
86 Correct 121 ms 11532 KB Output is correct
87 Correct 111 ms 11452 KB Output is correct
88 Correct 118 ms 11360 KB Output is correct
89 Correct 120 ms 11364 KB Output is correct
90 Correct 125 ms 11356 KB Output is correct
91 Correct 126 ms 11368 KB Output is correct
92 Correct 118 ms 11296 KB Output is correct