結果
問題 | No.871 かえるのうた |
ユーザー |
|
提出日時 | 2019-08-30 22:50:08 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 636 ms / 2,000 ms |
コード長 | 6,173 bytes |
コンパイル時間 | 1,925 ms |
コンパイル使用メモリ | 178,220 KB |
実行使用メモリ | 7,808 KB |
最終ジャッジ日時 | 2024-11-30 10:49:16 |
合計ジャッジ時間 | 10,400 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 49 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;#define REP(i,n) for(long long i = 0; i < (n); i++)#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)#define ALL(obj) (obj).begin(),(obj).end()#define SPEED cin.tie(0);ios::sync_with_stdio(false);template<class T> using V = vector<T>;template<class T, class U> using P = pair<T, U>;template<class T> using PQ = priority_queue<T>;template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;constexpr long long MOD = (long long)1e9 + 7;constexpr long long MOD2 = 998244353;constexpr long long HIGHINF = (long long)1e18;constexpr long long LOWINF = (long long)1e15;constexpr long double PI = 3.1415926535897932384626433;template <class T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}template <class... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "")<< obj[i]; o << "}"; return o;}template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}void print(void) {cout << endl;}template <class Head> void print(Head&& head) {cout << head;print();}template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}template <class T> void chmax(T& a, const T b){a=max(a,b);}template <class T> void chmin(T& a, const T b){a=min(a,b);}void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}template<class T> class Segment_Tree_Range_Maximum_Query {public:size_t N, M;T ini;vector<T> node;Segment_Tree_Range_Maximum_Query(const vector<T> & ar, const T ini) : M(ar.size()), ini(ini) {for (N = 1; N < M; N *= 2);node.resize(2 * N - 1, ini);for (int i = 0; i<M; ++i) node[i + N - 1] = ar[i];for (int i = N - 2; i >= 0; --i) node[i] = max(node[2 * i + 1], node[2 * i + 2]);}Segment_Tree_Range_Maximum_Query(const size_t M, const T ini) : M(M), ini(ini) {for (N = 1; N < M; N *= 2);node.resize(2 * N - 1, ini);}void update(size_t idx, const T var) {idx += (N - 1);node[idx] = var;while (idx > 0) {idx = (idx - 1) / 2;node[idx] = max(node[2 * idx + 1], node[2 * idx + 2]);}}T getvar(const int a, const int b, int k = 0, int l = 0, int r = -1) {if (r < 0) r = N;if (r <= a || b <= l) return ini;if (a <= l && r <= b) return node[k];T vl = getvar(a, b, 2 * k + 1, l, (l + r) / 2);T vr = getvar(a, b, 2 * k + 2, (l + r) / 2, r);return max(vl, vr);}T operator[](size_t idx) {return node[idx + N - 1];}T operator[](pair<size_t, size_t> p) {return getvar(p.first, p.second);}void print() {cout << "{ " << getvar(0, 1);for (int i = 1; i < M; ++i) cout << ", " << getvar(i, i + 1);cout << " }" << endl;}};template<class T> class Segment_Tree_Range_Minimum_Query {size_t N,M;T ini;vector<T> node;public:Segment_Tree_Range_Minimum_Query(const vector<T> & ar, const T ini) : M(ar.size()), ini(ini) {for (N = 1; N < M; N *= 2);node.resize(2 * N - 1, ini);for (int i = 0; i<M; ++i) node[i + N - 1] = ar[i];for (int i = N - 2; i >= 0; --i) node[i] = min(node[2 * i + 1], node[2 * i + 2]);}Segment_Tree_Range_Minimum_Query(const size_t M, const T ini) : M(M), ini(ini) {for (N = 1; N < M; N *= 2);node.resize(2 * N - 1, ini);}void update(size_t idx, const T var) {idx += (N - 1);node[idx] = var;while (idx > 0) {idx = (idx - 1) / 2;node[idx] = min(node[2 * idx + 1], node[2 * idx + 2]);}}T getvar(const int a, const int b, int k = 0, int l = 0, int r = -1) {if (r < 0) r = N;if (r <= a || b <= l) return ini;if (a <= l && r <= b) return node[k];T vl = getvar(a, b, 2 * k + 1, l, (l + r) / 2);T vr = getvar(a, b, 2 * k + 2, (l + r) / 2, r);return min(vl, vr);}T operator[](size_t idx) {return node[idx + N - 1];}T operator[](pair<size_t, size_t> p) {return getvar(p.first, p.second);}void print() {cout << "{ " << getvar(0, 1);for (int i = 1; i < M; ++i) cout << ", " << getvar(i, i + 1);cout << " }" << endl;}};int main() {int N,K,idx; cin >> N >> K;K;vector<ll> X(N+2,0),A(N+2,0);vector<int> L(N+2),R(N+2);for(int i = 1; i <= N; ++i) cin >> X[i];for(int i = 1; i <= N; ++i) cin >> A[i];X[N+1] = HIGHINF;X[0] = -HIGHINF;for(int i = 1; i < N+1; ++i) R[i] = (upper_bound(ALL(X),X[i]+A[i]) - X.begin()) - 1;for(int i = 1; i < N+1; ++i) L[i] = (lower_bound(ALL(X),X[i]-A[i]) - X.begin());R[N+1] = L[N+1] = N+1;R[0] = L[0] = 0;Segment_Tree_Range_Maximum_Query<int> SegR(R,-1234567);Segment_Tree_Range_Minimum_Query<int> SegL(L,1234567);int l = K,r = K;for(int i = 0; i <= 10*N; ++i){int tmpr = SegR.getvar(l,r+1);int tmpl = SegL.getvar(l,r+1);chmax(r,tmpr);chmin(l,tmpl);}cout << r - l + 1 << endl;return 0;}