結果

問題 No.2157 崖
ユーザー mikammikam
提出日時 2022-12-09 22:43:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 4,950 ms / 6,000 ms
コード長 4,043 bytes
コンパイル時間 4,690 ms
コンパイル使用メモリ 271,628 KB
実行使用メモリ 35,456 KB
最終ジャッジ日時 2024-10-14 22:36:21
合計ジャッジ時間 43,238 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 3,971 ms
24,008 KB
testcase_14 AC 3,423 ms
32,704 KB
testcase_15 AC 3,934 ms
23,680 KB
testcase_16 AC 4,018 ms
23,988 KB
testcase_17 AC 2,967 ms
28,288 KB
testcase_18 AC 2,882 ms
27,448 KB
testcase_19 AC 4,950 ms
29,112 KB
testcase_20 AC 3,712 ms
35,456 KB
testcase_21 AC 3,705 ms
35,456 KB
testcase_22 AC 2,782 ms
26,752 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 AC 5 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
// using Bint = boost::multiprecision::cpp_int;
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void _IN(T&... a){(cin>> ... >> a);}
template<class T> void _OUT(T& a){cout <<a<< '\n';}
template<class T,class... Ts> void _OUT(const T&a, const Ts&... b){cout<< a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#define INT(...) int __VA_ARGS__; _IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; _IN(__VA_ARGS__)
#define pcnt __builtin_popcountll
int sign(int x){return (x>0)-(x<0);}
int ceil(int x,int y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
int floor(int x,int y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
int abs(int x,int y){return abs(x-y);}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
void yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const int INF = 8e18;
//using mint = modint1000000007;
//using mint = modint998244353;

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n,m);
    vector D(n,vi(m));cin>>D;
    rep(i,n)sort(all(D[i]));
    int ok = 1e9+10;
    int ng = -1;

    auto f = [&](int x){
        //x以下は遷移できる
        vector dp(n,vi(m));
        rep(j,m){
            auto nj = upper_bound(all(D[0]),D[1][j])-D[0].begin()-1;
            if(nj>=0 && D[1][j]-D[0][nj]<=x)dp[1][j] = 1;
        }
        for(int i=1;i<n-1;i++){
            rep(j,m-1)dp[i][j+1]+=dp[i][j];
            auto sum = [&](int l,int r){
                if(r<=l)return 0ll;
                int res = dp[i][r-1];
                if(l)res -= dp[i][l-1];
                return res;
            };
            rep(j,m){
                int l = lower_bound(all(D[i]),D[i+1][j]-x)-D[i].begin();
                int r = upper_bound(all(D[i]),D[i+1][j])-D[i].begin();
                if(sum(l,r))dp[i+1][j] = 1;
            }
        }
        rep(j,m)if(dp[n-1][j])return true;
        return false;
    };
    while(abs(ng-ok)>1){
        int mid = ng+(ok-ng)/2;
        if(f(mid))ok=mid;
        else ng = mid;
    }

    if(ok==1e9+10)ok=-1;
    cout << ok << endl;
    return 0;
}
0