oj.uz

답안 #553235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553235 2022-04-25T07:04:32 Z amirallisson Mecho (IOI09_mecho) C++14
39 / 100
 190 ms 7624 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;
    bool pos;
   while(lo < hi){
        queue<tuple<int, int, int, int>> q;
        int tempans = lo + (hi-lo)/2;
        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;
        }
    }

    if(pos) cout << ans << '\n';
    else cout << -1 << '\n';
    return 0;

}

Compilation message

mecho.cpp: In function 'int main(int, const char**)':
mecho.cpp:118:5: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
  118 |     if(pos) cout << ans << '\n';
      |     ^~

Subtask #1
39.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6612 KB Output is correct
2 Correct 4 ms 6612 KB Output is correct
3 Incorrect 4 ms 6612 KB Output isn't correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 3 ms 6648 KB Output is correct
6 Correct 3 ms 6612 KB Output is correct
7 Incorrect 70 ms 7380 KB Output isn't correct
8 Correct 5 ms 6612 KB Output is correct
9 Correct 5 ms 6580 KB Output is correct
10 Incorrect 6 ms 6612 KB Output isn't correct
11 Correct 5 ms 6612 KB Output is correct
12 Correct 4 ms 6612 KB Output is correct
13 Correct 5 ms 6612 KB Output is correct
14 Correct 4 ms 6612 KB Output is correct
15 Correct 4 ms 6612 KB Output is correct
16 Incorrect 4 ms 6612 KB Output isn't correct
17 Correct 4 ms 6612 KB Output is correct
18 Incorrect 4 ms 6612 KB Output isn't correct
19 Incorrect 4 ms 6612 KB Output isn't correct
20 Incorrect 4 ms 6612 KB Output isn't correct
21 Correct 4 ms 6612 KB Output is correct
22 Incorrect 5 ms 6612 KB Output isn't correct
23 Correct 4 ms 6612 KB Output is correct
24 Incorrect 4 ms 6612 KB Output isn't correct
25 Incorrect 4 ms 6612 KB Output isn't correct
26 Correct 5 ms 6612 KB Output is correct
27 Correct 5 ms 6556 KB Output is correct
28 Correct 5 ms 6624 KB Output is correct
29 Correct 5 ms 6612 KB Output is correct
30 Incorrect 5 ms 6612 KB Output isn't correct
31 Correct 5 ms 6576 KB Output is correct
32 Incorrect 5 ms 6688 KB Output isn't correct
33 Incorrect 7 ms 6740 KB Output isn't correct
34 Correct 6 ms 6740 KB Output is correct
35 Correct 17 ms 6740 KB Output is correct
36 Correct 8 ms 6756 KB Output is correct
37 Incorrect 7 ms 6740 KB Output isn't correct
38 Correct 34 ms 6740 KB Output is correct
39 Incorrect 10 ms 6868 KB Output isn't correct
40 Correct 8 ms 6804 KB Output is correct
41 Correct 33 ms 6896 KB Output is correct
42 Incorrect 9 ms 6868 KB Output isn't correct
43 Correct 8 ms 6868 KB Output is correct
44 Correct 35 ms 6868 KB Output is correct
45 Correct 9 ms 6912 KB Output is correct
46 Incorrect 9 ms 6996 KB Output isn't correct
47 Incorrect 42 ms 6996 KB Output isn't correct
48 Correct 9 ms 6996 KB Output is correct
49 Incorrect 10 ms 6992 KB Output isn't correct
50 Incorrect 54 ms 6984 KB Output isn't correct
51 Incorrect 11 ms 7124 KB Output isn't correct
52 Correct 11 ms 7044 KB Output is correct
53 Correct 66 ms 7124 KB Output is correct
54 Incorrect 12 ms 7120 KB Output isn't correct
55 Correct 11 ms 7164 KB Output is correct
56 Correct 64 ms 7152 KB Output is correct
57 Correct 12 ms 7252 KB Output is correct
58 Incorrect 13 ms 7328 KB Output isn't correct
59 Correct 75 ms 7204 KB Output is correct
60 Correct 18 ms 7252 KB Output is correct
61 Incorrect 20 ms 7368 KB Output isn't correct
62 Correct 161 ms 7360 KB Output is correct
63 Correct 95 ms 7372 KB Output is correct
64 Correct 156 ms 7348 KB Output is correct
65 Correct 190 ms 7348 KB Output is correct
66 Correct 124 ms 7372 KB Output is correct
67 Correct 123 ms 7240 KB Output is correct
68 Correct 52 ms 7376 KB Output is correct
69 Incorrect 42 ms 7376 KB Output isn't correct
70 Incorrect 36 ms 7272 KB Output isn't correct
71 Correct 40 ms 7376 KB Output is correct
72 Correct 29 ms 7284 KB Output is correct
73 Correct 31 ms 7548 KB Output is correct
74 Correct 73 ms 7600 KB Output is correct
75 Incorrect 57 ms 7624 KB Output isn't correct
76 Correct 54 ms 7552 KB Output is correct
77 Incorrect 54 ms 7552 KB Output isn't correct
78 Correct 69 ms 7592 KB Output is correct
79 Correct 47 ms 7508 KB Output is correct
80 Correct 69 ms 7520 KB Output is correct
81 Correct 61 ms 7604 KB Output is correct
82 Correct 49 ms 7496 KB Output is correct
83 Correct 68 ms 7556 KB Output is correct
84 Correct 87 ms 7560 KB Output is correct
85 Incorrect 94 ms 7560 KB Output isn't correct
86 Incorrect 67 ms 7500 KB Output isn't correct
87 Incorrect 65 ms 7556 KB Output isn't correct
88 Correct 75 ms 7516 KB Output is correct
89 Correct 68 ms 7436 KB Output is correct
90 Incorrect 106 ms 7512 KB Output isn't correct
91 Correct 77 ms 7512 KB Output is correct
92 Correct 72 ms 7500 KB Output is correct