結果
問題 | No.2731 Two Colors |
ユーザー | noya2 |
提出日時 | 2024-04-19 23:10:39 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 255 ms / 3,000 ms |
コード長 | 5,361 bytes |
コンパイル時間 | 3,648 ms |
コンパイル使用メモリ | 262,536 KB |
実行使用メモリ | 11,696 KB |
最終ジャッジ日時 | 2024-10-11 17:27:44 |
合計ジャッジ時間 | 7,409 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 255 ms
11,008 KB |
testcase_01 | AC | 254 ms
11,136 KB |
testcase_02 | AC | 254 ms
11,136 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 | 27 ms
5,248 KB |
testcase_07 | AC | 29 ms
5,248 KB |
testcase_08 | AC | 6 ms
5,248 KB |
testcase_09 | AC | 99 ms
9,520 KB |
testcase_10 | AC | 4 ms
5,248 KB |
testcase_11 | AC | 115 ms
11,536 KB |
testcase_12 | AC | 98 ms
9,456 KB |
testcase_13 | AC | 96 ms
9,144 KB |
testcase_14 | AC | 46 ms
6,112 KB |
testcase_15 | AC | 6 ms
5,248 KB |
testcase_16 | AC | 46 ms
6,080 KB |
testcase_17 | AC | 63 ms
7,148 KB |
testcase_18 | AC | 13 ms
5,248 KB |
testcase_19 | AC | 48 ms
6,260 KB |
testcase_20 | AC | 64 ms
7,492 KB |
testcase_21 | AC | 14 ms
5,248 KB |
testcase_22 | AC | 110 ms
10,284 KB |
testcase_23 | AC | 28 ms
5,248 KB |
testcase_24 | AC | 15 ms
5,248 KB |
testcase_25 | AC | 3 ms
5,248 KB |
testcase_26 | AC | 84 ms
8,576 KB |
testcase_27 | AC | 106 ms
10,416 KB |
testcase_28 | AC | 72 ms
8,196 KB |
testcase_29 | AC | 24 ms
5,248 KB |
testcase_30 | AC | 40 ms
6,276 KB |
testcase_31 | AC | 28 ms
5,536 KB |
testcase_32 | AC | 135 ms
11,696 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 |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){ os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p){ is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } void in() {} template <typename T, class... U> void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(vector<T> &v){ sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" void solve(){ int h, w; in(h,w); vector<vector<int>> a(h,vector<int>(w)); in(a); using pip = pair<int,pii>; array<priority_queue<pip,vector<pip>,greater<pip>>,2> pque; pque[0].push(pip(a[0][0],{0,0})); pque[1].push(pip(a[h-1][w-1],{h-1,w-1})); vector<vector<int>> c(h,vector<int>(w,-1)); int ans = 0; while (true){ auto [val, xy] = pque[ans&1].top(); pque[ans&1].pop(); auto [x, y] = xy; while (c[x][y] != -1){ tie(val, xy) = pque[ans&1].top(); pque[ans&1].pop(); tie(x,y) = xy; } c[x][y] = ans&1; bool adj = false; rep(k,4){ int nx = x + dx[k]; int ny = y + dy[k]; if (range(0,nx,h) && range(0,ny,w)){ if (c[nx][ny] + c[x][y] == 1){ adj = true; break; } if (c[nx][ny] != -1) continue; pque[ans&1].push(pip(a[nx][ny],{nx,ny})); } } ans++; if (adj) break; } out(ans-2); } int main(){ int t = 1; //in(t); while (t--) { solve(); } }