oj.uz

Submission #500019

# Submission time Handle Problem Language Result Execution time Memory
500019 2021-12-30T09:27:49 Z Nartifact Mecho (IOI09_mecho) C++14
30 / 100
 199 ms 12700 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] = 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]) {
                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:87:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   87 |         int mid = l + r >> 1;
      |                   ~~^~~
mecho.cpp: At global scope:
mecho.cpp:105:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  105 | main ()
      | ^~~~
mecho.cpp: In function 'int main()':
mecho.cpp:110:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |   freopen (task ".inp", "r", stdin);
      |   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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 ".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 0 ms 332 KB Output isn't correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Incorrect 0 ms 332 KB Output isn't correct
5 Correct 0 ms 332 KB Output is correct
6 Incorrect 1 ms 332 KB Output isn't correct
7 Incorrect 84 ms 12308 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 0 ms 460 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Incorrect 1 ms 844 KB Output isn't correct
13 Incorrect 1 ms 716 KB Output isn't correct
14 Correct 1 ms 844 KB Output is correct
15 Incorrect 1 ms 460 KB Output isn't correct
16 Correct 0 ms 460 KB Output is correct
17 Incorrect 0 ms 460 KB Output isn't correct
18 Correct 0 ms 460 KB Output is correct
19 Incorrect 1 ms 588 KB Output isn't correct
20 Correct 0 ms 588 KB Output is correct
21 Incorrect 1 ms 716 KB Output isn't correct
22 Correct 1 ms 716 KB Output is correct
23 Incorrect 1 ms 716 KB Output isn't correct
24 Correct 1 ms 716 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 972 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 972 KB Output is correct
31 Incorrect 1 ms 972 KB Output isn't correct
32 Correct 1 ms 972 KB Output is correct
33 Incorrect 5 ms 5324 KB Output isn't correct
34 Correct 6 ms 5324 KB Output is correct
35 Correct 19 ms 5388 KB Output is correct
36 Incorrect 9 ms 6248 KB Output isn't correct
37 Correct 7 ms 6220 KB Output is correct
38 Correct 28 ms 6276 KB Output is correct
39 Incorrect 8 ms 6888 KB Output isn't correct
40 Correct 9 ms 6988 KB Output is correct
41 Correct 34 ms 6988 KB Output is correct
42 Incorrect 10 ms 7700 KB Output isn't correct
43 Correct 12 ms 7628 KB Output is correct
44 Correct 63 ms 7724 KB Output is correct
45 Incorrect 16 ms 8396 KB Output isn't correct
46 Correct 12 ms 8404 KB Output is correct
47 Correct 55 ms 8452 KB Output is correct
48 Incorrect 15 ms 9204 KB Output isn't correct
49 Correct 14 ms 9120 KB Output is correct
50 Correct 60 ms 9164 KB Output is correct
51 Incorrect 19 ms 9892 KB Output isn't correct
52 Correct 15 ms 9932 KB Output is correct
53 Correct 102 ms 9932 KB Output is correct
54 Incorrect 20 ms 10660 KB Output isn't correct
55 Correct 18 ms 10668 KB Output is correct
56 Correct 120 ms 10668 KB Output is correct
57 Incorrect 20 ms 11316 KB Output isn't correct
58 Correct 23 ms 11400 KB Output is correct
59 Correct 111 ms 11408 KB Output is correct
60 Incorrect 24 ms 12096 KB Output isn't correct
61 Correct 22 ms 12088 KB Output is correct
62 Correct 127 ms 12100 KB Output is correct
63 Correct 129 ms 12092 KB Output is correct
64 Correct 199 ms 12132 KB Output is correct
65 Correct 165 ms 12136 KB Output is correct
66 Incorrect 147 ms 12096 KB Output isn't correct
67 Correct 132 ms 12132 KB Output is correct
68 Correct 52 ms 12108 KB Output is correct
69 Correct 52 ms 12208 KB Output is correct
70 Correct 50 ms 12144 KB Output is correct
71 Correct 51 ms 12264 KB Output is correct
72 Incorrect 42 ms 12132 KB Output isn't correct
73 Incorrect 80 ms 12644 KB Output isn't correct
74 Correct 59 ms 12660 KB Output is correct
75 Correct 83 ms 12632 KB Output is correct
76 Correct 66 ms 12612 KB Output is correct
77 Correct 73 ms 12688 KB Output is correct
78 Correct 99 ms 12700 KB Output is correct
79 Correct 55 ms 12600 KB Output is correct
80 Correct 66 ms 12584 KB Output is correct
81 Correct 76 ms 12624 KB Output is correct
82 Correct 93 ms 12556 KB Output is correct
83 Correct 105 ms 12548 KB Output is correct
84 Correct 72 ms 12516 KB Output is correct
85 Correct 88 ms 12552 KB Output is correct
86 Correct 94 ms 12556 KB Output is correct
87 Correct 97 ms 12548 KB Output is correct
88 Correct 96 ms 12400 KB Output is correct
89 Correct 92 ms 12412 KB Output is correct
90 Correct 92 ms 12416 KB Output is correct
91 Correct 105 ms 12460 KB Output is correct
92 Correct 132 ms 12448 KB Output is correct