oj.uz

Submission #161031

# Submission time Handle Problem Language Result Execution time Memory
161031 2019-10-31T09:28:49 Z stoyan_malinin Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 1627 ms 262148 KB 
#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

const int MAXN = 1e6 + 5;

int n;
int a[MAXN];

int findIndex(vector <int> &v, int x)
{
    if(v[0]>=x) return -1;

    int l = 0, r = v.size() - 1, mid;
    while(l+1<r)
    {
        mid = (l+r)/2;

        if(v[mid]<x) l = mid;
        else r = mid - 1;
    }

    if(v[r]<x) return v[r];
    return v[l];
}

struct node
{
    int maxCost;
    vector <int> v;

    int l, r;
    node *L, *R;

    node(){}
    node(int l, int r)
    {
        this->l = l;
        this->r = r;
        this->maxCost = 0;
        this->v = vector <int>{};

        this->L = nullptr;
        this->R = nullptr;
    }

    int calcCost(node *A, node *B)
    {
        int ans = max(A->maxCost, B->maxCost);

        int x = findIndex(B->v, A->v.back());
        if(x!=-1) ans = max(ans, x + A->v.back());

        return ans;
    }

    void build()
    {
        if(this->l==this->r)
        {
            this->v = vector <int>{a[this->l]};
            return;
        }

        this->L = new node(this->l, (this->l+this->r)/2);
        this->R = new node((this->l+this->r)/2+1, this->r);

        this->L->build();
        this->R->build();
        this->maxCost = this->calcCost(this->L, this->R);

        for(int x: this->L->v) this->v.push_back(x);
        for(int x: this->R->v) this->v.push_back(x);
        sort(this->v.begin(), this->v.end());
    }

    void query(int ql, int qr, vector <node*> &output)
    {
        if(this->l>=ql && this->r<=qr)
        {
            output.push_back(this);
            return;
        }
        if(this->r<ql || this->l>qr) return;

        this->L->query(ql, qr, output);
        this->R->query(ql, qr, output);
    }
};

node *T;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int Q;

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

    T = new node(0, n-1);
    T->build();

    while(Q--)
    {
        int l, r, x;
        cin >> l >> r >> x;
        l--;r--;

        int cost = 0;
        vector <node*> v;T->query(l, r, v);

        int maxElement = -1;
        for(int i = 0;i<v.size();i++)
        {
            cost = max(cost, v[i]->maxCost);
            if(maxElement!=-1)
            {
                int curr = findIndex(v[i]->v, maxElement);
                if(curr!=-1) cost = max(cost, curr + maxElement);
            }

            maxElement = max(maxElement, v[i]->v.back());
        }

        if(cost<=x) cout << "1" << '\n';
        else cout << "0" << '\n';
    }
}
/*
5 2
3 5 1 8 2
1 3 6
2 5 3
*/

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:121:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0;i<v.size();i++)
                       ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 11 ms 1656 KB Output is correct
13 Correct 12 ms 1784 KB Output is correct
14 Correct 15 ms 1784 KB Output is correct
15 Correct 15 ms 1784 KB Output is correct
16 Correct 11 ms 1788 KB Output is correct
17 Correct 9 ms 1400 KB Output is correct
18 Correct 10 ms 1784 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1627 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 28848 KB Output is correct
2 Correct 429 ms 28792 KB Output is correct
3 Correct 319 ms 28876 KB Output is correct
4 Correct 302 ms 28832 KB Output is correct
5 Correct 305 ms 28784 KB Output is correct
6 Correct 215 ms 28656 KB Output is correct
7 Correct 217 ms 28656 KB Output is correct
8 Correct 277 ms 28448 KB Output is correct
9 Correct 67 ms 2168 KB Output is correct
10 Correct 271 ms 28460 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 11 ms 1656 KB Output is correct
13 Correct 12 ms 1784 KB Output is correct
14 Correct 15 ms 1784 KB Output is correct
15 Correct 15 ms 1784 KB Output is correct
16 Correct 11 ms 1788 KB Output is correct
17 Correct 9 ms 1400 KB Output is correct
18 Correct 10 ms 1784 KB Output is correct
19 Correct 1016 ms 60756 KB Output is correct
20 Correct 1047 ms 60616 KB Output is correct
21 Correct 868 ms 60520 KB Output is correct
22 Correct 892 ms 60612 KB Output is correct
23 Correct 867 ms 60572 KB Output is correct
24 Correct 506 ms 60368 KB Output is correct
25 Correct 514 ms 60372 KB Output is correct
26 Correct 706 ms 60660 KB Output is correct
27 Correct 677 ms 60616 KB Output is correct
28 Correct 707 ms 60652 KB Output is correct
29 Correct 742 ms 60576 KB Output is correct
30 Correct 725 ms 60756 KB Output is correct
31 Correct 707 ms 60564 KB Output is correct
32 Correct 725 ms 60780 KB Output is correct
33 Correct 752 ms 60652 KB Output is correct
34 Correct 446 ms 60224 KB Output is correct
35 Correct 475 ms 60344 KB Output is correct
36 Correct 445 ms 60144 KB Output is correct
37 Correct 443 ms 60012 KB Output is correct
38 Correct 453 ms 60384 KB Output is correct
39 Correct 678 ms 59280 KB Output is correct
40 Correct 402 ms 37972 KB Output is correct
41 Correct 601 ms 58796 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 11 ms 1656 KB Output is correct
13 Correct 12 ms 1784 KB Output is correct
14 Correct 15 ms 1784 KB Output is correct
15 Correct 15 ms 1784 KB Output is correct
16 Correct 11 ms 1788 KB Output is correct
17 Correct 9 ms 1400 KB Output is correct
18 Correct 10 ms 1784 KB Output is correct
19 Runtime error 1627 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -