Submission #237325

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
237325	2020-06-06T01:48:15 Z	mohamedsobhi777	Vudu (COCI15_vudu)	C++14	98 / 140	1000 ms	61780 KB

vudu

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 7;

int n, k;
int a[N];


vector<long long> srtd ; 
unordered_map<long long, int > mp ;
int bit[N] ;

void add(int x){
        for(;x < N ;x += x&-x ){
                bit[x] ++ ; 
        }
}

int get(int x){
        if(x < 0 ) return 0; 
        int ret =0 ; 
        for(;x;x-=x&-x){
                ret+=bit[x] ;
        }
        return ret ; 
}

int t =1 ; 

int com(long long x){
        if(mp[x]){
                return mp[x] ;
        }
        mp[x] = t++ ; 
        return t-1 ; 
}

void init(){
        srtd.push_back(0) ; 
        sort(srtd.begin() , srtd.end()) ; 

        for(int i = 0 ; i < (int) srtd.size() ;i++){
                com(srtd[i]) ;
        }
}

int main()
{
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        //freopen("in.in", "r", stdin);

        cin >> n;
        for (int i = 0; i < n; i++)
        {
                cin >> a[i];
        }

        cin >> k;
        
        long long sum = 0 ;

        for (int i = 0; i < n; i++)
        {
                a[i] -= k;
                sum+= a[i] ; 
                srtd.push_back(sum) ;
        }

        init() ;
        
        long long ans = 0;
        long long pre = 0;
        add(com(0)) ; 
        for (int i = 0; i < n; i++)
        {
                pre += a[i];
                ans+= get(com(pre)) ;
                add(com(pre)) ; 
        }
        cout << ans;
        return 0;
}

Subtask #1

98.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	896 KB	Output is correct
2	Correct	7 ms	768 KB	Output is correct
3	Correct	7 ms	640 KB	Output is correct
4	Execution timed out	1093 ms	61524 KB	Time limit exceeded
5	Correct	571 ms	33364 KB	Output is correct
6	Correct	935 ms	47708 KB	Output is correct
7	Execution timed out	1006 ms	49376 KB	Time limit exceeded
8	Correct	863 ms	43728 KB	Output is correct
9	Execution timed out	1095 ms	61780 KB	Time limit exceeded
10	Correct	920 ms	48200 KB	Output is correct