답안 #75370

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
75370	2018-09-09T13:11:25 Z	damien_g	Vudu (COCI15_vudu)	C++14	42 / 140	1000 ms	66560 KB

vudu

#include <cstdio>
#include <set>
#include <map>

using namespace std;

typedef long long ll;

const ll INF = 1LL << 60;

struct Node
{
    ll l, r;
    int nb;
    Node *left, *right;
    
    Node() {};
    Node(ll _l, ll _r, int _nb, Node* _left, Node* _right): l(_l), r(_r), nb(_nb), left(_left), right(_right) {};
};

Node* root;

ll half(ll k)
{
    if(k >= 0)
        return k/2;
    return -(-k+1)/2;
}

void add(Node *act, ll value)
{
    /*printf("%p, Add, %lld\n", act, value);
    printf("%lld %lld\n\n", act->l, act->r);*/
    
    if(act->r != act->l)
    {
        if(value <= half(act->l+act->r))
        {
            if(!act->left)
                act->left = new Node(act->l, half(act->l+act->r), 0, NULL, NULL);
            add(act->left, value);
        }
        else
        {
            if(!act->right)
                act->right = new Node(half(act->l+act->r)+1, act->r, 0, NULL, NULL);
            add(act->right, value);
        }
    }
    act->nb++;
}

ll rsq(Node* node, ll l, ll r)
{
    if((r < node->l) || (node->r < l))
        return 0;
    
    if((l <= node->l) && (node->r <= r))
        return node->nb;
    
    ll a = (node->left)?rsq(node->left, l, r):0;
    ll b = (node->right)?rsq(node->right, l, r):0;
    return a+b;
}

int N;
ll a[1 << 20];
ll P;

int main()
{
    scanf("%d", &N);
    for(int i = 0; i < N; i++)
        scanf("%lld", &a[i]);
    scanf("%lld", &P);
    
    for(int i = 0; i < N; i++)
        a[i] -= P;
    
    root = new Node(0, 1 << 20, 0, NULL, NULL);
    
    ll ans = 0, S = 0;
    set<ll> sums;
    sums.insert(0);
    for(int i = 0; i < N; i++)
    {
        S += a[i];
        sums.insert(S);
    }
    
    int k = 0;
    map<ll, int> hash;
    for(ll u : sums)
    {
        hash[u] = k++;
        //printf("%lld %lld\n", u, hash[u]);
    }
    sums.clear();
    add(root, hash[0]);
    
    S = 0;
    for(int i = 0; i < N; i++)
    {
        S += a[i];
        ans += rsq(root, 0, hash[S]);
        //printf("%lld: %lld\n", hash[S], rsq(root, 0, hash[S]));
        add(root, hash[S]);
    }
    
    printf("%lld\n", ans);
    return 0;
}

Compilation message

vudu.cpp: In function 'int main()':
vudu.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
vudu.cpp:74:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &a[i]);
         ~~~~~^~~~~~~~~~~~~~~
vudu.cpp:75:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &P);
     ~~~~~^~~~~~~~~~~~

Subtask #1

42.0 / 140.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	1528 KB	Output is correct
2	Correct	9 ms	1528 KB	Output is correct
3	Correct	9 ms	1528 KB	Output is correct
4	Runtime error	724 ms	66560 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
5	Execution timed out	1061 ms	66560 KB	Time limit exceeded
6	Runtime error	632 ms	66560 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
7	Runtime error	599 ms	66560 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
8	Runtime error	612 ms	66560 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
9	Runtime error	626 ms	66560 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
10	Runtime error	606 ms	66560 KB	Execution killed with signal 9 (could be triggered by violating memory limits)