oj.uz

답안 #681070

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
681070 2023-01-12T10:18:29 Z sudheerays123 Vudu (COCI15_vudu) C++17
42 / 140
 379 ms 65536 KB 
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 1e6+5 , INF = 1e9 , MOD = 1e9+7;

vector<ll> fenwick(N);

void update(ll node , ll val){
	for(ll i = node; i < N; i += (i & -i)){
		fenwick[i] += val;
	}
}

ll query(ll node){
	ll ans = 0;
	for(ll i = node; i >= 1; i -= (i & -i)){
		ans += fenwick[i];
	}
	return ans;
}
 
void solve(){
 
	ll n;
	cin >> n;
 
	vector<ll> a(n+5);
	for(ll i = 1; i <= n; i++) cin >> a[i];
 
	ll p;
	cin >> p;
 
	ll sum = 0;
	set<ll> val;
 
	val.insert(0);
	for(ll i = 1; i <= n; i++){
		sum += a[i];
		val.insert(sum-p*i);
	}
 
	ll cnt = 0;
	map<ll,ll> cc;
	for(auto u : val){
		cnt++;
		cc[u] = cnt;
	}

	update(cc[0],1);
 
	ll ans = 0;
	sum = 0;
 
	for(ll i = 1; i <= n; i++){
 
		sum += a[i];
		ll s = sum-p*i;
 
		ans += query(cc[s]);
		update(cc[s],1);
	}
 
	cout << ans;
}	
 
int main(){
 
	fast;
 
	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();
 
	return 0;
}

Subtask #1
42.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 8916 KB Output is correct
2 Correct 7 ms 8788 KB Output is correct
3 Correct 7 ms 8660 KB Output is correct
4 Runtime error 379 ms 65536 KB Execution killed with signal 9
5 Runtime error 265 ms 65536 KB Execution killed with signal 9
6 Runtime error 326 ms 65536 KB Execution killed with signal 9
7 Runtime error 276 ms 65536 KB Execution killed with signal 9
8 Runtime error 323 ms 65536 KB Execution killed with signal 9
9 Runtime error 310 ms 65536 KB Execution killed with signal 9
10 Runtime error 355 ms 65536 KB Execution killed with signal 9