#952539 (C++17) No.2639 Longest Increasing Walk

提出ソース

結果

問題	No.2639 Longest Increasing Walk
ユーザー	dyktr_06
提出日時	2024-02-19 21:31:59
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	79 ms / 2,000 ms
コード長	4,946 bytes
コンパイル時間	2,194 ms
コンパイル使用メモリ	216,548 KB
実行使用メモリ	15,040 KB
最終ジャッジ日時	2024-02-19 21:32:04
合計ジャッジ時間	4,090 ms
ジャッジサーバーID （参考情報）	judge16 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	1 ms 6,676 KB
testcase_02	AC	2 ms 6,676 KB
testcase_03	AC	2 ms 6,676 KB
testcase_04	AC	71 ms 15,040 KB
testcase_05	AC	64 ms 15,040 KB
testcase_06	AC	60 ms 14,976 KB
testcase_07	AC	77 ms 14,960 KB
testcase_08	AC	66 ms 15,008 KB
testcase_09	AC	79 ms 15,024 KB
testcase_10	AC	55 ms 13,332 KB
testcase_11	AC	48 ms 9,400 KB
testcase_12	AC	8 ms 6,676 KB
testcase_13	AC	59 ms 13,492 KB
testcase_14	AC	34 ms 8,792 KB
testcase_15	AC	1 ms 6,676 KB
testcase_16	AC	2 ms 6,676 KB
testcase_17	AC	34 ms 8,784 KB
testcase_18	AC	38 ms 9,044 KB
testcase_19	AC	11 ms 6,676 KB
testcase_20	AC	23 ms 6,676 KB
testcase_21	AC	47 ms 9,384 KB
testcase_22	AC	17 ms 6,676 KB
testcase_23	AC	2 ms 6,676 KB
testcase_24	AC	2 ms 6,676 KB
testcase_25	AC	2 ms 6,676 KB
testcase_26	AC	2 ms 6,676 KB
testcase_27	AC	2 ms 6,676 KB
testcase_28	AC	1 ms 6,676 KB
testcase_29	AC	1 ms 6,676 KB
testcase_30	AC	1 ms 6,676 KB
testcase_31	AC	2 ms 6,676 KB
testcase_32	AC	1 ms 6,676 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll h, w;
vector<vll> a;

void input(){
    in(h, w);
    a = vector<vll>(h, vll(w));
    rep(i, h) rep(j, w){
        in(a[i][j]);
    }
}

vll dx = {-1, 0, 1, 0};
vll dy = {0, -1, 0, 1};

void solve(){
    vector<vll> dp(h, vll(w, 1));
    using T = tuple<ll, ll, ll>;
    priority_queue<T, vector<T>, greater<>> q;
    rep(i, h) rep(j, w){
        q.emplace(a[i][j], i, j);
    }
    while(q.size()){
        auto [v, x, y] = q.top();
        q.pop();
        rep(dir, 4){
            ll nx = x + dx[dir], ny = y + dy[dir];
            if(0 <= nx && nx < h && 0 <= ny && ny < w){
                if(v < a[nx][ny]){
                    chmax(dp[nx][ny], dp[x][y] + 1);
                }
            }
        }
    }
    ll ans = 0;
    rep(i, h) chmax(ans, max(dp[i]));
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード