oj.uz

Submission #500021

# Submission time Handle Problem Language Result Execution time Memory
500021 2021-12-30T09:30:29 Z Nartifact Mecho (IOI09_mecho) C++14
30 / 100
 186 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});
                }
            }
        }
        if(x == sta) mec[sta.fi][sta.se] = -1;
    }
    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};
        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:83:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   83 |         int mid = l + r >> 1;
      |                   ~~^~~
mecho.cpp: At global scope:
mecho.cpp:101:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  101 | main ()
      | ^~~~
mecho.cpp: In function 'int main()':
mecho.cpp:106:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |   freopen (task ".inp", "r", stdin);
      |   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:107:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |   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 332 KB Output isn't correct
4 Incorrect 0 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 85 ms 12268 KB Output isn't correct
8 Incorrect 1 ms 544 KB Output isn't correct
9 Correct 0 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 1 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 0 ms 588 KB Output isn't correct
20 Correct 0 ms 588 KB Output is correct
21 Incorrect 0 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 1016 KB Output is correct
33 Incorrect 6 ms 5324 KB Output isn't correct
34 Correct 5 ms 5324 KB Output is correct
35 Correct 19 ms 5388 KB Output is correct
36 Incorrect 7 ms 6156 KB Output isn't correct
37 Correct 7 ms 6220 KB Output is correct
38 Correct 29 ms 6220 KB Output is correct
39 Incorrect 8 ms 6860 KB Output isn't correct
40 Correct 9 ms 6988 KB Output is correct
41 Correct 34 ms 6940 KB Output is correct
42 Incorrect 14 ms 7628 KB Output isn't correct
43 Correct 11 ms 7724 KB Output is correct
44 Correct 47 ms 7628 KB Output is correct
45 Incorrect 12 ms 8396 KB Output isn't correct
46 Correct 12 ms 8352 KB Output is correct
47 Correct 48 ms 8376 KB Output is correct
48 Incorrect 13 ms 9164 KB Output isn't correct
49 Correct 14 ms 9160 KB Output is correct
50 Correct 65 ms 9132 KB Output is correct
51 Incorrect 16 ms 9932 KB Output isn't correct
52 Correct 16 ms 9932 KB Output is correct
53 Correct 76 ms 9928 KB Output is correct
54 Incorrect 17 ms 10596 KB Output isn't correct
55 Correct 18 ms 10572 KB Output is correct
56 Correct 93 ms 10664 KB Output is correct
57 Incorrect 20 ms 11332 KB Output isn't correct
58 Correct 20 ms 11340 KB Output is correct
59 Correct 115 ms 11332 KB Output is correct
60 Incorrect 23 ms 12060 KB Output isn't correct
61 Correct 24 ms 12096 KB Output is correct
62 Correct 128 ms 12104 KB Output is correct
63 Correct 104 ms 12216 KB Output is correct
64 Correct 186 ms 12144 KB Output is correct
65 Correct 148 ms 12080 KB Output is correct
66 Incorrect 132 ms 12140 KB Output isn't correct
67 Correct 115 ms 12220 KB Output is correct
68 Correct 52 ms 12088 KB Output is correct
69 Correct 55 ms 12192 KB Output is correct
70 Correct 43 ms 12272 KB Output is correct
71 Correct 47 ms 12140 KB Output is correct
72 Incorrect 37 ms 12120 KB Output isn't correct
73 Incorrect 44 ms 12688 KB Output isn't correct
74 Correct 60 ms 12620 KB Output is correct
75 Correct 70 ms 12620 KB Output is correct
76 Correct 64 ms 12632 KB Output is correct
77 Correct 63 ms 12644 KB Output is correct
78 Correct 79 ms 12700 KB Output is correct
79 Correct 50 ms 12608 KB Output is correct
80 Correct 61 ms 12628 KB Output is correct
81 Correct 69 ms 12624 KB Output is correct
82 Correct 61 ms 12624 KB Output is correct
83 Correct 78 ms 12552 KB Output is correct
84 Correct 71 ms 12552 KB Output is correct
85 Correct 82 ms 12624 KB Output is correct
86 Correct 74 ms 12460 KB Output is correct
87 Correct 77 ms 12504 KB Output is correct
88 Correct 78 ms 12356 KB Output is correct
89 Correct 80 ms 12452 KB Output is correct
90 Correct 83 ms 12412 KB Output is correct
91 Correct 81 ms 12412 KB Output is correct
92 Correct 95 ms 12448 KB Output is correct