結果

問題 No.2157 崖
ユーザー deuteridayodeuteridayo
提出日時 2022-12-09 22:36:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3,487 ms / 6,000 ms
コード長 2,934 bytes
コンパイル時間 4,213 ms
コンパイル使用メモリ 269,852 KB
実行使用メモリ 35,584 KB
最終ジャッジ日時 2024-10-14 22:30:09
合計ジャッジ時間 32,432 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 2,093 ms
24,064 KB
testcase_14 AC 3,035 ms
32,896 KB
testcase_15 AC 1,940 ms
23,936 KB
testcase_16 AC 1,926 ms
24,064 KB
testcase_17 AC 2,350 ms
28,288 KB
testcase_18 AC 2,261 ms
27,776 KB
testcase_19 AC 2,755 ms
29,312 KB
testcase_20 AC 3,487 ms
35,584 KB
testcase_21 AC 3,338 ms
35,456 KB
testcase_22 AC 2,326 ms
26,752 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 AC 3 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
// lint const mod = 1e9+7;
// using mint = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first

struct edge{
    int to;
};
using graph = vector<vector<edge>>;

int main(){
    int n,m;
    cin >> n >> m;
    vec<vec<lint>>a(n, vec<lint>(m));
    rep(i, n) {
        rep(j, m) {
            cin >> a[i][j];
        }

        sort(a[i].begin(), a[i].end());
    }
    vec<vec<lint>>dp(n+1, vec<lint>(m, 0));
  
   for(int i = 1; i < n; i++) {
        rep(j, m) {
            lint ans = INF64;
            rep(k, m) {
                if(a[i][j] < a[i-1][k])break;
                ans = min({ans, max(a[i][j] - a[i-1][k], dp[i-1][k])});
            }
            dp[i][j] = ans;
        }
    }
    lint ans = INF64;
    for(auto p: dp[n-1]) {
        ans = min(ans, p);
    }
    if(ans == INF64)ans = -1;
    cout << ans << endl;


}
0