oj.uz

Submission #875340

# Submission time Handle Problem Language Result Execution time Memory
875340 2023-11-19T07:30:29 Z serifefedartar Vudu (COCI15_vudu) C++17
42 / 140
 431 ms 65536 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 20; 
const ll MAXN = 1e6 + 10;

vector<int> A;
tree<pair<ll,int>, null_type, less<pair<ll,int>>, rb_tree_tag, tree_order_statistics_node_update> s;
ll pref[MAXN];
 
int main() {
	fast
	int N;
	ll P;
	cin >> N;
 
	A = vector<int>(N+1);
	for (int i = 1; i <= N; i++)
		cin >> A[i];
	for (int i = 1; i <= N; i++)
		pref[i] = pref[i-1] + A[i];
	cin >> P;
 
	int ans = 0;
	for (ll i = 1; i <= N; i++) {
	    s.insert(make_pair(P * i - pref[i-1], i));
		ans += s.size() - s.order_of_key(make_pair(P * i - pref[i] + P, -1));
	}
	cout << ans << "\n";
}

Subtask #1
42.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Runtime error 431 ms 65536 KB Execution killed with signal 9
5 Incorrect 239 ms 43088 KB Output isn't correct
6 Incorrect 406 ms 63980 KB Output isn't correct
7 Runtime error 363 ms 65536 KB Execution killed with signal 9
8 Incorrect 359 ms 57936 KB Output isn't correct
9 Runtime error 367 ms 65536 KB Execution killed with signal 9
10 Incorrect 412 ms 64764 KB Output isn't correct