結果
問題 | No.2639 Longest Increasing Walk |
ユーザー |
![]() |
提出日時 | 2024-02-19 21:31:43 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 64 ms / 2,000 ms |
コード長 | 2,892 bytes |
コンパイル時間 | 2,505 ms |
コンパイル使用メモリ | 215,068 KB |
実行使用メモリ | 11,188 KB |
最終ジャッジ日時 | 2024-09-29 01:27:39 |
合計ジャッジ時間 | 4,333 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 33 |
ソースコード
#pragma GCC optimize("O2")#include <algorithm>#include <array>#include <bit>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <compare>#include <complex>#include <concepts>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <deque>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <map>#include <memory>#include <new>#include <numbers>#include <numeric>#include <ostream>#include <queue>#include <random>#include <ranges>#include <set>#include <span>#include <sstream>#include <stack>#include <streambuf>#include <string>#include <tuple>#include <type_traits>#include <variant>#define int ll#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)#define INT128_MIN (-INT128_MAX - 1)#define clock chrono::steady_clock::now().time_since_epoch().count()#ifdef DEBUG#define dbg(x) cout << (#x) << " = " << x << '\n'#else#define dbg(x)#endifnamespace R = std::ranges;namespace V = std::views;using namespace std;using ll = long long;using ull = unsigned long long;using ldb = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;//#define double ldbtemplate<class T>ostream& operator<<(ostream& os, const pair<T, T> pr) {return os << pr.first << ' ' << pr.second;}template<class T, size_t N>ostream& operator<<(ostream& os, const array<T, N> &arr) {for(const T &X : arr)os << X << ' ';return os;}template<class T>ostream& operator<<(ostream& os, const vector<T> &vec) {for(const T &X : vec)os << X << ' ';return os;}template<class T>ostream& operator<<(ostream& os, const set<T> &s) {for(const T &x : s)os << x << ' ';return os;}signed main() {ios::sync_with_stdio(false), cin.tie(NULL);int h, w; cin >> h >> w;vector a(h + 2, vector<int>(w + 2));for(int i = 1; i <= h; i++)for(int j = 1; j <= w; j++)cin >> a[i][j];vector<array<int, 2>> ord;for(int i = 1; i <= h; i++)for(int j = 1; j <= w; j++)ord.push_back({i, j});sort(ord.begin(), ord.end(), [&](auto x, auto y) { return a[x[0]][x[1]] > a[y[0]][y[1]]; });vector<vector<int>> dp(h + 2, vector<int>(w + 2, 0));int dx[4] = {1, -1, 0, 0};int dy[4] = {0, 0, 1, -1};for(auto [i, j] : ord) {dp[i][j] = 1;for(int k = 0; k < 4; k++) {int ip = i + dx[k], jp = j + dy[k];if (a[ip][jp] > a[i][j])dp[i][j] = max(dp[i][j], dp[ip][jp] + 1);}}int ans = 0;for(auto &v : dp)ans = max(ans, R::max(v));cout << ans << '\n';return 0;}