結果
問題 | No.2731 Two Colors |
ユーザー | umimel |
提出日時 | 2024-04-23 18:02:37 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 209 ms / 3,000 ms |
コード長 | 2,868 bytes |
コンパイル時間 | 2,282 ms |
コンパイル使用メモリ | 182,664 KB |
実行使用メモリ | 11,776 KB |
最終ジャッジ日時 | 2024-04-23 18:02:44 |
合計ジャッジ時間 | 6,199 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 187 ms
11,776 KB |
testcase_01 | AC | 198 ms
11,776 KB |
testcase_02 | AC | 209 ms
11,776 KB |
testcase_03 | AC | 3 ms
5,376 KB |
testcase_04 | AC | 9 ms
5,376 KB |
testcase_05 | AC | 6 ms
5,376 KB |
testcase_06 | AC | 24 ms
5,376 KB |
testcase_07 | AC | 25 ms
5,376 KB |
testcase_08 | AC | 5 ms
5,376 KB |
testcase_09 | AC | 94 ms
9,312 KB |
testcase_10 | AC | 3 ms
5,376 KB |
testcase_11 | AC | 93 ms
8,700 KB |
testcase_12 | AC | 89 ms
9,216 KB |
testcase_13 | AC | 80 ms
7,852 KB |
testcase_14 | AC | 43 ms
6,016 KB |
testcase_15 | AC | 5 ms
5,376 KB |
testcase_16 | AC | 39 ms
5,632 KB |
testcase_17 | AC | 52 ms
6,656 KB |
testcase_18 | AC | 11 ms
5,376 KB |
testcase_19 | AC | 40 ms
5,628 KB |
testcase_20 | AC | 57 ms
7,296 KB |
testcase_21 | AC | 11 ms
5,376 KB |
testcase_22 | AC | 98 ms
9,344 KB |
testcase_23 | AC | 24 ms
5,376 KB |
testcase_24 | AC | 13 ms
5,376 KB |
testcase_25 | AC | 3 ms
5,376 KB |
testcase_26 | AC | 78 ms
8,192 KB |
testcase_27 | AC | 101 ms
9,572 KB |
testcase_28 | AC | 63 ms
7,488 KB |
testcase_29 | AC | 20 ms
5,376 KB |
testcase_30 | AC | 35 ms
5,504 KB |
testcase_31 | AC | 23 ms
5,376 KB |
testcase_32 | AC | 114 ms
10,340 KB |
testcase_33 | AC | 2 ms
5,376 KB |
testcase_34 | AC | 2 ms
5,376 KB |
testcase_35 | AC | 1 ms
5,376 KB |
コンパイルメッセージ
main.cpp: In function 'void solve()': main.cpp:45:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 45 | auto [v, i, j] = pq0.top(); | ^ main.cpp:67:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 67 | auto [v, i, j] = pq1.top(); | ^
ソースコード
#include<bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); const ll MOD1000000007 = 1000000007; const ll MOD998244353 = 998244353; const ll MOD[3] = {999727999, 1070777777, 1000000007}; const ll LINF = 1LL << 60LL; const int IINF = (1 << 30) - 1; void solve(){ int h, w; cin >> h >> w; vector<vector<int>> a(h, vector<int>(w)); for(int i=0; i<h; i++) for(int j=0; j<w; j++) cin >> a[i][j]; priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<>> pq0, pq1; int di[4] = {0, 0, 1, -1}, dj[4] = {1, -1, 0, 0}; vector<vector<int>> c(h, vector<int>(w, -1)); c[0][0] = 1; c[h-1][w-1] = 0; pq1.push({a[0][1], 0, 1}); pq1.push({a[1][0], 1, 0}); pq0.push({a[h-2][w-1], h-2, w-1}); pq0.push({a[h-1][w-2], h-1, w-2}); vector<vector<bool>> visited0(h, vector<bool>(w, false)); vector<vector<bool>> visited1(h, vector<bool>(w, false)); visited0[h-1][w-1] = visited0[h-2][w-1] = visited0[h-1][w-2] = true; visited1[0][0] = visited1[1][0] = visited1[0][1] = true; int ans = 0; for(int turn=1; ; turn++){ ans++; if(turn%2==0){ auto [v, i, j] = pq0.top(); pq0.pop(); c[i][j] = 0; // check for(int k=0; k<4; k++){ int nxt_i = i + di[k]; int nxt_j = j + dj[k]; if(nxt_i<0||nxt_j<0||h<=nxt_i||w<=nxt_j) continue; if(c[nxt_i][nxt_j] == 1){ cout << ans << '\n'; return; } if(c[nxt_i][nxt_j]==-1 && !visited0[nxt_i][nxt_j]){ pq0.push({a[nxt_i][nxt_j], nxt_i, nxt_j}); visited0[nxt_i][nxt_j] = true; } } } if(turn%2==1){ auto [v, i, j] = pq1.top(); pq1.pop(); c[i][j] = 1; // check for(int k=0; k<4; k++){ int nxt_i = i + di[k]; int nxt_j = j + dj[k]; if(nxt_i<0||nxt_j<0||h<=nxt_i||w<=nxt_j) continue; if(c[nxt_i][nxt_j] == 0){ cout << ans << '\n'; return; } if(c[nxt_i][nxt_j]==-1 && !visited1[nxt_i][nxt_j]){ pq1.push({a[nxt_i][nxt_j], nxt_i, nxt_j}); visited1[nxt_i][nxt_j] = true; } } } } } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int T=1; //cin >> T; while(T--) solve(); }