結果

問題 No.2639 Longest Increasing Walk
ユーザー airths
提出日時 2024-02-19 21:46:20
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 110 ms / 2,000 ms
コード長 3,463 bytes
コンパイル時間 1,236 ms
コンパイル使用メモリ 133,996 KB
最終ジャッジ日時 2025-02-19 16:49:50
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

/*
*
* ^v^
*
*/
#include <iostream>
#include <numeric>
#include <set>
#include <iomanip>
#include <chrono>
#include <queue>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <bitset>
#include <algorithm>
#include <array>
#include <random>
using namespace std;
using ll = long long int;
using ld = long double;
#define iamtefu ios_base::sync_with_stdio(false); cin.tie(0);
#define fl(i,a,n) for (ll i{a}; i<n; i++)
#define fr(x,s) for(auto x:s)
#define rfl(i,a,n) for (ll i{n-1}; i>=a; i--)
#define ty int _; for(cin>>_; _--;)
#define print(a) for(auto ele:a){cout<<ele<<" ";}cout<<'\n';
#define all(x) x.begin(), x.end()
template <typename L, typename R>
inline bool chmax(L &a, R b){if (a<b){a=b;return 1;}return 0;}
template <typename L, typename R>
inline bool chmin(L &a, R b){if (a>b){a=b;return 1;}return 0;}
template <typename L, typename R>
ostream& operator<<(ostream &fout, const pair<L, R> &p){
fout<<"{"<<p.first<<","<<p.second<<"}";
return fout;
}
template <typename L, typename R, typename U>
ostream& operator<<(ostream &fout, const tuple<L, R, U> &p){
auto &[l, r, u] = p;
fout<<"{"<<l<<","<<r<<","<<u<<"}";
return fout;
}
template <typename T>
ostream& operator<<(ostream &fout, const vector <T> &v){
for (auto &x:v){
fout<<x<<" ";
}
fout<<"\n";
return fout;
}
template <typename T>
ostream& operator<<(ostream &fout, const set <T> &st){
for (auto &x:st){
fout<<x<<" ";
}
fout<<"\n";
return fout;
}
template <typename T>
ostream& operator<<(ostream &fout, const multiset <T> &st){
for (auto &x:st){
fout<<x<<" ";
}
fout<<"\n";
return fout;
}
template <typename K, typename V>
ostream& operator<<(ostream &fout, const map<K, V> &mp){
fout<<"[";
for (auto &[x,y]:mp){
fout<<x<<":"<<y<<" ";
}
fout<<"]\n";
return fout;
}
ll gcd(ll a, ll b){
if (b==0){
return a;
}
return gcd(b, a%b);
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll pw(ll a, ll b, ll m){
ll res=1;
a%=m;
while (b){
if (b&1){
res=(res*a)%m;
}
a=(a*a)%m;
b/=2;
}
return res;
}
void scn(){
// not necessarily distinct
// right down
ll n, m; cin>>n>>m;
vector <vector <ll>> a(n, vector <ll>(m));
fl(i,0,n){
fl(j,0,m){
cin>>a[i][j];
}
}
vector <vector <ll>> ed(((n+1)*(m+1))+1);
fl(i,0,n){
fl(j,0,m){
if (j>0){
if (a[i][j]>a[i][j-1]){
ed[i*m+j-1].push_back(i*m+j);
} else if (a[i][j]<a[i][j-1]){
ed[i*m+j].push_back(i*m+j-1);
}
}
if (i>0){
if (a[i-1][j]>a[i][j]){
ed[(i)*m+j].push_back((i-1)*m+j);
} else if (a[i-1][j]<a[i][j]){
ed[(i-1)*m+j].push_back(i*m+j);
}
}
}
}
vector <ll> topo, vis(n*m+1);
auto dfs=[&](const auto &self, ll i)->void{
vis[i]++;
for (auto x:ed[i]){
if (!vis[x]){
self(self, x);
}
}
topo.push_back(i);
};
fl(i,0,n*m){
if (!vis[i]){
dfs(dfs, i);
}
}
vector <ll> dp(n*m+1, 1);
reverse(all(topo));
for (auto x:topo){
for (auto y:ed[x]){
chmax(dp[y], dp[x]+1);
}
}
cout<<*max_element(all(dp))<<'\n';
}
int main(){
iamtefu;
#if defined(airths)
auto t1=chrono::high_resolution_clock::now();
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// ty
{
scn();
}
#if defined(airths)
auto t2=chrono::high_resolution_clock::now();
ld ti=chrono::duration_cast<chrono::nanoseconds>(t2-t1).count();
ti*=1e-6;
cerr<<"Time: "<<setprecision(12)<<ti;
cerr<<"ms\n";
#endif
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0