Submission #220801

#	Time	Username	Problem	Language	Result	Execution time	Memory
220801		Haunted_Cpp	Vudu (COCI15_vudu)	C++17	140 / 140	379 ms	25808 KiB

vudu

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <bitset>
#include <random>
#include <chrono>
#include <iomanip>
 
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

const int N = 1e6 + 5;

int bit [N];
int a [N];

void update (int idx, int delta) {
  for (; idx < N; idx += idx & (- idx)) {
    bit[idx] += delta;
  }
}

int query (int idx) {
  int res = 0;
  for (; idx > 0; idx -= idx & (- idx)) {
    res += bit[idx];
  }
  return res;
}

int range (int lo, int hi) {
  return query (hi) - query (lo - 1);
}


int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  F0R (i, n) {
    cin >> a[i];
  }
  int k;
  cin >> k;
  F0R (i, n) {
    a[i] -= k;
  }
  vi64 comp;
  i64 res = 0;
  comp.eb(res);
  F0R (i, n) {
    res += a[i];
    comp.eb(res);
  }
  sort (all(comp));
  i64 ans = 0;
  res = 0;
  update ( lower_bound (all(comp), 0) - comp.begin() + 1, 1);
  F0R (i, n) {
    res += a[i];
    int Get = (lower_bound (all(comp), res) - comp.begin()) + 1;  
    ans += range (1, Get); 
    update ( Get, + 1);  
  }
  cout << ans << '\n';
  return 0;
}

• Subtask 1: 140 / 140