oj.uz

Submission #500005

# Submission time Handle Problem Language Result Execution time Memory
500005 2021-12-30T09:13:17 Z Nartifact Mecho (IOI09_mecho) C++14
30 / 100
 209 ms 13320 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define forinc(i,a,b) for(int i=a;i<=b;++i)
#define fordec(i,a,b) for(int i=a;i>=b;--i)
#define pb push_back
#define eb emplace_back
#define pii pair <int,int>
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int N = 888, inf = 1e15;
const int H[] = {1, 0, -1, 0};
const int C[] = {0, 1, 0, -1};
int n, s, cti = inf;
char a[N][N];
int t[N][N], mec[N][N];
pii sta, fin;

bool valid (const int& x, const int& y)
{
    return x && y && x <= n && y <= n
          && a[x][y] != 'T';
}

bool ok (const int& tg)
{
    queue <pii> q;
    q.push(sta);
    forinc(i,1,n) forinc(j,1,n) mec[i][j] = inf;
    mec[sta.fi][sta.se] = 0;
    while(q.size()) {
        auto x = q.front(); q.pop();
        if(x == fin) return 1;
        forinc(i,0,3) {
            int nh = x.fi + H[i];
            int nc = x.se + C[i];
            if(valid(nh, nc) && mec[nh][nc] > mec[x.fi][x.se] + 1) {
                int gap = (mec[x.fi][x.se] + 1) / s;
                if((mec[x.fi][x.se] + 1) % s) gap++;
                if(gap <= t[nh][nc] - tg) {
                    mec[nh][nc] = mec[x.fi][x.se] + 1;
                    q.push({nh, nc});
                }
            }
        }
    }
    return 0;
}

void solve ()
{
    queue <pii> q;
    forinc(i,1,n) forinc(j,1,n) {
        t[i][j] = inf;
        if(a[i][j] == 'H') {
            q.push({i, j});
            t[i][j] = 0;
        }
        else if(a[i][j] == 'M') {
            sta = {i, j};
            t[i][j] = -1;
        }
        else if(a[i][j] == 'D')
            fin = {i, j};
    }

    // bfs bee
    while(q.size()) {
        auto x = q.front(); q.pop();
        forinc(i,0,3) {
            int nh = x.fi + H[i];
            int nc = x.se + C[i];
            if(valid(nh, nc) && t[nh][nc] > t[x.fi][x.se] + 1) {
                t[nh][nc] = t[x.fi][x.se] + 1;
                q.push({nh, nc});
            }
        }
    }

    // binary search
    int l = 0, r = n * n, ans = -1;
    while(l <= r) {
        int mid = l + r >> 1;
        if(ok(mid)) {
            ans = mid;
            l = mid + 1;
        }
        else r = mid - 1;
    }
    cout << ans;
}

void read ()
{
    cin >> n >> s;
    forinc(i,1,n) forinc(j,1,n)
        cin >> a[i][j];
    solve();
}

main ()
{
	#define task "ioi09_mecho"
	cin.tie(0) -> sync_with_stdio(0);
	if(fopen (task ".inp", "r")) {
		freopen (task ".inp", "r", stdin);
		freopen (task ".out", "w", stdout);
	}
    read();
	return 0;
}

Compilation message

mecho.cpp: In function 'void solve()':
mecho.cpp:88:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |         int mid = l + r >> 1;
      |                   ~~^~~
mecho.cpp: At global scope:
mecho.cpp:106:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  106 | main ()
      | ^~~~
mecho.cpp: In function 'int main()':
mecho.cpp:111:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  111 |   freopen (task ".inp", "r", stdin);
      |   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:112:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |   freopen (task ".out", "w", stdout);
      |   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 332 KB Output isn't correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Incorrect 1 ms 332 KB Output isn't correct
5 Correct 1 ms 332 KB Output is correct
6 Incorrect 0 ms 332 KB Output isn't correct
7 Incorrect 100 ms 12956 KB Output isn't correct
8 Incorrect 0 ms 460 KB Output isn't correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Incorrect 1 ms 828 KB Output isn't correct
13 Incorrect 1 ms 732 KB Output isn't correct
14 Correct 1 ms 844 KB Output is correct
15 Incorrect 0 ms 460 KB Output isn't correct
16 Correct 1 ms 460 KB Output is correct
17 Incorrect 1 ms 460 KB Output isn't correct
18 Correct 1 ms 460 KB Output is correct
19 Incorrect 1 ms 580 KB Output isn't correct
20 Correct 0 ms 576 KB Output is correct
21 Incorrect 1 ms 716 KB Output isn't correct
22 Correct 1 ms 704 KB Output is correct
23 Incorrect 1 ms 716 KB Output isn't correct
24 Correct 1 ms 832 KB Output is correct
25 Incorrect 1 ms 844 KB Output isn't correct
26 Correct 1 ms 844 KB Output is correct
27 Incorrect 1 ms 960 KB Output isn't correct
28 Correct 1 ms 972 KB Output is correct
29 Incorrect 1 ms 972 KB Output isn't correct
30 Correct 1 ms 960 KB Output is correct
31 Incorrect 1 ms 1088 KB Output isn't correct
32 Correct 2 ms 1100 KB Output is correct
33 Incorrect 6 ms 5452 KB Output isn't correct
34 Correct 6 ms 5452 KB Output is correct
35 Correct 29 ms 5440 KB Output is correct
36 Incorrect 8 ms 6348 KB Output isn't correct
37 Correct 9 ms 6348 KB Output is correct
38 Correct 25 ms 6396 KB Output is correct
39 Incorrect 9 ms 7056 KB Output isn't correct
40 Correct 9 ms 7180 KB Output is correct
41 Correct 35 ms 7116 KB Output is correct
42 Incorrect 11 ms 7884 KB Output isn't correct
43 Correct 12 ms 7944 KB Output is correct
44 Correct 45 ms 7968 KB Output is correct
45 Incorrect 13 ms 8640 KB Output isn't correct
46 Correct 16 ms 8664 KB Output is correct
47 Correct 56 ms 8744 KB Output is correct
48 Incorrect 20 ms 9548 KB Output isn't correct
49 Correct 15 ms 9548 KB Output is correct
50 Correct 65 ms 9664 KB Output is correct
51 Incorrect 18 ms 10316 KB Output isn't correct
52 Correct 19 ms 10316 KB Output is correct
53 Correct 88 ms 10344 KB Output is correct
54 Incorrect 28 ms 10988 KB Output isn't correct
55 Correct 20 ms 11080 KB Output is correct
56 Correct 105 ms 11264 KB Output is correct
57 Incorrect 22 ms 11852 KB Output isn't correct
58 Correct 23 ms 11928 KB Output is correct
59 Correct 120 ms 11896 KB Output is correct
60 Incorrect 26 ms 12744 KB Output isn't correct
61 Correct 26 ms 12808 KB Output is correct
62 Correct 151 ms 12844 KB Output is correct
63 Correct 120 ms 12764 KB Output is correct
64 Correct 209 ms 12704 KB Output is correct
65 Correct 183 ms 12764 KB Output is correct
66 Incorrect 135 ms 12768 KB Output isn't correct
67 Correct 120 ms 12760 KB Output is correct
68 Correct 62 ms 12776 KB Output is correct
69 Correct 61 ms 12760 KB Output is correct
70 Correct 46 ms 12820 KB Output is correct
71 Correct 54 ms 12740 KB Output is correct
72 Incorrect 39 ms 12760 KB Output isn't correct
73 Incorrect 85 ms 13300 KB Output isn't correct
74 Correct 67 ms 13300 KB Output is correct
75 Correct 82 ms 13316 KB Output is correct
76 Correct 66 ms 13320 KB Output is correct
77 Correct 72 ms 13252 KB Output is correct
78 Correct 79 ms 13252 KB Output is correct
79 Correct 62 ms 13184 KB Output is correct
80 Correct 77 ms 13260 KB Output is correct
81 Correct 75 ms 13252 KB Output is correct
82 Correct 65 ms 13264 KB Output is correct
83 Correct 89 ms 13184 KB Output is correct
84 Correct 91 ms 13120 KB Output is correct
85 Correct 101 ms 13200 KB Output is correct
86 Correct 81 ms 13136 KB Output is correct
87 Correct 78 ms 13180 KB Output is correct
88 Correct 87 ms 13084 KB Output is correct
89 Correct 95 ms 13088 KB Output is correct
90 Correct 94 ms 12996 KB Output is correct
91 Correct 86 ms 13044 KB Output is correct
92 Correct 93 ms 13084 KB Output is correct