Submission #410109

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
410109	2021-05-22T03:05:40 Z	rqi	Vudu (COCI15_vudu)	C++14	112 / 140	659 ms	65540 KB

vudu

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

typedef long long ll;
#define ins insert
#define mp make_pair

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

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

#define ook order_of_key

const int mx = 1000005;
int N;
ll a[mx];
ll P;

int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> N;
	for(int i = 1; i <= N; i++){
		cin >> a[i];
	}
	cin >> P;
	for(int i = 1; i <= N; i++){
		a[i]-=P;
	}
	for(int i = 1; i <= N; i++){
		a[i]+=a[i-1];
	}

	Tree<pair<ll, int>> t;
	t.ins(mp(0, 0));
	ll ans = 0;
	for(int i = 1; i <= N; i++){
		ll val = ll(t.ook(mp(a[i], N+5)));
		//cout << "i, val: " << i << " " << val << "\n";
		ans+=val;
		t.ins(mp(a[i], i));

	}
	cout << ans << "\n";
}

Subtask #1

112.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	844 KB	Output is correct
2	Correct	3 ms	716 KB	Output is correct
3	Correct	3 ms	716 KB	Output is correct
4	Runtime error	659 ms	65540 KB	Execution killed with signal 9
5	Correct	361 ms	44100 KB	Output is correct
6	Correct	601 ms	65536 KB	Output is correct
7	Correct	594 ms	65536 KB	Output is correct
8	Correct	523 ms	62132 KB	Output is correct
9	Runtime error	583 ms	65540 KB	Execution killed with signal 9
10	Correct	592 ms	65536 KB	Output is correct