結果
問題 | No.871 かえるのうた |
ユーザー |
|
提出日時 | 2019-08-30 21:50:24 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 145 ms / 2,000 ms |
コード長 | 2,769 bytes |
コンパイル時間 | 2,636 ms |
コンパイル使用メモリ | 206,684 KB |
最終ジャッジ日時 | 2025-01-07 15:51:51 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 49 |
ソースコード
#include <bits/stdc++.h>#define LLI long long int#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)#define REP(v, n) FOR(v, 0, n)#define REPE(v, n) FORE(v, 0, n)#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)#define ALL(x) (x).begin(), (x).end()#define RALL(x) (x).rbegin(), (x).rend()#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)#define EXIST(c,x) ((c).find(x) != (c).end())#define fst first#define snd second#define popcount __builtin_popcount#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())#define bit(i) (1LL<<(i))#ifdef DEBUG#include <misc/C++/Debug.cpp>#else#define dump(...) ((void)0)#endif#define gcd __gcdusing namespace std;template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}struct Init{Init(){cin.tie(0);ios::sync_with_stdio(false);}}init;template <typename T> class SparseTable{using Op = function<T(T,T)>;Op f;vector<vector<T>> a;vector<int> log_table;public:SparseTable(const vector<T> &v, const Op &f): f(f){int n = v.size();int logn = 0;while((1<<logn) <= n) ++logn;a = vector<vector<T>>(n, vector<T>(logn));REP(i,n) a[i][0] = v[i];FOR(j,1,logn) REP(i,n) a[i][j] = f(a[i][j-1], a[min<int>(n-1, i+(1<<(j-1)))][j-1]);log_table = vector<int>(n+1);FOR(i,2,n+1) log_table[i] = log_table[i>>1] + 1;}T get(int s, int t){ // [s,t)int k = log_table[t-s];return f(a[s][k], a[t-(1<<k)][k]);}};int main(){int N,k;while(cin >> N >> k){vector<LLI> X(N), A(N); cin >> X >> A;vector<LLI> left(N), right(N);REP(i,N){left[i] = X[i] - A[i];right[i] = X[i] + A[i];}SparseTable<LLI> sp_min(left, [](auto a, auto b){return min(a,b);}), sp_max(right, [](auto a, auto b){return max(a,b);});int l = k-1, r = k-1;REP(i,N){LLI a = sp_min.get(l,r+1);LLI b = sp_max.get(l,r+1);l = lower_bound(ALL(X), a) - X.begin();r = upper_bound(ALL(X), b) - X.begin() - 1;}int ans = r-l+1;cout << ans << endl;}return 0;}