結果
問題 | No.2157 崖 |
ユーザー | karinohito |
提出日時 | 2022-12-09 21:51:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 3,346 ms / 6,000 ms |
コード長 | 3,361 bytes |
コンパイル時間 | 5,035 ms |
コンパイル使用メモリ | 271,292 KB |
実行使用メモリ | 19,968 KB |
最終ジャッジ日時 | 2024-10-14 21:37:24 |
合計ジャッジ時間 | 35,608 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 | 3 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 2,215 ms
14,080 KB |
testcase_14 | AC | 2,735 ms
18,560 KB |
testcase_15 | AC | 3,112 ms
13,952 KB |
testcase_16 | AC | 3,179 ms
14,080 KB |
testcase_17 | AC | 2,307 ms
16,256 KB |
testcase_18 | AC | 2,298 ms
15,872 KB |
testcase_19 | AC | 2,974 ms
16,640 KB |
testcase_20 | AC | 3,346 ms
19,968 KB |
testcase_21 | AC | 3,268 ms
19,968 KB |
testcase_22 | AC | 2,296 ms
15,360 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 7 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #include <atcoder/all> using namespace atcoder; using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>; using vvvvll = vector<vvvll>; using vvvvvll = vector<vvvvll>; using vvvvvvll = vector<vvvvvll>; using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>; using vvvvb = vector<vvvb>; using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>; using vvvvd = vector<vvvd>; using vvvvvd = vector<vvvvd>; #define all(A) A.begin(),A.end() #define ALL(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll) (n); i++) using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>; template<class T> bool chmax(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p < q) { p = q; return 1; } else { return 0; } } template<class T> bool chmin(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p > q) { p = q; return 1; } else { return 0; } } ll gcd(ll(a), ll(b)) { if (a == 0)return b; if (b == 0)return a; ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll sqrtz(ll N) { ll L = 0; ll R = sqrt(N) + 10000; while (abs(R - L) > 1) { ll mid = (R + L) / 2; if (mid * mid <= N)L = mid; else R = mid; } return L; } /* using mint = modint998244353; //using Mint = modint; vector<mint> fact, factinv, inv; const ll mod = 998244353; void prenCkModp(ll n) { fact.resize(n + 5); factinv.resize(n + 5); inv.resize(n + 5); fact[0] = fact[1] = 1; factinv[0] = factinv[1] = 1; inv[1] = 1; for (ll i = 2; i < n + 5; i++) { fact[i] = (fact[i - 1] * i); inv[i] = mod - (inv[mod % i] * (mod / i)); factinv[i] = (factinv[i - 1] * inv[i]); } } mint nCk(ll n, ll k) { if (n < k || k < 0) return 0; return fact[n] * (factinv[k] * factinv[n - k]); } */ template<class T> vector<vector<T>> mul(vector<vector<T>> A, vector<vector<T>> B) { ll N = A.size(); vector<vector<T>> res(N, vector<T>(N, 0)); rep(i, N)rep(j, N)rep(k, N) { res[i][j] += A[i][k] * B[k][j]; } return res; } using mint = modint998244353; int main() { ll N, M; cin >> N >> M; vvll D(N, vll(M)); rep(i, N) { rep(j, M)cin >> D[i][j]; sort(all(D[i])); } ll L = -1, R = 1e10; while (R - L > 1) { ll mid = (R + L) / 2; vvb DP(N, vb(M, 0)); rep(i, M)DP[0][i] = 1; for (ll i = 1; i < N; i++) { vll OK; rep(j, M)if (DP[i - 1][j])OK.push_back(D[i - 1][j]); if (OK.size() == 0)break; rep(j, M) { auto p = upper_bound(all(OK), D[i][j]); p--; auto q = lower_bound(all(OK), D[i][j] - mid); if (ll(p-OK.begin()) >= ll(q-OK.begin())) { DP[i][j] = 1; } } } bool E = 0; rep(i, M) { if (DP[N - 1][i]) { R = mid; E = 1; } } if (!E)L = mid; } cout << (R < 1e10 - 5 ? R : -1) << endl; }