Submission #237335

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
237335	2020-06-06T02:30:14 Z	mohamedsobhi777	Vudu (COCI15_vudu)	C++14	0 / 140	293 ms	27840 KB

vudu

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 7;

int n, k;
int a[N];


vector<pair<long long , int > > srtd ; 

int bit[N] ;
int pos[N] ;

int read_int()
{
        char r;
        bool start = false, neg = false;
        int ret = 0;
        while (true)
        {
                r = getchar();
                if ((r - '0' < 0 || r - '0' > 9) && r != '-' && !start)
                {
                        continue;
                }
                if ((r - '0' < 0 || r - '0' > 9) && r != '-' && start)
                {
                        break;
                }
                if (start)
                        ret *= 10;
                start = true;
                if (r == '-')
                        neg = true;
                else
                        ret += r - '0';
        }
        if (!neg)
                return ret;
        else
                return -ret;
}

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 ; 

void init(){
        srtd.push_back({0 , 0}) ; 
        sort(srtd.begin() , srtd.end()) ; 
        for(int i = 0 ; i < (int) srtd.size() ;i++){
                pos[srtd[i].second]  = i +1;
        }
}

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

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

        k = read_int(); 
        
        long long sum = 0 ;

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

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

Subtask #1

0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	6 ms	768 KB	Output isn't correct
2	Incorrect	6 ms	640 KB	Output isn't correct
3	Incorrect	5 ms	640 KB	Output isn't correct
4	Incorrect	268 ms	26944 KB	Output isn't correct
5	Incorrect	157 ms	19044 KB	Output isn't correct
6	Incorrect	237 ms	23996 KB	Output isn't correct
7	Incorrect	293 ms	25024 KB	Output isn't correct
8	Incorrect	216 ms	21696 KB	Output isn't correct
9	Incorrect	277 ms	27840 KB	Output isn't correct
10	Incorrect	236 ms	24256 KB	Output isn't correct