oj.uz

Submission #260181

# Submission time Handle Problem Language Result Execution time Memory
260181 2020-08-09T14:03:59 Z sckmd Vudu (COCI15_vudu) C++14
42 / 140
 355 ms 20460 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;
  }
  int ze = -1;
  for(int i = 0; i < all.size(); i++)if(all[i]==0){ze=i;break;}
  update(ze+1,1);
  ll ans = 0LL;
  for(int i = 1; i <= n; i++)
  {
    int idx = lower_bound(all.begin(),all.end(),a[i])-all.begin()+1;
    ans += 1LL*get(idx);
    update(idx,1);
  }
  cout << ans;
  return 0;
}

Compilation message

vudu.cpp: In function 'int main()':
vudu.cpp:56:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < all.size(); i++)if(all[i]==0){ze=i;break;}
                  ~~^~~~~~~~~~~~

Subtask #1
42.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 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 19596 KB Output isn't correct
5 Incorrect 196 ms 13280 KB Output isn't correct
6 Incorrect 294 ms 17628 KB Output isn't correct
7 Incorrect 308 ms 18016 KB Output isn't correct
8 Incorrect 255 ms 15968 KB Output isn't correct
9 Incorrect 355 ms 20460 KB Output isn't correct
10 Incorrect 304 ms 17888 KB Output isn't correct