제출 #443147

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443147		wind_reaper	Vudu (COCI15_vudu)	C++17	112 / 140	681 ms	65540 KiB

vudu

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>


using namespace std;
using namespace __gnu_pbds;
using namespace chrono;

// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());

template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;


//***************** CONSTANTS *****************



//***************** GLOBAL VARIABLES *****************



//***************** AUXILIARY STRUCTS *****************



//***************** MAIN BODY *****************

void solve(){
	int N;
	cin >> N;

	ordered_set<pair<int64_t, int>> s;
	int64_t A[N+1];
	A[0] = 0;
	for(int i = 1; i <= N; i++){
		cin >> A[i];
		if(i) A[i] += A[i-1];
	}

	int64_t P;
	cin >> P;

	int64_t ans = 0;

	for(int i = 0; i <= N; i++){
		ans += s.order_of_key({A[i] - P*1LL*i, i});
		s.insert({A[i] - P*1LL*i, i});
	}

	cout << ans << '\n';
}

//***************** *****************

int32_t main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);

	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

	int tc = 1;
	// cin >> tc; 
	for (int t = 0; t < tc; t++)
		solve();

	#ifdef LOCAL 
		auto end = high_resolution_clock::now();
		cout << fixed << setprecision(4);
		cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
	#endif

	return 0;
}

/*
If code gives a WA, check for the following : 
1. I/O format

2. Are you clearing all global variables in between tests if multitests are a thing

3. Can you definitively prove the logic
*/

• Subtask 1: 112 / 140