oj.uz

Submission #946597

# Submission time Handle Problem Language Result Execution time Memory
946597 2024-03-14T19:27:18 Z MohammadAbduljalil Vudu (COCI15_vudu) C++17
112 / 140
 516 ms 65536 KB 
#include <bits/extc++.h>
#define int long long 
using namespace std; 
using namespace __gnu_pbds; 
int const mxN = 3e5+5;
int const mxN2 = 1e6;
int a[mxN2 + 5];

signed main() {
   ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
   
   int n,p, ans = 0;
   cin>>n;
   for(int i=0; i<n; i++) cin>>a[i];
   cin>>p;
   tree<int,null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> st;
   st.insert(p);
   for(int i=0; i<n; i++) {
      a[i] += (i? a[i-1]:0);
      int x = a[i] - p*i;
      ans += st.order_of_key(x+1);
      st.insert(x);
   }
   cout<<ans;
   return 0;
}

Subtask #1
112.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 772 KB Output is correct
4 Runtime error 516 ms 65536 KB Execution killed with signal 9
5 Correct 258 ms 46112 KB Output is correct
6 Correct 443 ms 65536 KB Output is correct
7 Correct 413 ms 65536 KB Output is correct
8 Correct 369 ms 62548 KB Output is correct
9 Runtime error 402 ms 65536 KB Execution killed with signal 9
10 Correct 415 ms 65536 KB Output is correct