提出 #73423412

ソースコード 拡げる

/* 本次作业由本人独立实现完成，如有抄袭行为，愿承担由此带来的一切不良后果 */
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n, m;
int f(int x1, int y1, int x2, int y2)
{
    return abs(x1 - x2) + abs(y1 - y2);
}
int dist(long long u, long long v)
{
    int r_u = (u - 1) / n + 1;
    int c_u = (u - 1) % n + 1;
    int r_v = (v - 1) / n + 1;
    int c_v = (v - 1) % n + 1;
    return f(r_u, c_u, r_v, c_v);
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    cin >> n >> m;
    long long s, t;
    cin >> s >> t;
    if (m == 0)
    {
        cout << dist(s, t) << "\n";
        return 0;
    }
    vector<vector<long long>> dp((1 << m), vector<long long>(m + 1, INF));
    vector<long long> p(m + 1);
    for (int i = 1; i <= m; i++)
    {
        cin >> p[i];
    }
    for (int i = 1; i <= m; i++)
    {
        dp[1 << (i - 1)][i] = dist(s, p[i]);
    }
    for (int mask = 1; mask < (1 << m); mask++)
    {
        for (int i = 1; i <= m; i++)
        {
            if (dp[mask][i] == INF)
                continue;
            for (int j = 1; j <= m; j++)
            {
                if (mask & (1 << (j - 1)))
                    continue;
                int new_mask = mask | (1 << (j - 1));
                dp[new_mask][j] = min(dp[new_mask][j],dp[mask][i] + dist(p[i], p[j]));
            }
        }
    }
    int f_mask = (1 << m) - 1;
    long long ans = INF;
    for (int i = 1; i <= m; i++)
    {
        if (dp[f_mask][i] != INF)
        {
            ans = min(ans, dp[f_mask][i] + dist(p[i], t));
        }
    }
    cout << ans << "\n";
    return 0;
}

提出情報

提出日時
問題 E - 倉庫ロボットの配送
ユーザ LVYB
言語 C++23 (GCC 15.2.0)
得点 433
コード長 1729 Byte
結果 AC
実行時間 19 ms
メモリ 8808 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 433 / 433
結果
AC × 3
AC × 79
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt, in75.txt, in76.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3540 KiB
in02.txt AC 1 ms 3612 KiB
in03.txt AC 18 ms 8624 KiB
in04.txt AC 1 ms 3628 KiB
in05.txt AC 1 ms 3612 KiB
in06.txt AC 1 ms 3756 KiB
in07.txt AC 1 ms 3648 KiB
in08.txt AC 18 ms 8808 KiB
in09.txt AC 1 ms 3584 KiB
in10.txt AC 3 ms 3940 KiB
in11.txt AC 18 ms 8592 KiB
in12.txt AC 19 ms 8732 KiB
in13.txt AC 18 ms 8732 KiB
in14.txt AC 18 ms 8624 KiB
in15.txt AC 1 ms 3612 KiB
in16.txt AC 19 ms 8680 KiB
in17.txt AC 18 ms 8680 KiB
in18.txt AC 19 ms 8680 KiB
in19.txt AC 18 ms 8628 KiB
in20.txt AC 19 ms 8688 KiB
in21.txt AC 18 ms 8624 KiB
in22.txt AC 18 ms 8808 KiB
in23.txt AC 19 ms 8624 KiB
in24.txt AC 18 ms 8684 KiB
in25.txt AC 18 ms 8748 KiB
in26.txt AC 18 ms 8680 KiB
in27.txt AC 1 ms 3560 KiB
in28.txt AC 1 ms 3688 KiB
in29.txt AC 1 ms 3628 KiB
in30.txt AC 1 ms 3620 KiB
in31.txt AC 18 ms 8624 KiB
in32.txt AC 18 ms 8624 KiB
in33.txt AC 1 ms 3600 KiB
in34.txt AC 1 ms 3648 KiB
in35.txt AC 1 ms 3648 KiB
in36.txt AC 1 ms 3596 KiB
in37.txt AC 1 ms 3504 KiB
in38.txt AC 1 ms 3488 KiB
in39.txt AC 1 ms 3628 KiB
in40.txt AC 1 ms 3668 KiB
in41.txt AC 1 ms 3572 KiB
in42.txt AC 1 ms 3488 KiB
in43.txt AC 18 ms 8748 KiB
in44.txt AC 18 ms 8612 KiB
in45.txt AC 18 ms 8688 KiB
in46.txt AC 18 ms 8732 KiB
in47.txt AC 17 ms 8692 KiB
in48.txt AC 17 ms 8628 KiB
in49.txt AC 17 ms 8748 KiB
in50.txt AC 17 ms 8628 KiB
in51.txt AC 17 ms 8624 KiB
in52.txt AC 17 ms 8692 KiB
in53.txt AC 17 ms 8748 KiB
in54.txt AC 17 ms 8808 KiB
in55.txt AC 1 ms 3740 KiB
in56.txt AC 18 ms 8628 KiB
in57.txt AC 1 ms 3628 KiB
in58.txt AC 1 ms 3648 KiB
in59.txt AC 1 ms 3544 KiB
in60.txt AC 1 ms 3560 KiB
in61.txt AC 1 ms 3628 KiB
in62.txt AC 1 ms 3504 KiB
in63.txt AC 1 ms 3628 KiB
in64.txt AC 1 ms 3460 KiB
in65.txt AC 1 ms 3488 KiB
in66.txt AC 1 ms 3496 KiB
in67.txt AC 1 ms 3432 KiB
in68.txt AC 1 ms 3600 KiB
in69.txt AC 18 ms 8624 KiB
in70.txt AC 17 ms 8624 KiB
in71.txt AC 1 ms 3540 KiB
in72.txt AC 1 ms 3612 KiB
in73.txt AC 1 ms 3620 KiB
in74.txt AC 1 ms 3620 KiB
in75.txt AC 18 ms 8680 KiB
in76.txt AC 18 ms 8688 KiB
sample01.txt AC 1 ms 3600 KiB
sample02.txt AC 1 ms 3504 KiB
sample03.txt AC 1 ms 3648 KiB