結果
問題 | No.2731 Two Colors |
ユーザー |
![]() |
提出日時 | 2024-04-19 22:05:58 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,805 ms / 3,000 ms |
コード長 | 2,594 bytes |
コンパイル時間 | 1,940 ms |
コンパイル使用メモリ | 183,176 KB |
実行使用メモリ | 58,240 KB |
最終ジャッジ日時 | 2024-10-11 15:18:06 |
合計ジャッジ時間 | 15,868 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:120:28: warning: narrowing conversion of '(& A.std::vector<std::vector<long long int> >::operator[](((std::vector<std::vector<long long int> >::size_type)nx)))->std::vector<long long int>::operator[](((std::vector<long long int>::size_type)ny))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing] 120 | q[ans % 2].push({A[nx][ny], {nx, ny}}); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>using namespace std;#define CPP_STR(x) CPP_STR_I(x)#define CPP_CAT(x, y) CPP_CAT_I(x, y)#define CPP_STR_I(args...) #args#define CPP_CAT_I(x, y) x##y#define ASSERT(expr...) assert((expr))using i8 = int8_t;using u8 = uint8_t;using i16 = int16_t;using u16 = uint16_t;using i32 = int32_t;using u32 = uint32_t;using i64 = int64_t;using u64 = uint64_t;using f32 = float;using f64 = double;// }}}constexpr i64 INF = 1'010'000'000'000'000'017LL;constexpr i64 MOD = 998244353LL;constexpr f64 EPS = 1e-12;constexpr f64 PI = 3.14159265358979323846;#define M5 100007#define M9 1000000000#define F first#define S second// util {{{#define FOR(i, start, end) for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); i < CPP_CAT(i, xxxx_end); ++i)#define REP(i, n) FOR(i, 0, n)#define all(x) (x).begin(), (x).end()#define ll long long int#define VI vector<ll>#define VVI vector<VI>#define ISD true#define debug(x) \if (ISD) \cout << #x << ": " << x << endltemplate <typename T, typename U, typename Comp = less<>>bool chmax(T &xmax, const U &x, Comp comp = {}){if (comp(xmax, x)){xmax = x;return true;}return false;}template <typename T, typename U, typename Comp = less<>>bool chmin(T &xmin, const U &x, Comp comp = {}){if (comp(x, xmin)){xmin = x;return true;}return false;}int main(){int H, W;cin >> H >> W;vector<vector<ll>> A(H, vector<ll>(W));REP(i, H)REP(j, W)cin >> A[i][j];int dx[4] = {1, 0, -1, 0};int dy[4] = {0, 1, 0, -1};int x[2], y[2];x[1] = 0;x[0] = H - 1;y[1] = 0;y[0] = W - 1;using P = pair<int, pair<int, int>>;priority_queue<P, vector<P>, greater<P>> q[2];q[1].push({0, {0, 0}});q[0].push({0, {H - 1, W - 1}});set<pair<int, int>> s[2];s[1].insert({0, 0});s[0].insert({H - 1, W - 1});ll ans = 1;while (1){P t = q[ans % 2].top();q[ans % 2].pop();int cx = t.S.F;int cy = t.S.S;if (s[!(ans % 2)].count({cx, cy}) == 1){cout << ans - 2 << endl;return 0;}REP(i, 4){int nx = cx + dx[i];int ny = cy + dy[i];if (nx < 0 || nx >= H || ny < 0 || ny >= W || s[ans % 2].count({nx, ny}) == 1){continue;}q[ans % 2].push({A[nx][ny], {nx, ny}});s[ans % 2].insert({nx, ny});}ans++;}}