#961479 (C++23) No.2673 A present from B

• 問題: No.2673 A present from B
• ユーザー: じなぺ
• 提出日時: 2024-03-17 18:07:47
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 86 ms / 2,000 ms
• コード長: 2,078 bytes
• コンパイル時間: 2,930 ms
• コンパイル使用メモリ: 254,504 KB
• 実行使用メモリ: 31,644 KB
• 最終ジャッジ日時: 2024-09-30 04:43:50
• 合計ジャッジ時間: 4,179 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 24

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//多倍長整数//
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//using Bint = mp::cpp_int;
const int INF = 1e9;
const int MOD = 998244353;
const long long LINF = 4e18;
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vvvvl = vector<vector<vector<vector<long long>>>>;
using vvc = vector<vector<char>>;
using vvb = vector<vector<bool>>;
using vvvb = vector<vector<vector<bool>>>;
using vvvvb = vector<vector<vector<vector<bool>>>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dump(x)  cout << #x << " = " << (x) << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define ALL(obj) (obj).begin(),(obj).end()
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m;
    cin >> n >> m;
    vvi g1(n*(m + 1));
    vvi g2(n*(m + 1));
    rep(i,m + 1){
        rep(j,n - 1){
            g2[n*i + j].push_back(n*i + j + 1);
            g2[n*i + j + 1].push_back(n*i + j);
        }
    }
    rep(i,m){
        int a;
        cin >> a;
        a--;
        g1[n*(i + 1) + a].push_back(n*i + a + 1);
        g1[n*(i + 1) + a + 1].push_back(n*i + a);
        rep(j,n){
            if(j == a || j == a + 1) continue;
            g1[n*(i + 1) + j].push_back(n*i + j);
        }
    }
    deque<int> que;
    que.push_back(n*m);
    vector<int> dist(n*(m + 1),INF);
    dist[n*m] = 0;
    while(!que.empty()){
        int cur = que.front();
        que.pop_front();
        for(int next : g1[cur]){
            if(dist[next] > dist[cur]){
                dist[next] = dist[cur];
                que.push_front(next);
            }
        }
        for(int next : g2[cur]){
            if(dist[next] > dist[cur] + 1){
                dist[next] = dist[cur] + 1;
                que.push_back(next);
            }
        }
    }
    for(int i = 1;i < n;i++){
        cout << dist[i] << ' ';
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX