oj.uz

답안 #98826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98826 2019-02-26T10:07:05 Z someone_aa Vudu (COCI15_vudu) C++17
56 / 140
 1000 ms 66560 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define P pair<ll, ll>
using namespace std;
const int maxn = 1000100;
const int maxm = 2 * maxn;
int tree[maxm], m;

void update(int x,int val) {
    while(x<=m)  {
        tree[x]+=val;  x+=(x&-x);
    }
}

int query(int x) {
    int res=0;
    while(x>0)  {
        res+=tree[x];  x-=(x&-x);
    }
    return res;
}

ll n, d, arr[maxn];
map<ll, int> ind;
set<ll>values;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin>>n;
    for(int i=1;i<=n;i++) {
        cin>>arr[i];
    }
    cin>>d;
    ll sum = 0LL;
    for(ll i=1LL;i<=n;i++) {
        ind[sum-d*i] = 1;
        sum += arr[i];
        ind[sum-d*i - d] = 1;
    }

    int br = 1;
    for(auto i:ind) {
        ind[i.first] = br++;
    }
    m = br;
    sum = 0LL;
    ll result = 0LL;
    for(int i=1;i<=n;i++) {
        update(ind[sum - d*i], 1);
        //cout<<i<<": "<<sum-d*i<<", "<<ind[sum-d*i]<<" -> ";
        sum += arr[i];
        result += 1LL * query(ind[sum - d*i - d]);
        //cout<<sum - d*i - d<<", "<<ind[sum-d*i-d]<<"\n";
    }
    cout<<result<<"\n";
    return 0;
}

Subtask #1
56.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 812 KB Output is correct
2 Correct 6 ms 768 KB Output is correct
3 Correct 7 ms 788 KB Output is correct
4 Runtime error 835 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Correct 948 ms 42232 KB Output is correct
6 Execution timed out 1059 ms 66560 KB Time limit exceeded
7 Execution timed out 1055 ms 66560 KB Time limit exceeded
8 Execution timed out 1041 ms 64248 KB Time limit exceeded
9 Runtime error 720 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Execution timed out 1060 ms 66560 KB Time limit exceeded