結果
問題 | No.871 かえるのうた |
ユーザー |
|
提出日時 | 2020-04-21 21:08:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 2,681 bytes |
コンパイル時間 | 2,824 ms |
コンパイル使用メモリ | 194,412 KB |
最終ジャッジ日時 | 2025-01-09 22:09:53 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 49 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using VI = vector<int>;using VL = vector<ll>;using VS = vector<string>;template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))#define each(i, a) for(auto &i : a)#define SORT(i) sort((i).begin(),(i).end())#define rSORT(i,a) sort((i).begin(),(i).end(),(a))#define all(i) (i).begin(),(i).end()#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))#define line cout << "-----------------------------\n"#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")#define stop system("pause")constexpr ll INF = 1000000000;constexpr ll LLINF = 1LL << 60;constexpr ll mod = 1000000007;constexpr ll MOD = 998244353;constexpr ld eps = 1e-10;constexpr ld pi = 3.1415926535897932;template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }int main() {init();int n, k; cin >> n >> k;VL x(n), a(n); cin >> x >> a;--k;int l = k, r = k;ll L = x[k], R = x[k];while (1) {bool b = true;if (0 <= l && L <= x[l]) {chmax(R, x[l] + a[l]);chmin(L, x[l] - a[l]);--l;b = false;}if (r < n && x[r] <= R) {chmax(R, x[r] + a[r]);chmin(L, x[r] - a[r]);++r;b = false;}if (b)break;}cout << r - l - 1 << "\n";}