oj.uz

답안 #916012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916012 2024-01-25T06:18:38 Z gaga999 Mecho (IOI09_mecho) C++17
53 / 100
 418 ms 2612 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}
#define vvb vector<vector<bool>>
pii operator+(const pii &a, const pii &b)
{
    return mpr(a.F + b.F, a.S + b.S);
}
const pii dr[] = {pii(1, 0), pii(0, 1), pii(0, -1), pii(-1, 0)};
const int N = 805;
int n, sp;
char grid[N][N];
vvb v1, v2;

bool ok(pii p, const vvb &vd)
{
    if (min(p.F, p.S) < 0 || max(p.F, p.S) >= n)
        return 0;
    return !vd[p.F][p.S];
}

bool slv(int lm)
{
    queue<pii> q1, q2;
    vector<bool>::iterator it;
    v1 = v2 = vvb(n, vector<bool>(n, 0));
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            switch (grid[i][j])
            {
            case 'T':
                v1[i][j] = v2[i][j] = 1;
                break;
            case 'M':
                q1.push(mpr(i, j));
                break;
            case 'H':
                q2.push(mpr(i, j)), v1[i][j] = v2[i][j] = 1;
                break;
            case 'D':
                it = v1[i].begin() + j, v2[i][j] = 1;
            }
        }
    }
    auto move1 = [&]() -> void
    {
        int ln = q1.size();
        while (ln--)
        {
            pii tp = q1.front();
            q1.pop();
            if (v1[tp.F][tp.S])
                continue;
            v1[tp.F][tp.S] = v2[tp.F][tp.S] = 1;
            for (int i = 0; i < 4; i++)
            {
                pii cr = tp + dr[i];
                if (ok(cr, v1))
                    q1.push(cr);
            }
        }
    };
    auto move2 = [&]() -> void
    {
        int ln = q2.size();
        while (ln--)
        {
            pii tp = q2.front();
            q2.pop();
            for (int i = 0; i < 4; i++)
            {
                pii cr = tp + dr[i];
                if (ok(cr, v2))
                    q2.push(cr), v1[cr.F][cr.S] = v2[cr.F][cr.S] = 1;
            }
        }
    };
    while (lm--)
        move2();
    while (!q1.empty())
    {
        for (int i = 0; i < sp; i++)
            move1();
        move2();
    }
    return *it;
}

signed main()
{
    scanf("%d%d", &n, &sp);
    for (int i = 0; i < n; i++)
        scanf("%s", grid[i]);
    if (!slv(0))
        puts("-1"), exit(0);
    int l = 0, r = n << 1;
    while (l < r)
    {
        int m = (l + r + 1) >> 1;
        if (slv(m))
            l = m;
        else
            r = m - 1;
    }
    prt(l), putchar('\n');
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:200:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  200 |     scanf("%d%d", &n, &sp);
      |     ~~~~~^~~~~~~~~~~~~~~~~
mecho.cpp:202:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  202 |         scanf("%s", grid[i]);
      |         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
53.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 368 ms 1884 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 444 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Incorrect 1 ms 348 KB Output isn't correct
18 Incorrect 1 ms 348 KB Output isn't correct
19 Incorrect 1 ms 348 KB Output isn't correct
20 Incorrect 1 ms 444 KB Output isn't correct
21 Incorrect 1 ms 348 KB Output isn't correct
22 Incorrect 1 ms 348 KB Output isn't correct
23 Incorrect 1 ms 348 KB Output isn't correct
24 Incorrect 1 ms 348 KB Output isn't correct
25 Incorrect 2 ms 440 KB Output isn't correct
26 Incorrect 2 ms 348 KB Output isn't correct
27 Incorrect 2 ms 436 KB Output isn't correct
28 Incorrect 2 ms 348 KB Output isn't correct
29 Incorrect 2 ms 440 KB Output isn't correct
30 Incorrect 2 ms 444 KB Output isn't correct
31 Incorrect 2 ms 348 KB Output isn't correct
32 Incorrect 2 ms 348 KB Output isn't correct
33 Incorrect 38 ms 916 KB Output isn't correct
34 Incorrect 37 ms 860 KB Output isn't correct
35 Correct 51 ms 860 KB Output is correct
36 Incorrect 54 ms 988 KB Output isn't correct
37 Incorrect 48 ms 1016 KB Output isn't correct
38 Correct 70 ms 1012 KB Output is correct
39 Incorrect 62 ms 1128 KB Output isn't correct
40 Incorrect 61 ms 1136 KB Output isn't correct
41 Correct 91 ms 1128 KB Output is correct
42 Incorrect 77 ms 1232 KB Output isn't correct
43 Incorrect 75 ms 1112 KB Output isn't correct
44 Correct 105 ms 1116 KB Output is correct
45 Incorrect 102 ms 1304 KB Output isn't correct
46 Incorrect 99 ms 1344 KB Output isn't correct
47 Correct 127 ms 1116 KB Output is correct
48 Incorrect 121 ms 1480 KB Output isn't correct
49 Incorrect 117 ms 1368 KB Output isn't correct
50 Correct 157 ms 1368 KB Output is correct
51 Incorrect 142 ms 1600 KB Output isn't correct
52 Incorrect 139 ms 1624 KB Output isn't correct
53 Correct 193 ms 1372 KB Output is correct
54 Incorrect 164 ms 1724 KB Output isn't correct
55 Incorrect 166 ms 1628 KB Output isn't correct
56 Correct 231 ms 1656 KB Output is correct
57 Incorrect 191 ms 2132 KB Output isn't correct
58 Incorrect 186 ms 1900 KB Output isn't correct
59 Correct 258 ms 1896 KB Output is correct
60 Incorrect 214 ms 2032 KB Output isn't correct
61 Incorrect 209 ms 1980 KB Output isn't correct
62 Correct 295 ms 2036 KB Output is correct
63 Correct 203 ms 2036 KB Output is correct
64 Correct 247 ms 1884 KB Output is correct
65 Correct 251 ms 1880 KB Output is correct
66 Correct 274 ms 2196 KB Output is correct
67 Correct 24 ms 1880 KB Output is correct
68 Correct 228 ms 1880 KB Output is correct
69 Correct 187 ms 1880 KB Output is correct
70 Correct 227 ms 2032 KB Output is correct
71 Correct 237 ms 2032 KB Output is correct
72 Correct 306 ms 2032 KB Output is correct
73 Correct 260 ms 2140 KB Output is correct
74 Correct 413 ms 2612 KB Output is correct
75 Correct 415 ms 2384 KB Output is correct
76 Correct 379 ms 2388 KB Output is correct
77 Correct 418 ms 2452 KB Output is correct
78 Correct 37 ms 1936 KB Output is correct
79 Correct 408 ms 2172 KB Output is correct
80 Correct 410 ms 2164 KB Output is correct
81 Correct 410 ms 2384 KB Output is correct
82 Correct 409 ms 2136 KB Output is correct
83 Correct 372 ms 2136 KB Output is correct
84 Correct 409 ms 1968 KB Output is correct
85 Correct 404 ms 2140 KB Output is correct
86 Correct 402 ms 2144 KB Output is correct
87 Correct 375 ms 2392 KB Output is correct
88 Correct 378 ms 1884 KB Output is correct
89 Correct 406 ms 2108 KB Output is correct
90 Correct 405 ms 2396 KB Output is correct
91 Correct 400 ms 2132 KB Output is correct
92 Correct 404 ms 2140 KB Output is correct