結果

問題 No.2731 Two Colors
ユーザー woodywoodywoodywoody
提出日時 2024-04-20 12:16:53
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 518 ms / 3,000 ms
コード長 5,854 bytes
コンパイル時間 4,151 ms
コンパイル使用メモリ 243,472 KB
実行使用メモリ 53,732 KB
最終ジャッジ日時 2024-10-12 07:36:19
合計ジャッジ時間 12,441 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 382 ms
53,732 KB
testcase_01 AC 399 ms
53,732 KB
testcase_02 AC 388 ms
53,728 KB
testcase_03 AC 4 ms
5,248 KB
testcase_04 AC 21 ms
6,036 KB
testcase_05 AC 14 ms
5,248 KB
testcase_06 AC 68 ms
10,292 KB
testcase_07 AC 74 ms
11,532 KB
testcase_08 AC 10 ms
5,248 KB
testcase_09 AC 413 ms
35,332 KB
testcase_10 AC 5 ms
5,248 KB
testcase_11 AC 383 ms
31,876 KB
testcase_12 AC 404 ms
35,324 KB
testcase_13 AC 347 ms
28,548 KB
testcase_14 AC 138 ms
17,460 KB
testcase_15 AC 8 ms
5,248 KB
testcase_16 AC 136 ms
15,372 KB
testcase_17 AC 201 ms
20,400 KB
testcase_18 AC 27 ms
6,272 KB
testcase_19 AC 147 ms
15,936 KB
testcase_20 AC 254 ms
26,200 KB
testcase_21 AC 29 ms
6,348 KB
testcase_22 AC 413 ms
35,004 KB
testcase_23 AC 72 ms
10,792 KB
testcase_24 AC 34 ms
6,824 KB
testcase_25 AC 3 ms
5,248 KB
testcase_26 AC 335 ms
30,348 KB
testcase_27 AC 423 ms
35,484 KB
testcase_28 AC 238 ms
21,968 KB
testcase_29 AC 60 ms
9,480 KB
testcase_30 AC 121 ms
15,260 KB
testcase_31 AC 67 ms
10,072 KB
testcase_32 AC 518 ms
40,432 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>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 2001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

void solve(){
    int h,w; cin>>h>>w;
    vvi a(h,vi(w));
    rep(i,h) rep(j,w) cin>>a[i][j];
    vector<set<int>> s(2);
    vvi st(h, vi(w,-1));
    st[0][0] = 0; 
    st[h-1][w-1] = 1;

    bool ok = true;

    auto check = [&](int i,int j)->void{
        assert(st[i][j]!=-1);
        rep(kk,4){
            int x,y;
            x = i + dx[kk];
            y = j + dy[kk];
            if (x <= h-1 && x >= 0 && y <= w-1 && y >= 0){
                if (st[x][y]!=-1 && st[x][y]!=st[i][j]) ok = false;
            }
        }
    };

    auto push = [&](int i,int j,int t)->void{
        assert(st[i][j]!=-1);
        rep(kk,4){
            int x,y;
            x = i + dx[kk];
            y = j + dy[kk];
            if (x <= h-1 && x >= 0 && y <= w-1 && y >= 0 && st[x][y]==-1){
                s[t].insert(a[x][y]);
            }
        }
    };

    unordered_map<int,pii> mp;
    rep(i,h) rep(j,w) mp[a[i][j]] = {i,j};

    push(0, 0, 0);
    push(h-1, w-1, 1);
    rep(i,h*w){
        pii p = mp[*(s[i%2].begin())];
        s[i%2].erase(s[i%2].begin());
        int mk = i%2;
        st[p.fi][p.se] = mk;
        push(p.fi, p.se, i%2);
        check(p.fi, p.se);
        if (!ok) break; 
    }
    int ans = 0;
    rep(i,h) rep(j,w) if (st[i][j]!=-1) ans++;
    ans -= 2;
    out;

    return;
}

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

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0