#974046 (C++17) No.2731 Two Colors

• 問題: No.2731 Two Colors
• ユーザー: Aging1986
• 提出日時: 2024-04-19 22:02:18
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 256 ms / 3,000 ms
• コード長: 3,608 bytes
• コンパイル時間: 3,400 ms
• コンパイル使用メモリ: 231,892 KB
• 最終ジャッジ日時: 2025-02-21 04:17:51
• ジャッジサーバーID （参考情報）: judge4 / judge1

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

ソースコード

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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#pragma clang diagnostic push
#pragma ide diagnostic ignored "cppcoreguidelines-narrowing-conversions"
#pragma ide diagnostic ignored "hicpp-signed-bitwise"
#pragma GCC optimize ("Ofast,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<pdd> vpdd;
typedef vector<vd> vvd;
#define yn(ans) printf("%s\n", (ans)?"Yes":"No");
#define YN(ans) printf("%s\n", (ans)?"YES":"NO");
template<class T> bool chmax(T &a, T b) {
    if (a >= b) return false;
    a = b; return true;
}
template<class T> bool chmin(T &a, T b) {
    if (a <= b) return false;
    a = b; return true;
}
#define FOR(i, s, e, t) for ((i) = (s); (i) < (e); (i) += (t)) 
#define REP(i, e) for (int i = 0; i < (e); ++i) 
#define REP1(i, s, e) for (int i = (s); i < (e); ++i)
#define RREP(i, e) for (int i = (e); i >= 0; --i)
#define RREP1(i, e, s) for (int i = (e); i >= (s); --i)
#define all(v) v.begin(), v.end()
#define pb push_back
#define qb pop_back
#define pf push_front
#define qf pop_front
#define maxe max_element
#define mine min_element
ll inf = 1e18;
#define DEBUG printf("%d\n", __LINE__); fflush(stdout);
template<class T> void print(vector<T> &v, bool withSize = false) {
    if (withSize) cout << v.size() << endl;
    REP(i, v.size()) cout << v[i] << " "; 
    cout << endl;
}
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
int __FAST_IO__ = []() {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
    return 0;
}();
#define TESTS int t; cin >> t; while (t--)
#define TEST 
int main() {
    TEST {
        int H, W;
        cin >> H >> W;
        vvi v(H, vi(W)), c(H, vi(W, -1));
        REP(i, H) REP(j, W) cin >> v[i][j];
        vvi moves = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
        typedef array<int, 3> node;
        priority_queue<node, vector<node>, greater<node>> pq, pq2;
        
        auto upd = [&](priority_queue<node, vector<node>, greater<node>> &q, int color, int x, int y) {
        //  printf("paint %d %d %d\n", x, y, color);
            c[x][y] = color;
            for (auto &m: moves) {
                int nx = x + m[0], ny = y + m[1];
                if (nx >= 0 && nx < H && ny >= 0 && ny < W) {
                    if (c[nx][ny] == -1) q.push({v[nx][ny], nx, ny});
                    else if (c[nx][ny] != color) throw 1;
                }
            }   
        };
        
        upd(pq, 1, 0, 0);
        upd(pq2, 0, H - 1, W - 1);
        int ans = 0;
        while (1) {
            try {
                while (1) {
                    if (pq.empty()) goto finish;
                    auto p = pq.top();
                    pq.pop();
                    int x = p[1], y = p[2];
                    //printf("q1 %d %d %d\n", x, y, c[x][y]);
                    if (c[x][y] == -1) {
                        ans++;
                        upd(pq, 1, x, y);
                        
                        break;
                    }
                }
                
                    
            } catch (int e) {
                break;
            }
            try {
                while (1) {
                    if (pq2.empty()) goto finish;
                    auto p = pq2.top();
                    pq2.pop();
                    int x = p[1], y = p[2];
                    //printf("q2 %d %d %d\n", x, y, c[x][y]);
                    if (c[x][y] == -1) {
                        ans++;
                        upd(pq2, 0, x, y);
                        break;
                    }
                }
            } catch (int e) {
                break;
            }
        }
        finish:
        printf("%d\n", ans);
    }
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX