제출 #1272132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272132		ahmd_ibraaa	Vudu (COCI15_vudu)	C++20	112 / 140	616 ms	66780 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;

#define ll long long
#define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define double long double
#define medal ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define sec second
#define endl '\n'

signed main(){
	medal
	unsigned int n;
	cin>>n;
	ordered_set ms;
	unsigned int a[n+1];
	for(unsigned int i=1; i<=n; i++){
		cin>>a[i];
	}
	unsigned int p; cin>>p;
	
	ll ans = 0;
	ll pref[n+1];
	vector<ll> vec;
	pref[0] = 0;
	vec.push_back(0);
	for (int i = 1; i<=n; i++){
		pref[i] = pref[i-1]+a[i]-p;
		vec.push_back(pref[i]);
	}
	sort(vec.begin(), vec.end());
	
	for(int i=0; i<=n; i++){
		pref[i] = upper_bound(vec.begin(), vec.end(), pref[i]) - vec.begin();
	}
	ms.insert(pref[0]);
	for(unsigned int i=1; i<=n; i++){
		unsigned int cnt = ms.order_of_key(pref[i]+1);
		ans += cnt;
		ms.insert(pref[i]);
	}
	cout<<ans;
}

• Subtask 1: 112 / 140