Submission #2873155

---

Source Code Expand

#include<iostream>
#include <list>
#include<stack>
#include<queue>
#include <vector>
#include <set>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<string>
#include <functional>
#include<fstream>

#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define REP(i,n) FOR((i),0,(n))
#define ll long long
#define CLR(a) memset((a),0,sizeof(a))
#define SZ(x) (int((x).size()))
#define WAITING(str) int str;std::cin>>str;
#define DEBUGING(str) cout<<str<<endl
using namespace std;

const ll MOD = 1000000007;// 10^9+7
const int INF = (1 << 30);


//変数
int N;
ll K;
vector<ll> a;






//サブ関数
//入力
void input()
{
	cin >> N >> K;
	a.resize(N + 1);
	REP(i, N)cin >> a[i + 1];
	REP(i, N)a[i + 1] -= K;
	REP(i, N)a[i + 1] += a[i];
}

vector<pair<ll, ll>> make_sample(vector<ll> a)
{
	vector<pair<ll, ll>> sample;
	REP(i, N + 1)sample.push_back({ a[i],i });
	sort(sample.begin(), sample.end());
	return sample;
}

void erase_target(vector<pair<ll, ll>>& sample, pair<ll,ll> alpha)
{
	auto itr = lower_bound(sample.begin(), sample.end(), alpha);
	if (alpha != *itr)exit(1);
	sample.erase(itr);
}

ll count(vector<pair<ll, ll>>& sample, pair<ll, ll> alpha)
{
	erase_target(sample, alpha);
	//alpha.second = -1;
	return distance(lower_bound(sample.begin(), sample.end(), alpha), sample.end());
}

//計算
void calc()
{
	ll res = 0;
	auto sample = make_sample(a);
	REP(i, N+1)res += count(sample, { a[i],i });
	cout << res << endl;
}


//出力
void output()
{

}


//デバッグ
void debug()
{
	int N;
	cin>>N;
}


//メイン関数
int main()
{
	input();
	calc();
	output();
	debug();
	
	return 0;
}

Submission Info

Judge Result