#374075 (C++14) No.871 かえるのうた

提出ソース

結果

問題	No.871 かえるのうた
ユーザー	ningenMe
提出日時	2019-08-30 22:26:32
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,419 bytes
コンパイル時間	2,039 ms
コンパイル使用メモリ	186,088 KB
実行使用メモリ	10,752 KB
最終ジャッジ日時	2024-11-22 00:38:19
合計ジャッジ時間	6,730 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	WA	-
testcase_02	AC	2 ms 6,820 KB
testcase_03	AC	1 ms 6,816 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	WA	-
testcase_06	AC	2 ms 6,816 KB
testcase_07	WA	-
testcase_08	AC	6 ms 6,816 KB
testcase_09	AC	6 ms 6,820 KB
testcase_10	AC	3 ms 6,816 KB
testcase_11	WA	-
testcase_12	WA	-
testcase_13	AC	8 ms 6,816 KB
testcase_14	AC	191 ms 10,752 KB
testcase_15	WA	-
testcase_16	AC	275 ms 10,752 KB
testcase_17	AC	177 ms 10,368 KB
testcase_18	AC	34 ms 6,820 KB
testcase_19	AC	242 ms 10,752 KB
testcase_20	AC	20 ms 6,816 KB
testcase_21	AC	94 ms 6,816 KB
testcase_22	AC	2 ms 6,816 KB
testcase_23	WA	-
testcase_24	AC	2 ms 6,816 KB
testcase_25	AC	6 ms 6,816 KB
testcase_26	AC	18 ms 6,820 KB
testcase_27	AC	25 ms 6,816 KB
testcase_28	AC	2 ms 6,820 KB
testcase_29	AC	82 ms 7,808 KB
testcase_30	AC	163 ms 9,344 KB
testcase_31	WA	-
testcase_32	AC	131 ms 9,088 KB
testcase_33	AC	205 ms 10,752 KB
testcase_34	AC	40 ms 6,820 KB
testcase_35	AC	113 ms 7,552 KB
testcase_36	AC	137 ms 9,728 KB
testcase_37	AC	99 ms 6,820 KB
testcase_38	AC	229 ms 10,496 KB
testcase_39	AC	222 ms 10,112 KB
testcase_40	AC	123 ms 8,960 KB
testcase_41	AC	2 ms 6,820 KB
testcase_42	WA	-
testcase_43	AC	2 ms 6,816 KB
testcase_44	AC	2 ms 6,820 KB
testcase_45	WA	-
testcase_46	AC	2 ms 6,816 KB
testcase_47	AC	2 ms 6,816 KB
testcase_48	AC	2 ms 6,816 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.cpp: In function 'int main()':
main.cpp:170:31: warning: 'idx' may be used uninitialized [-Wmaybe-uninitialized]
  170 |         int tmpr = SegR.getvar(l,r+1);
      |                    ~~~~~~~~~~~^~~~~~~
main.cpp:148:13: note: 'idx' was declared here
  148 |     int N,K,idx; cin >> N >> K;
      |             ^~~

ソースコード

raw source code

#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),C(N+2),D(N+2);
    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;
    vector<pair<ll,int>> B(N+2);
    for(int i = 0; i < N+2; ++i) B[i] = {X[i],i};
    sort(ALL(B));
    for(int i = 0; i < N+2; ++i) C[i] = X[B[i].second];
    for(int i = 0; i < N+2; ++i) D[i] = A[B[i].second];
    for(int i = 0; i < N+2; ++i) if(B[i].second==K) idx = i;
    for(int i = 0; i < N+1; ++i) R[i] = (upper_bound(ALL(C),C[i]+D[i]) - C.begin()) - 1;
    for(int i = 1; i < N+1; ++i) L[i] = (lower_bound(ALL(C),C[i]-D[i]) - C.begin());

    Segment_Tree_Range_Maximum_Query<int> SegR(R,-1234567);
    Segment_Tree_Range_Minimum_Query<int> SegL(L,1234567);

    int l = idx,r = idx;
    for(int i = 0; i <= 3*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;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード