結果
問題 | No.871 かえるのうた |
ユーザー |
![]() |
提出日時 | 2019-10-05 14:20:12 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 133 ms / 2,000 ms |
コード長 | 14,223 bytes |
コンパイル時間 | 2,133 ms |
コンパイル使用メモリ | 178,320 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-30 10:57:08 |
合計ジャッジ時間 | 4,993 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 49 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long ll;int main() {int N, K;cin >> N >> K;ll X[N], A[N];for (int i = 0; i < N; i++) {cin >> X[i];}for (int i = 0; i < N; i++) {cin >> A[i];}K--;ll r = X[K] + A[K];ll l = X[K] - A[K];for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}} for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}} for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}} for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}} for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}} for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}} for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}} for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K + 1; i < N; i++) {if (X[i] <= r) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}for (int i = K - 1; i >= 0; i--) {if (l <= X[i]) {r = max(r, X[i] + A[i]);l = min(l, X[i] - A[i]);} else {break;}}int cnt = 0;for (int i = 0; i < N; i++) {if ((l <= X[i] && X[i] <= X[K]) ||(X[K] <= X[i] && X[i] <= r)) {cnt++;}}//cout << l << " " << r << "\n";cout << cnt << "\n";return 0;}