oj.uz

Submission #892705

# Submission time Handle Problem Language Result Execution time Memory
892705 2023-12-25T17:31:44 Z seriouslyFlawed Mecho (IOI09_mecho) C++17
9 / 100
 1000 ms 7072 KB 
#pragma GCC optimize("03,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>

using namespace std;

// Shortcuts for common operations
#define pb push_back
#define ppb pop_back
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define endl "\n"

// Type definitions for convenience
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef unordered_set<int> usi;
typedef unordered_map<int, int> umii;

// Debugging macros
#define debug(x) cerr << #x << " = " << (x) << '\n'
#define debug_vector(v) _debug_vector(#v, v)
template<typename T>
void _debug_vector(const string& name, const vector<T>& a) {
    cerr << name << " = [ ";
    for(const auto &x : a) cerr << x << ' ';
    cerr << "]\n";
}

// I/O redirection for local testing
#define iofile(io) \
        freopen((io + ".in").c_str(), "r", stdin); \
        freopen((io + ".out").c_str(), "w", stdout);

// delta for floodfill
vi dx = {0, 1, 0, -1};
vi dy = {1, 0, -1, 0};

// extended deltas for floodfill
vi edx = {0, 1, 0, -1, 1, 1, -1, -1};
vi edy = {1, 0, -1, 0, 1, -1, 1, -1};

// Common outputs
void yes() { cout << "YES" << '\n'; }
void no() { cout << "NO" << '\n'; }

// cin.tie(0)->sync_with_stdio(0);
vvi bee;
vector<string>tab;
int n, k;
pii start;


bool isViable(int target){
    if(bee[start.f][start.s] <= target) return false;

    vvi best(n, vi(n, INT_MIN));
    queue<pair<pii, pii>>q;
    q.push({{target, k}, start});
    best[start.f][start.s] = bee[start.f][start.s] - target;

    while(!q.empty()){
        auto [T, curr] = q.front();
        auto [t, steps] = T;
        q.pop();

        if(tab[curr.f][curr.s] == 'D') return (best[curr.f][curr.s] > 0);

        for(int i = 0; i < n; i++){
            auto [x, y] = make_pair(curr.f + dx[i], curr.s + dy[i]);
            if(x >= 0 and x < n and y >= 0 and y < n and tab[x][y] != 'T' and bee[x][y] > (steps?t:t+1) and best[x][y] < (bee[x][y] - (steps?t:t+1))){
                best[x][y] = bee[x][y] - (steps?t:t+1);
                q.push({{(steps)?t:t+1, (steps?steps-1:k-1)}, {x, y}});
            }
        }
    }

    return false;

}

void fx() {
    // Functionality for fx
    cin >> n >> k;

    tab.assign(n, "");
    bee.assign(n, vi(n, INT_MAX));
    vii hives;

    for(int i = 0; i < n; i++){
        cin >> tab[i];
        for(int j = 0; j < n; j++){
            if(tab[i][j] == 'M') start = {i, j};
            else if(tab[i][j] == 'H') hives.pb({i, j});
        }
    }

    queue<pair<int, pii>>q;
    for(auto &hive: hives){
        q.push({0, hive});
        bee[hive.f][hive.s] = 0;
    }

    while(!q.empty()){
        auto &[t, hive] = q.front();
        q.pop();
        auto &[x, y] = hive;
        
        for(int i = 0; i < 4; i++){
            auto [X, Y] = make_pair(x+dx[i], y+dy[i]);
            if(X >= 0 and X < n and Y >= 0 and Y < n and (tab[X][Y] == 'G' or tab[X][Y] == 'M' or tab[X][Y] == 'D') and bee[X][Y] > t + 1){
                q.push({t+1, {X, Y}});
                bee[X][Y] = t+1;
            }
        }
    }

    int lo = 0;
    int hi = 801;
    while(hi > lo){
        int mid = (lo + hi +1)/2;
        if(isViable(mid)) lo = mid;
        else hi = mid-1; 
    }

    cout << hi << endl;
}

int main() {
    // Uncomment the following lines for file I/O
    // iofile(string("hello"))
    cin.tie(0)->sync_with_stdio(0);

    
    // Uncomment the following lines for multiple test cases
    // int t; cin >> t;
    // while(t--) fx();
    
    // Single test case
    fx();
    
    return 0;
}

Subtask #1
9.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Execution timed out 1092 ms 6164 KB Time limit exceeded
8 Incorrect 1 ms 348 KB Output isn't correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 1 ms 348 KB Output isn't correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Correct 1 ms 348 KB Output is correct
19 Incorrect 0 ms 348 KB Output isn't correct
20 Correct 0 ms 344 KB Output is correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 0 ms 348 KB Output isn't correct
24 Incorrect 1 ms 348 KB Output isn't correct
25 Incorrect 0 ms 348 KB Output isn't correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Incorrect 0 ms 348 KB Output isn't correct
28 Incorrect 1 ms 348 KB Output isn't correct
29 Incorrect 0 ms 348 KB Output isn't correct
30 Incorrect 1 ms 348 KB Output isn't correct
31 Incorrect 1 ms 348 KB Output isn't correct
32 Incorrect 1 ms 516 KB Output isn't correct
33 Incorrect 3 ms 1560 KB Output isn't correct
34 Incorrect 6 ms 1372 KB Output isn't correct
35 Incorrect 655 ms 1644 KB Output isn't correct
36 Incorrect 4 ms 1880 KB Output isn't correct
37 Incorrect 9 ms 1884 KB Output isn't correct
38 Execution timed out 1096 ms 1972 KB Time limit exceeded
39 Incorrect 5 ms 2244 KB Output isn't correct
40 Incorrect 14 ms 2300 KB Output isn't correct
41 Execution timed out 1063 ms 2416 KB Time limit exceeded
42 Incorrect 6 ms 2700 KB Output isn't correct
43 Incorrect 17 ms 2652 KB Output isn't correct
44 Execution timed out 1096 ms 3064 KB Time limit exceeded
45 Incorrect 7 ms 3204 KB Output isn't correct
46 Incorrect 31 ms 3164 KB Output isn't correct
47 Execution timed out 1062 ms 3348 KB Time limit exceeded
48 Incorrect 10 ms 3716 KB Output isn't correct
49 Incorrect 33 ms 3720 KB Output isn't correct
50 Execution timed out 1087 ms 4160 KB Time limit exceeded
51 Incorrect 9 ms 4188 KB Output isn't correct
52 Incorrect 47 ms 4276 KB Output isn't correct
53 Execution timed out 1069 ms 4352 KB Time limit exceeded
54 Incorrect 11 ms 4880 KB Output isn't correct
55 Incorrect 54 ms 4884 KB Output isn't correct
56 Execution timed out 1033 ms 5200 KB Time limit exceeded
57 Incorrect 12 ms 5544 KB Output isn't correct
58 Incorrect 68 ms 5480 KB Output isn't correct
59 Execution timed out 1082 ms 5780 KB Time limit exceeded
60 Incorrect 14 ms 6244 KB Output isn't correct
61 Incorrect 70 ms 6232 KB Output isn't correct
62 Execution timed out 1066 ms 7072 KB Time limit exceeded
63 Incorrect 50 ms 6220 KB Output isn't correct
64 Incorrect 49 ms 6248 KB Output isn't correct
65 Incorrect 48 ms 6232 KB Output isn't correct
66 Incorrect 48 ms 6220 KB Output isn't correct
67 Incorrect 48 ms 6224 KB Output isn't correct
68 Incorrect 47 ms 6236 KB Output isn't correct
69 Incorrect 60 ms 6412 KB Output isn't correct
70 Incorrect 55 ms 6244 KB Output isn't correct
71 Incorrect 50 ms 6260 KB Output isn't correct
72 Correct 53 ms 6232 KB Output is correct
73 Correct 742 ms 6988 KB Output is correct
74 Execution timed out 1014 ms 6336 KB Time limit exceeded
75 Execution timed out 1066 ms 6348 KB Time limit exceeded
76 Execution timed out 1066 ms 6416 KB Time limit exceeded
77 Execution timed out 1097 ms 6556 KB Time limit exceeded
78 Execution timed out 1029 ms 6232 KB Time limit exceeded
79 Execution timed out 1022 ms 6480 KB Time limit exceeded
80 Execution timed out 1060 ms 6236 KB Time limit exceeded
81 Execution timed out 1055 ms 6272 KB Time limit exceeded
82 Execution timed out 1062 ms 6256 KB Time limit exceeded
83 Execution timed out 1053 ms 6244 KB Time limit exceeded
84 Execution timed out 1055 ms 6240 KB Time limit exceeded
85 Execution timed out 1036 ms 6248 KB Time limit exceeded
86 Execution timed out 1041 ms 6240 KB Time limit exceeded
87 Execution timed out 1047 ms 6404 KB Time limit exceeded
88 Execution timed out 1101 ms 6240 KB Time limit exceeded
89 Execution timed out 1062 ms 6352 KB Time limit exceeded
90 Execution timed out 1012 ms 6240 KB Time limit exceeded
91 Execution timed out 1039 ms 6236 KB Time limit exceeded
92 Execution timed out 1052 ms 6240 KB Time limit exceeded