제출 #508479

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
508479		PoPularPlusPlus	Vudu (COCI15_vudu)	C++17	70 / 140	524 ms	65540 KiB

vudu

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve(){
	int n;
	cin >> n;
	ll arr[n];
	for(int i = 0; i < n; i++)cin >> arr[i];
	ll p;
	cin >> p;
	for(int i = 0; i < n; i++)arr[i] -= p;
	ll pre[n + 1];
	pre[n] = 0;
	for(int i = n - 1; i >= 0; i--){
		pre[i] = pre[i + 1] + arr[i];
	}
		
	ll ans = 0;
	ordered_set<pair<ll,int>> s;
	for(int i = 0; i < n; i++){	
		s.insert(mp(pre[i],i));
		ll x = pre[i + 1];
		ans += (i + 1LL) - ((ll)s.order_of_key(mp(x,-1)));
	}
	cout << ans << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

• Subtask 1: 70 / 140