oj.uz

Submission #260182

# Submission time Handle Problem Language Result Execution time Memory
260182 2020-08-09T14:11:42 Z sckmd Vudu (COCI15_vudu) C++14
42 / 140
 371 ms 20064 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define MAXN 1000005
ll a[MAXN];
int bit[MAXN];
map <ll,int> mp;

void update(int idx,int val)
{
  while(idx < MAXN)
  {
    bit[idx] += val;
    idx += idx&(-idx);
  }
}
ll get(int idx)
{
  ll ret = 0LL;
  while(idx > 0)
  {
    ret += bit[idx];
    idx -= idx&(-idx);
  }
  return ret;
}
ll get(int l,int r)
{
  ll ret = get(r);
  if(l > 0)ret -= get(l-1);
  return ret;
}
vector <int> all;
vector <int> allz;
int main()
{
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  for(int i = 1; i <= n; i++)cin >> a[i];
  int p;
  cin >> p;
  for(int i = 1; i <= n; i++)a[i]-=p,a[i]+=a[i-1];
  allz.push_back(0);
  for(int i = 1; i <= n; i++)allz.push_back(a[i]);
  sort(allz.begin(),allz.end());
  ll prev = -1e18;
  for(auto x:allz)
  {
    if(x==prev)continue;
    all.push_back(x);
    prev=x;
  }
  ll ans = 0LL;
  for(int i = 0; i <= n; i++)
  {
    int idx = lower_bound(all.begin(),all.end(),a[i])-all.begin();
    idx++;
    ans += 1LL*get(idx);
    update(idx,1);
  }
  cout << ans;
  return 0;
}

Subtask #1
42.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Incorrect 345 ms 19416 KB Output isn't correct
5 Incorrect 197 ms 12896 KB Output isn't correct
6 Incorrect 300 ms 17248 KB Output isn't correct
7 Incorrect 304 ms 17760 KB Output isn't correct
8 Incorrect 266 ms 15584 KB Output isn't correct
9 Incorrect 371 ms 20064 KB Output isn't correct
10 Incorrect 309 ms 17564 KB Output isn't correct