結果

問題 No.1093 区間の和 / Sum of Range
ユーザー ningenMeningenMe
提出日時 2020-06-27 19:47:28
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 222 ms / 2,000 ms
コード長 4,254 bytes
コンパイル時間 3,740 ms
コンパイル使用メモリ 210,504 KB
実行使用メモリ 23,448 KB
最終ジャッジ日時 2023-09-19 08:28:17
合計ジャッジ時間 12,947 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 111 ms
12,404 KB
testcase_02 AC 53 ms
5,424 KB
testcase_03 AC 43 ms
23,448 KB
testcase_04 AC 40 ms
22,876 KB
testcase_05 AC 161 ms
12,552 KB
testcase_06 AC 36 ms
7,716 KB
testcase_07 AC 93 ms
12,416 KB
testcase_08 AC 86 ms
22,936 KB
testcase_09 AC 141 ms
7,604 KB
testcase_10 AC 90 ms
22,584 KB
testcase_11 AC 137 ms
12,524 KB
testcase_12 AC 84 ms
12,824 KB
testcase_13 AC 4 ms
4,380 KB
testcase_14 AC 144 ms
7,860 KB
testcase_15 AC 41 ms
12,532 KB
testcase_16 AC 170 ms
12,824 KB
testcase_17 AC 140 ms
7,464 KB
testcase_18 AC 95 ms
7,756 KB
testcase_19 AC 13 ms
5,420 KB
testcase_20 AC 78 ms
5,164 KB
testcase_21 AC 173 ms
12,288 KB
testcase_22 AC 166 ms
12,896 KB
testcase_23 AC 117 ms
5,204 KB
testcase_24 AC 46 ms
22,660 KB
testcase_25 AC 150 ms
12,104 KB
testcase_26 AC 115 ms
22,744 KB
testcase_27 AC 153 ms
7,692 KB
testcase_28 AC 110 ms
22,580 KB
testcase_29 AC 222 ms
23,232 KB
testcase_30 AC 29 ms
7,548 KB
testcase_31 AC 40 ms
12,708 KB
testcase_32 AC 59 ms
12,596 KB
testcase_33 AC 168 ms
22,756 KB
testcase_34 AC 12 ms
4,376 KB
testcase_35 AC 163 ms
5,112 KB
testcase_36 AC 151 ms
23,076 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

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.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(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;}

/*
 * @title DisjointSparseTable
 */
template<class Operator> class DisjointSparseTable{
public:
	using TypeNode = typename Operator::TypeNode;
	size_t depth;
	size_t length;
	vector<TypeNode> node;
	vector<size_t> msb;

	DisjointSparseTable(const vector<TypeNode>& vec) {
		for(depth = 0;(1<<depth)<=vec.size();++depth);
		length = (1<<depth);
		
		//msb
		msb.resize(length,0);
		for(int i = 0; i < length; ++i) for(int j = 0; j < depth; ++j) if(i>>j) msb[i] = j;

		//init value
		node.resize(depth*length,Operator::unit_node);
		for(int i = 0; i < vec.size(); ++i) node[i] = vec[i];

		for(int i = 1; i < depth; ++i) {
			for(int r = (1<<i),l = r-1; r < length; r += (2<<i),l = r-1){
				//init accumulate
				node[i*length+l] = node[l];
				node[i*length+r] = node[r];
				//accumulate
				for(int k = 1; k < (1<<i); ++k) {
					node[i*length+l-k] = Operator::func_node(node[i*length+l-k+1],node[l-k]);
					node[i*length+r+k] = Operator::func_node(node[i*length+r+k-1],node[r+k]);
				}
			}
		}
	}

	//[l,r)
	TypeNode get(int l,int r) {
		r--;
		return (l>r||l<0||length<=r) ? Operator::unit_node: (l==r ? node[l] : Operator::func_node(node[msb[l^r]*length+l],node[msb[l^r]*length+r]));
	}
};

//sum
template<class T> struct NodeSum {
	using TypeNode = T;
	inline static constexpr TypeNode unit_node = 0;
	inline static constexpr TypeNode func_node(TypeNode l,TypeNode r){return l+r;}
};

int main() {
	int N,K; cin >> N >> K;
	vector<ll> A(N);
	for(int i = 0; i < N; ++i) cin >> A[i];
	DisjointSparseTable<NodeSum<ll>> st(A);
	vector<ll> B;
	for(int i = 0; i+K <= N; ++i) {
		B.push_back(st.get(i,i+K));
	}
	sort(ALL(B));
	int Q; cin >> Q;
	while(Q--) {
		ll x; cin >> x;
		cout << upper_bound(ALL(B),x) - B.begin() << endl;
	}
    return 0;
}
0