oj.uz

Submission #313827

# Submission time Handle Problem Language Result Execution time Memory
313827 2020-10-17T06:41:04 Z vivaan_gupta Vudu (COCI15_vudu) C++14
56 / 140
 474 ms 65540 KB 
		#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
using namespace std;

 
const ll N =(2e6+5); // TODO : change value as per problem
const ll MOD = 1e9+7;

unordered_map<int, int> M;
ll cnt = 1;
ll bit[N];
int lol[N];
int lol2[N];
int pre[N];
int a[N];
void upd(int idx){
	while(idx <= cnt){
		bit[idx]++;
		idx += (idx&(-idx));
	}
}
ll query(int idx){
	ll ans =0;
	while(idx >= 1){
		ans += bit[idx];
		idx -= (idx&(-idx));
	}
	return ans;
}
void solve() {
	// you should actually read the stuff at the bottom
	int n;
	cin >> n;
	FOR(i,1,n+1) cin >> a[i];
	int p;
	cin >> p;
	pre[0] = 0;
	FOR(i,1,n+1) pre[i] = pre[i-1] + a[i];
	ll ans =0;
	vector <ll> gg;
	FOR(i,1,n+1){
		gg.pb(pre[i] - p*i);
		gg.pb(pre[i-1] - p*i + p);
	}
	sort(gg.begin(),gg.end());
	M.reserve(2*n);
	for(auto x:gg){
		if(M.find(x) != M.end()) continue;
		M[x] = cnt;
		cnt++;
	}
	cnt--;
	// // assert(cnt <= 2e6);
	FOR(i,1,n+1) {
		lol[i] = M[pre[i] - p*i];
		lol2[i] = M[pre[i-1] - p*i + p];	
	}
	
	ROF(i,1,n+1){
		upd(lol[i]);
		int tot = n-i+1;
		tot -=  query(lol2[i] - 1);
		ans += tot;
	}
	cout << ans << endl;
}
signed main(){
 
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
     // freopen(".in","r",stdin);freopen(".out","w",stdout);
    
     ll tt=1;   
     // cin >> tt;
    while(tt--){    
        solve();
    }    
}

Subtask #1
56.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1152 KB Output is correct
2 Correct 3 ms 896 KB Output is correct
3 Correct 3 ms 896 KB Output is correct
4 Runtime error 435 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Correct 433 ms 56384 KB Output is correct
6 Runtime error 442 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Runtime error 430 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Runtime error 474 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Runtime error 427 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Runtime error 433 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)