oj.uz

답안 #946665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
946665 2024-03-14T21:30:23 Z NourWael Vudu (COCI15_vudu) C++17
42 / 140
 311 ms 65536 KB 
#include <bits/extc++.h>
#define int long long 
using namespace std; 
using namespace __gnu_pbds; 
int const mxN = 1e6;
int a[mxN + 1];
int seg[4*mxN];
map<int,int> val;
//// ans += st.order_of_key(x+1);

int get ( int node, int l, int r, int ind) {
   if(ind<l) return 0;
   if(r-1<=ind) return seg[node];
   int m = (l+r) / 2;
   return get(node*2+1, l, m, ind) + get(node*2+2, m, r, ind);
}

void update ( int node, int l, int r, int ind) {
    if(ind<l || ind>=r) return;
    if(l==r-1 && l==ind) {
      seg[node] += 1;
      return;
    }
    int m = (l+r) / 2;
    update(node*2+1, l, m, ind), update(node*2+2, m, r, ind);
    seg[node] = seg[node*2+1] + seg[node*2+2];
}

signed main() {
   ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
   
   int n,p, ans = 0, ind = 0; cin>>n;
   for(int i=0; i<n; i++) cin>>a[i];
   cin>>p;
   set<int> st;
   st.insert(p);
   for(int i=0; i<n; i++) {
      a[i] += (i? a[i-1]:0);
      int x = a[i] - p*i;
      st.insert(x);
   }
   for(auto it:st) { val[it] = ind; ind++; }
   int pw = (1<<(__lg(ind-1)+1));
   st.clear();
   update(0,0,pw, val[p]);
   for(int i=0; i<n; i++) {
      int x = a[i] - p*i;
      x = val[x];
      ans += get(0,0,pw, x);
      update(0,0,pw,x);
   }
   cout<<ans;
   return 0;
}

Subtask #1
42.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3420 KB Output is correct
2 Correct 4 ms 3212 KB Output is correct
3 Correct 4 ms 3164 KB Output is correct
4 Runtime error 311 ms 65536 KB Execution killed with signal 9
5 Runtime error 259 ms 65536 KB Execution killed with signal 9
6 Runtime error 271 ms 65536 KB Execution killed with signal 9
7 Runtime error 261 ms 65536 KB Execution killed with signal 9
8 Runtime error 262 ms 65536 KB Execution killed with signal 9
9 Runtime error 271 ms 65536 KB Execution killed with signal 9
10 Runtime error 256 ms 65536 KB Execution killed with signal 9