oj.uz

답안 #553232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553232 2022-04-25T07:01:19 Z amirallisson Mecho (IOI09_mecho) C++14
84 / 100
 188 ms 7884 KB 
#include <bits/stdc++.h>
/*--------------------------------------------------------------------*/
#define INF 3*100*1000 + 5
#define MAX 1000000
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define intt int64_t
#define piic pair<int64_t, int64_t>
typedef long long ll;
using namespace std;

/*--------------------------------------------------------------------*/

int n, s;
pii b, home;
queue<pii> hives;
vector<string> grid;
int filltime[900][900]{INT_MAX}, beetime[900][900], visited[900][900];
int dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1};
int inside(int x, int y){
    return (x> -1 && x < n && y > -1 && y < n && grid[x][y] != 'T');
}



int main(int argc, const char * argv[]) {
    ios::sync_with_stdio(0); cin.tie(0);
    fill(filltime[0], filltime[0] + 900*900, INT_MAX);

    if(2 >= INT_MAX) cout << "Error\n";

    cin >> n >> s;
    for(int i = 0; i < n; ++i){
        string str;
        cin >> str;
        grid.pb(str);
        for(int j = 0; j < (int)str.length(); ++j){
            if (str[j] == 'M') b = make_pair(i, j);
            if (str[j] == 'D') home = make_pair(i, j);
            if(str[j] == 'H'){
                    hives.push(make_pair(i, j));
                    filltime[i][j] = 0;
            }
        }
    }
    while(!hives.empty()){
        pii bee = hives.front();
        hives.pop();
        int x,y;
        x = bee.fi; y = bee.se;

        for(int i = 0; i < 4; ++i){
            if(!inside(x + dx[i], y + dy[i]) || grid[x+dx[i]][y+dy[i]] == 'D') continue;
            if(filltime[x+dx[i]][y+dy[i]] != INT_MAX)
                filltime[x+dx[i]][y+dy[i]] = min(filltime[x+dx[i]][y+dy[i]], filltime[x][y] + 1);
            else {
                filltime[x+dx[i]][y+dy[i]] = filltime[x][y] + 1;
                hives.push(make_pair(x + dx[i], y + dy[i]));
            }
        }
    }

    int lo = 0, hi = filltime[b.fi][b.se];
    int ans = 0;
   while(lo < hi){
        queue<tuple<int, int, int, int>> q;
        int tempans = lo + (hi-lo)/2;
        bool pos = false;
        fill(visited[0], visited[0] + 900*900, 0);
        visited[b.fi][b.se] = 1;
        q.push(make_tuple(b.fi, b.se, tempans, 0));
       // cout << "New Round "  << tempans << '\n';
        while(!q.empty()){
            tuple<int, int, int, int> cur = q.front();
            q.pop();
            int x = get<0>(cur);
            int y = get<1> (cur);
            int a = get<2> (cur);
            int res = get<3> (cur);

            //cout << x << ' ' << y << ' ' << a << ' ' << res << ' ' << q.size() << ' ' << filltime[x][y] << '\n';

            if(a + (double)res/s >= filltime[x][y]) continue;
            if(x == home.fi && y == home.se) {
                pos = true;
              //  cout << "Success!\n";
                break;
            }
            int x1, y1;
            if(res == s-1) {
                y1 = 0;
                x1 = a + 1;
            } else {
                x1 = a;
                y1 = res + 1;
            }
            for(int i = 0; i < 4; ++i) {
                if(!inside(x+dx[i],y+dy[i])) continue;
                if(visited[x+dx[i]][y+dy[i]]) continue;
                visited[x+dx[i]][y+dy[i]] = 1;
                q.push(make_tuple(x+dx[i], y+dy[i], x1, y1));
            }
        }
       // cout << pos << '\n';
        if(pos) {
            ans = max(ans, tempans);
            lo = tempans + 1;
        } else {
            hi = tempans;
        }
    }

    cout << ans << '\n';

    return 0;

}

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6612 KB Output is correct
2 Correct 6 ms 6608 KB Output is correct
3 Correct 5 ms 6572 KB Output is correct
4 Correct 6 ms 6612 KB Output is correct
5 Correct 6 ms 6612 KB Output is correct
6 Correct 4 ms 6612 KB Output is correct
7 Correct 80 ms 7712 KB Output is correct
8 Incorrect 6 ms 6612 KB Output isn't correct
9 Correct 5 ms 6572 KB Output is correct
10 Correct 5 ms 6572 KB Output is correct
11 Correct 4 ms 6612 KB Output is correct
12 Correct 5 ms 6612 KB Output is correct
13 Correct 5 ms 6568 KB Output is correct
14 Incorrect 7 ms 6612 KB Output isn't correct
15 Correct 5 ms 6612 KB Output is correct
16 Correct 5 ms 6612 KB Output is correct
17 Correct 7 ms 6572 KB Output is correct
18 Correct 6 ms 6612 KB Output is correct
19 Correct 5 ms 6612 KB Output is correct
20 Correct 5 ms 6612 KB Output is correct
21 Correct 7 ms 6740 KB Output is correct
22 Correct 5 ms 6568 KB Output is correct
23 Correct 5 ms 6568 KB Output is correct
24 Correct 7 ms 6612 KB Output is correct
25 Correct 6 ms 6612 KB Output is correct
26 Correct 6 ms 6612 KB Output is correct
27 Correct 5 ms 6612 KB Output is correct
28 Correct 6 ms 6612 KB Output is correct
29 Correct 6 ms 6572 KB Output is correct
30 Correct 8 ms 6608 KB Output is correct
31 Correct 7 ms 6612 KB Output is correct
32 Correct 6 ms 6700 KB Output is correct
33 Correct 9 ms 6844 KB Output is correct
34 Correct 9 ms 6868 KB Output is correct
35 Correct 23 ms 6868 KB Output is correct
36 Correct 9 ms 6996 KB Output is correct
37 Correct 8 ms 7024 KB Output is correct
38 Correct 33 ms 6908 KB Output is correct
39 Correct 9 ms 7092 KB Output is correct
40 Correct 8 ms 6996 KB Output is correct
41 Correct 36 ms 7096 KB Output is correct
42 Correct 14 ms 7124 KB Output is correct
43 Correct 13 ms 7208 KB Output is correct
44 Correct 57 ms 7192 KB Output is correct
45 Correct 11 ms 7252 KB Output is correct
46 Correct 13 ms 7168 KB Output is correct
47 Correct 52 ms 7264 KB Output is correct
48 Correct 11 ms 7252 KB Output is correct
49 Correct 10 ms 7252 KB Output is correct
50 Correct 71 ms 7220 KB Output is correct
51 Correct 13 ms 7384 KB Output is correct
52 Correct 17 ms 7352 KB Output is correct
53 Correct 76 ms 7404 KB Output is correct
54 Correct 14 ms 7380 KB Output is correct
55 Correct 14 ms 7460 KB Output is correct
56 Correct 80 ms 7480 KB Output is correct
57 Correct 14 ms 7548 KB Output is correct
58 Correct 16 ms 7444 KB Output is correct
59 Correct 100 ms 7576 KB Output is correct
60 Correct 19 ms 7500 KB Output is correct
61 Correct 21 ms 7528 KB Output is correct
62 Correct 123 ms 7744 KB Output is correct
63 Correct 98 ms 7512 KB Output is correct
64 Correct 165 ms 7604 KB Output is correct
65 Correct 188 ms 7600 KB Output is correct
66 Correct 140 ms 7604 KB Output is correct
67 Incorrect 120 ms 7520 KB Output isn't correct
68 Correct 52 ms 7628 KB Output is correct
69 Correct 37 ms 7544 KB Output is correct
70 Correct 34 ms 7548 KB Output is correct
71 Correct 34 ms 7628 KB Output is correct
72 Correct 34 ms 7628 KB Output is correct
73 Correct 29 ms 7840 KB Output is correct
74 Correct 55 ms 7780 KB Output is correct
75 Correct 66 ms 7864 KB Output is correct
76 Correct 62 ms 7864 KB Output is correct
77 Correct 58 ms 7884 KB Output is correct
78 Incorrect 66 ms 7868 KB Output isn't correct
79 Correct 46 ms 7828 KB Output is correct
80 Correct 57 ms 7776 KB Output is correct
81 Correct 71 ms 7856 KB Output is correct
82 Correct 55 ms 7864 KB Output is correct
83 Correct 69 ms 7816 KB Output is correct
84 Correct 62 ms 7816 KB Output is correct
85 Correct 78 ms 7756 KB Output is correct
86 Correct 93 ms 7756 KB Output is correct
87 Correct 68 ms 7732 KB Output is correct
88 Correct 79 ms 7668 KB Output is correct
89 Correct 68 ms 7772 KB Output is correct
90 Correct 85 ms 7772 KB Output is correct
91 Correct 78 ms 7764 KB Output is correct
92 Correct 77 ms 7768 KB Output is correct