oj.uz

답안 #468612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468612 2021-08-29T03:16:00 Z Yuisuyuno Mecho (IOI09_mecho) C++14
48 / 100
 233 ms 11812 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, 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
48.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 10444 KB Output is correct
2 Correct 8 ms 10444 KB Output is correct
3 Correct 8 ms 10364 KB Output is correct
4 Correct 8 ms 10384 KB Output is correct
5 Correct 9 ms 10468 KB Output is correct
6 Correct 8 ms 10472 KB Output is correct
7 Correct 141 ms 11316 KB Output is correct
8 Correct 11 ms 10400 KB Output is correct
9 Correct 8 ms 10484 KB Output is correct
10 Correct 8 ms 10444 KB Output is correct
11 Correct 8 ms 10444 KB Output is correct
12 Incorrect 9 ms 10516 KB Output isn't correct
13 Incorrect 9 ms 10444 KB Output isn't correct
14 Correct 8 ms 10444 KB Output is correct
15 Correct 9 ms 10444 KB Output is correct
16 Correct 7 ms 10396 KB Output is correct
17 Correct 10 ms 10444 KB Output is correct
18 Correct 8 ms 10488 KB Output is correct
19 Correct 9 ms 10444 KB Output is correct
20 Correct 8 ms 10444 KB Output is correct
21 Correct 8 ms 10444 KB Output is correct
22 Correct 9 ms 10496 KB Output is correct
23 Incorrect 8 ms 10444 KB Output isn't correct
24 Correct 8 ms 10484 KB Output is correct
25 Incorrect 9 ms 10516 KB Output isn't correct
26 Incorrect 8 ms 10444 KB Output isn't correct
27 Incorrect 9 ms 10444 KB Output isn't correct
28 Incorrect 10 ms 10444 KB Output isn't correct
29 Incorrect 8 ms 10444 KB Output isn't correct
30 Incorrect 11 ms 10444 KB Output isn't correct
31 Incorrect 10 ms 10444 KB Output isn't correct
32 Incorrect 8 ms 10444 KB Output isn't correct
33 Incorrect 12 ms 10700 KB Output isn't correct
34 Incorrect 12 ms 10700 KB Output isn't correct
35 Correct 34 ms 10700 KB Output is correct
36 Incorrect 13 ms 10680 KB Output isn't correct
37 Incorrect 13 ms 10788 KB Output isn't correct
38 Correct 51 ms 10836 KB Output is correct
39 Incorrect 17 ms 10828 KB Output isn't correct
40 Incorrect 14 ms 10748 KB Output isn't correct
41 Correct 72 ms 10812 KB Output is correct
42 Incorrect 15 ms 10828 KB Output isn't correct
43 Incorrect 18 ms 10800 KB Output isn't correct
44 Correct 74 ms 10840 KB Output is correct
45 Incorrect 16 ms 10828 KB Output isn't correct
46 Incorrect 20 ms 10824 KB Output isn't correct
47 Correct 84 ms 10828 KB Output is correct
48 Incorrect 17 ms 10864 KB Output isn't correct
49 Incorrect 21 ms 10924 KB Output isn't correct
50 Correct 107 ms 10828 KB Output is correct
51 Incorrect 19 ms 10904 KB Output isn't correct
52 Incorrect 20 ms 10888 KB Output isn't correct
53 Correct 145 ms 11032 KB Output is correct
54 Incorrect 21 ms 10956 KB Output isn't correct
55 Incorrect 21 ms 10900 KB Output isn't correct
56 Correct 143 ms 10956 KB Output is correct
57 Incorrect 23 ms 11064 KB Output isn't correct
58 Incorrect 23 ms 10964 KB Output isn't correct
59 Correct 171 ms 10948 KB Output is correct
60 Incorrect 25 ms 11020 KB Output isn't correct
61 Incorrect 25 ms 11076 KB Output isn't correct
62 Correct 180 ms 11044 KB Output is correct
63 Correct 135 ms 11024 KB Output is correct
64 Incorrect 233 ms 11092 KB Output isn't correct
65 Correct 212 ms 11076 KB Output is correct
66 Correct 171 ms 11028 KB Output is correct
67 Correct 167 ms 11204 KB Output is correct
68 Correct 68 ms 11092 KB Output is correct
69 Correct 53 ms 11072 KB Output is correct
70 Correct 57 ms 11072 KB Output is correct
71 Correct 48 ms 11092 KB Output is correct
72 Incorrect 95 ms 11072 KB Output isn't correct
73 Incorrect 99 ms 11812 KB Output isn't correct
74 Correct 76 ms 11712 KB Output is correct
75 Correct 95 ms 11640 KB Output is correct
76 Correct 80 ms 11596 KB Output is correct
77 Correct 89 ms 11604 KB Output is correct
78 Correct 115 ms 11548 KB Output is correct
79 Correct 78 ms 11588 KB Output is correct
80 Correct 87 ms 11580 KB Output is correct
81 Correct 98 ms 11532 KB Output is correct
82 Correct 99 ms 11588 KB Output is correct
83 Correct 141 ms 11540 KB Output is correct
84 Correct 107 ms 11472 KB Output is correct
85 Correct 98 ms 11456 KB Output is correct
86 Correct 117 ms 11468 KB Output is correct
87 Correct 124 ms 11532 KB Output is correct
88 Correct 131 ms 11360 KB Output is correct
89 Correct 123 ms 11424 KB Output is correct
90 Correct 135 ms 11416 KB Output is correct
91 Correct 129 ms 11332 KB Output is correct
92 Correct 112 ms 11464 KB Output is correct