結果
問題 | No.871 かえるのうた |
ユーザー |
![]() |
提出日時 | 2019-08-30 22:57:19 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 127 ms / 2,000 ms |
コード長 | 2,353 bytes |
コンパイル時間 | 1,631 ms |
コンパイル使用メモリ | 166,936 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-30 10:49:32 |
合計ジャッジ時間 | 4,642 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 49 |
ソースコード
#include<bits/stdc++.h>#define int long longusing namespace std;#define rep(i, n) for(int i=0;i<(n);++i)typedef pair<int, int> pii;const int INF = 1l << 60;#define u_b upper_bound#define l_b lower_boundint N, K;int X[100100];int A[100100];signed main() {cin >> N >> K;--K;rep(i, N) {cin >> X[i];}rep(i, N) {cin >> A[i];}//左方向int leftest = X[K] - A[K];int left_right = X[K];int left = 0;for (int i = K - 1; i >= 0; --i) {if (leftest <= X[i]) {left++;leftest = min(leftest, X[i] - A[i]);left_right = max(left_right, X[i] + A[i]);} else break;}//右方向int right = 0;int rightest = X[K] + A[K];int right_left = X[K];for (int i = K + 1; i < N; ++i) {if (X[i] <= rightest) {right++;rightest = max(rightest, X[i] + A[i]);right_left = min(right_left, X[i] - A[i]);} else break;}leftest = min(leftest, right_left);rightest = max(rightest, left_right);while (1) {if (K - left == 0) {if (K + right == N - 1) {break;}if (X[K + right + 1] <= rightest) {right++;rightest = max(rightest, X[K + right] + A[K + right]);continue;} else break;} else {if (K + right == N - 1) {if (leftest <= X[K - left - 1]) {left++;leftest = min(leftest, X[K - left] - A[K - left]);continue;} else break;} else {if (X[K + right + 1] <= rightest) {right++;rightest = max(rightest, X[K + right] + A[K + right]);leftest = min(leftest, X[K + right] - A[K + right]);continue;}if (leftest <= X[K - left - 1]) {left++;leftest = min(leftest, X[K - left] - A[K - left]);rightest = max(rightest, X[K - left] + A[K - left]);continue;}break;}}}cout << left + right + 1 << endl;return 0;}