結果

問題 No.2731 Two Colors
ユーザー dyktr_06dyktr_06
提出日時 2024-04-19 22:30:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 252 ms / 3,000 ms
コード長 6,420 bytes
コンパイル時間 2,575 ms
コンパイル使用メモリ 216,388 KB
実行使用メモリ 19,860 KB
最終ジャッジ日時 2024-10-11 16:03:46
合計ジャッジ時間 6,832 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 251 ms
19,072 KB
testcase_01 AC 252 ms
19,072 KB
testcase_02 AC 250 ms
18,944 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 10 ms
5,248 KB
testcase_05 AC 8 ms
5,248 KB
testcase_06 AC 28 ms
6,424 KB
testcase_07 AC 29 ms
7,084 KB
testcase_08 AC 7 ms
5,248 KB
testcase_09 AC 101 ms
15,720 KB
testcase_10 AC 4 ms
5,248 KB
testcase_11 AC 123 ms
19,436 KB
testcase_12 AC 100 ms
15,428 KB
testcase_13 AC 102 ms
14,432 KB
testcase_14 AC 46 ms
9,096 KB
testcase_15 AC 6 ms
5,248 KB
testcase_16 AC 48 ms
8,876 KB
testcase_17 AC 65 ms
10,800 KB
testcase_18 AC 13 ms
5,248 KB
testcase_19 AC 51 ms
9,020 KB
testcase_20 AC 63 ms
11,268 KB
testcase_21 AC 14 ms
5,248 KB
testcase_22 AC 114 ms
17,072 KB
testcase_23 AC 30 ms
6,740 KB
testcase_24 AC 16 ms
5,248 KB
testcase_25 AC 2 ms
5,248 KB
testcase_26 AC 86 ms
13,864 KB
testcase_27 AC 110 ms
17,564 KB
testcase_28 AC 78 ms
13,056 KB
testcase_29 AC 26 ms
6,092 KB
testcase_30 AC 42 ms
8,804 KB
testcase_31 AC 31 ms
7,552 KB
testcase_32 AC 143 ms
19,860 KB
testcase_33 AC 2 ms
5,248 KB
testcase_34 AC 2 ms
5,248 KB
testcase_35 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

void input(){
}

vll dx = {-1, 0, 1, 0};
vll dy = {0, -1, 0, 1};

void solve(){
    ll h, w; in(h, w);
    vector<vll> a(h, vll(w));
    rep(i, h) rep(j, w){
        in(a[i][j]);
    }
    vector<vll> color(h, vll(w));
    color[0][0] = 1, color[h - 1][w - 1] = 2;
    auto ok = [&](ll i, ll j){
        return (0 <= i && i < h) && (0 <= j && j < w);
    };
    using T = tuple<ll, ll, ll>;
    priority_queue<T, vector<T>, greater<>> one, two;
    {
        rep(dir, 4){
            ll x = 0 + dx[dir], y = 0 + dy[dir];
            if(ok(x, y) && color[x][y] ==  0){
                one.emplace(a[x][y], x, y);
            }
        }
        rep(dir, 4){
            ll x = h - 1 + dx[dir], y = w - 1 + dy[dir];
            if(ok(x, y) && color[x][y] ==  0){
                two.emplace(a[x][y], x, y);
            }
        }
    }
    ll is_finish = 0;
    rep(k, h * w){
        if(is_finish) break;
        if(k % 2){
            while(two.size()){
                auto [cost, x, y] = two.top();
                two.pop();
                if(color[x][y]) continue;
                color[x][y] = 2;
                rep(dir, 4){
                    ll nx = x + dx[dir], ny = y + dy[dir];
                    if(ok(nx, ny)){
                        if(color[nx][ny] == 0){
                            two.emplace(a[nx][ny], nx, ny);
                        }else if(color[nx][ny] == 1){
                            is_finish = 1;
                        }
                    }
                }
                break;
            }
        }else{
            while(one.size()){
                auto [cost, x, y] = one.top();
                one.pop();
                if(color[x][y]) continue;
                color[x][y] = 1;
                rep(dir, 4){
                    ll nx = x + dx[dir], ny = y + dy[dir];
                    if(ok(nx, ny)){
                        if(color[nx][ny] == 0){
                            one.emplace(a[nx][ny], nx, ny);
                        }else if(color[nx][ny] == 2){
                            is_finish = 1;
                        }
                    }
                }
                break;
            }
        }
    }
    ll ans = 0;
    rep(i, h) rep(j, w) if(color[i][j]) ans++;
    out(ans - 2);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0