#800592 (C++17) No.2064 Smallest Sequence on Grid

• 問題: No.2064 Smallest Sequence on Grid
• ユーザー: a16784542
• 提出日時: 2022-09-25 21:57:01
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,362 ms / 3,000 ms
• コード長: 2,482 bytes
• コンパイル時間: 4,176 ms
• コンパイル使用メモリ: 261,756 KB
• 最終ジャッジ日時: 2025-02-07 15:26:49
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 2
other	AC * 29

ソースコード

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
87
88
89
90
91
92
#include <bits/stdc++.h>
#include <atcoder/all>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace atcoder;
// using namespace __gnu_pbds;
using ll=long long;
#define int ll
using ld = long double;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for(int i=int(n-1);i>=int(0);--i)
#define fore(i,a) for(auto &i:a)
#define all(x) x.begin(),x.end() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcount((long long)(x)))
#define pb push_back
#define eb emplace_back
#define mpa make_pair
#define bit(n) (1LL<<(n))
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;
#define P pair<int,int>
#define TP tuple<int,int,int>
#define F first
#define S second
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1001001001;
const ll INFL = 3e18;
const int MAX = 2e6+1;
struct abc{
    char a;
    int b,c;
    abc(char a='a',ll b=0,ll c=0):a(a),b(b),c(c){}
    
    // comp(a,b)==comp(b,a)==true を満たすような例が存在するとRE
    bool operator<(const abc &x) const{
        return a<x.a;
    }
};
// bool operator<(const abc& lhs, const abc& rhs)
// {
//   return lhs.a < rhs.a;
// }
signed main() {
    int h,w;cin>>h>>w;
    V<string> s(h);
    rep(i,h)cin>>s[i];
    
    const int d[]={0,1,0};
    string ans;
    deque<abc> dq;
    dq.emplace_back(s[0][0],0,0);
    V<V<bool>> col(h,V<bool>(w));
    while(sz(dq)){
        multiset<abc> st;
        ans += dq.front().a;
        int n=sz(dq);
        rep(i,n){
            auto [a,b,c]=dq.front();
            dq.pop_front();
            rep(j,2){
                int nb=b+d[j];
                int nc=c+d[j+1];
                if(nb>=h||nc>=w||col[nb][nc])continue;
                st.emplace(s[nb][nc],nb,nc);
                col[nb][nc]=1;
            }
        }
        if(sz(st)==0)break;
        char t=st.begin()->a;
        for(auto [a,b,c]:st){
            if(t==a)dq.emplace_back(a,b,c);
            else break;
        }
    }
    cout<<ans<<endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX