CSES - Datatähti 2020 loppu

CSES - Datatähti 2020 loppu - Results

Submission details
Task:	Riippuliito
Sender:	Antti Paraoanu
Submission time:	2020-02-09 16:02:37 +0200
Language:	C++ (C++17)
Status:	READY
Result:	18

Feedback
group	verdict	score
#1	ACCEPTED	18
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	2, 3	details
#9	ACCEPTED	0.01 s	2, 3	details
#10	ACCEPTED	0.01 s	2, 3	details
#11	ACCEPTED	0.01 s	2, 3	details
#12	ACCEPTED	0.01 s	2, 3	details
#13	TIME LIMIT EXCEEDED	--	2, 3	details
#14	ACCEPTED	0.01 s	2, 3	details
#15	ACCEPTED	0.08 s	3	details
#16	ACCEPTED	0.20 s	3	details
#17	ACCEPTED	0.20 s	3	details
#18	ACCEPTED	0.13 s	3	details
#19	ACCEPTED	0.15 s	3	details
#20	TIME LIMIT EXCEEDED	--	3	details
#21	TIME LIMIT EXCEEDED	--	3	details
#22	ACCEPTED	0.01 s	1, 2, 3	details
#23	ACCEPTED	0.01 s	1, 2, 3	details
#24	ACCEPTED	0.01 s	1, 2, 3	details
#25	ACCEPTED	0.01 s	1, 2, 3	details
#26	ACCEPTED	0.01 s	1, 2, 3	details
#27	ACCEPTED	0.01 s	1, 2, 3	details
#28	ACCEPTED	0.01 s	1, 2, 3	details
#29	ACCEPTED	0.01 s	1, 2, 3	details

Compiler report

input/code.cpp: In function 'int ans(std::vector<long unsigned int>&, int, int, int, maxtree*)':
input/code.cpp:130:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < m.size() - 1; ++i) {
                     ~~^~~~~~~~~~~~~~
input/code.cpp:162:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < m.size() - 1; ++i) {
                     ~~^~~~~~~~~~~~~~

Code

#include <iostream>
#include <vector>
#include <cstdint>

struct maxtree {
    uint64_t m;
    int indx;
    int mxcount;
    int from;
    int to;
    struct maxtree* a;
    struct maxtree* b;
};

struct maxtree* mkMaxtree(std::vector<uint64_t>& vec, int from, int to) {
    //std::cout << "Called mkMaxtree with from=" << from << " to=" << to << "\n";
    struct maxtree* r = new maxtree;
    if (to - from >= 2) {
        r->a = mkMaxtree(vec, from, (from + to)/2);
        r->b = mkMaxtree(vec, (from + to)/2, to);
        /*
        if (r->a->m < r->b->m) {
            auto tmp = r->b;
            r->b = r->a;
            r->a = tmp;
        }
        */
        if (r->a->m == r->b->m) {
            r->indx = -1;
            r->mxcount = r->a->mxcount + r->b->mxcount;
            r->m = r->a->m;
        } else if (r->a->m > r->b->m) {
            r->indx = r->a->indx;
            r->mxcount = r->a->mxcount;
            r->m = r->a->m;
        } else {
            r->indx = r->b->indx;
            r->mxcount = r->b->mxcount;
            r->m = r->b->m;
        }
    } else {
        r->indx = from;
        r->m = vec[from];
        r->mxcount = 1;
    }
    r->from = from;
    r->to = to;
    //std::cout << "Returning with r-> from=" << r->from << " to=" << r->to << " indx=" << r->indx << " mxcount=" << r->mxcount << "m=" << r->m << "\n";
    return r;
}

struct maxtree* submaxtree(struct maxtree* t, int from, int to) {
    if (t->to - t->from < 2)
        return t;
    if (to <= (t->from + t->to)/2) {
        return submaxtree(t->a, from, to);
    } else if (from >= (t->from + t->to)/2) {
        return submaxtree(t->b, from, to);
    } else {
        return t;
    }
}


uint64_t getMax(struct maxtree* t, int from, int to) {
    //std::cout << "Called getMax with from=" << from << " to=" << to << "\n";
    if (from >= to)
        return 0;
    if (from >= t->to || to <= t->from)
        return 0;
    t = submaxtree(t, from, to);
    if (t->mxcount == 1 && t->indx >= from && t->indx < to) {
        return t->m;
    } else {
        auto a = getMax(t->a, from, to);
        auto b = getMax(t->b, from, to);
        return std::max(a, b);
    }
}

void getMaxes(struct maxtree* t, int from, int to, std::vector<int>& v, uint64_t m) {
    //std::cout << "Called getMaxes with from=" << from << " to=" << to << " m=" << m << "\n";
    if (from >= to)
        return;
    t = submaxtree(t, from, to);
    if (t->m < m)
        return;
    if (t->mxcount == 1 && t->indx >= from && t->indx < to) {
        v.push_back(t->indx);
    } else {
        if (t->a->m >= m)
            getMaxes(t->a, from, t->a->to, v, m);
        if (t->b->m >= m)
            getMaxes(t->b, t->b->from, to, v, m);
    }
}

int ans(std::vector<uint64_t>& vec, int a, int b, int from, struct maxtree* t) {
    //std::cout << "Called ans with a=" << a << " b=" << b << " from=" << from << "\n";
    t = submaxtree(t, a, b);
    std::vector<int> m;
    m.reserve(100);
    uint64_t mx = 0;
    int ret = 0;

    m.push_back(a - 1);
    /*
    for (int i = a; i < from; ++i) {
        if (vec[i] > mx) {
            m.clear();
            m.push_back(a - 1);
            mx = vec[i];
        }
        if (vec[i] >= mx) {
            m.push_back(i);
        }
    }
    */
    mx = getMax(t, a, from);
    //std::cout << "mx: " << mx << "\n";
    getMaxes(t, a, from, m, mx);
    m.push_back(from);
    /*
    std::cout << "m (a): [";
    for (auto i : m) {
        std::cout << i << ", ";
    }
    std::cout << "]\n";
    */
    for (int i = 1; i < m.size() - 1; ++i) {
        int a = ans(vec, m[i - 1] + 1, m[i + 1], m[i], t);
        if (a > ret) {
            ret = a;
        }
    }
    mx = 0;
    m.clear();
    m.push_back(from);
    /*
    for (int i = from  + 1; i < b; ++i) {
        if (vec[i] > mx) {
            m.clear();
            m.push_back(from);
            mx = vec[i];
        }
        if (vec[i] >= mx) {
            m.push_back(i);
        }
    }
    */
    mx = getMax(t, from + 1, b);
    //std::cout << "mx: " << mx << "\n";
    getMaxes(t, from + 1, b, m, mx);
    m.push_back(b);
    /*
    std::cout << "m (b): [";
    for (auto i : m) {
        std::cout << i << ", ";
    }
    std::cout << "]\n";
    */
    for (int i = 1; i < m.size() - 1; ++i) {
        int a = ans(vec, m[i - 1] + 1, m[i + 1], m[i], t);
        if (a > ret) {
            ret = a;
        }
    }
    //std::cout << "returning " << ret + 1 << "\n";
    return ret + 1;
}

int main() {
    int n;
    std::cin >> n;
    std::vector<uint64_t> vec;
    vec.reserve(n);
    for (int i = 0; i < n; ++i) {
        uint64_t k;
        std::cin >> k;
        vec.push_back(k);
    }
    auto tree = mkMaxtree(vec, 0, n);
    std::cout << ans(vec, 0, n, n, tree) - 1 << "\n";
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 1 1 1 1 1 1 1 1 1 1` view save

correct output
`1` view save

user output
`1` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 1 2 3 4 5 6 7 8 9 10` view save

correct output
`10` view save

user output
`10` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 10 9 8 7 6 5 4 3 2 1` view save

correct output
`10` view save

user output
`10` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 10 9 6 10 10 3 6 7 6 5` view save

correct output
`4` view save

user output
`4` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 51 90 27 98 85 47 14 55 82 52` view save

correct output
`6` view save

user output
`6` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 9 65 90 86 45 52 52 95 40 85` view save

correct output
`5` view save

user output
`5` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 3 46 77 16 59 32 22 41 87 89` view save

correct output
`7` view save

user output
`7` view save

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`5000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1` view save

user output
`1` view save

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`5000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`5000` view save

user output
`5000` view save

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`5000 5000 4999 4998 4997 4996 4995 ...` view save

correct output
`5000` view save

user output
`5000` view save

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
`5000 10 8 10 5 4 9 2 9 10 10 1 2 7 ...` view save

correct output
`9` view save

user output
`9` view save

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
`5000 655923386 310000737 281882248 ...` view save

correct output
`28` view save

user output
`28` view save

Test 13

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`5000 123456789 123456790 123456791 ...` view save

correct output
`2706` view save

user output
(empty)

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
`5000 123456789 123456790 123456791 ...` view save

correct output
`5000` view save

user output
`5000` view save

Test 15

Group: 3

Verdict: ACCEPTED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1` view save

user output
`1` view save

Test 16

Group: 3

Verdict: ACCEPTED

input
`200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`200000` view save

user output
`200000` view save

Test 17

Group: 3

Verdict: ACCEPTED

input
`200000 200000 199999 199998 199997 19...` view save

correct output
`200000` view save

user output
`200000` view save

Test 18

Group: 3

Verdict: ACCEPTED

input
`200000 4 7 8 3 3 10 3 4 2 6 10 8 5 8 ...` view save

correct output
`10` view save

user output
`10` view save

Test 19

Group: 3

Verdict: ACCEPTED

input
`200000 824527039 112439661 517794857 ...` view save

correct output
`43` view save

user output
`43` view save

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`200000 123456789 123456790 123456791 ...` view save

correct output
`30764` view save

user output
(empty)

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`200000 123456789 123456790 123456791 ...` view save

correct output
`61367` view save

user output
(empty)

Test 22

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 1` view save

correct output
`1` view save

user output
`1` view save

Test 23

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 1 1` view save

correct output
`1` view save

user output
`1` view save

Test 24

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 1 2` view save

correct output
`2` view save

user output
`2` view save

Test 25

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 2 1` view save

correct output
`2` view save

user output
`2` view save

Test 26

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 1 2 1` view save

correct output
`2` view save

user output
`2` view save

Test 27

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 1 2 3` view save

correct output
`3` view save

user output
`3` view save

Test 28

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 3 2 1` view save

correct output
`3` view save

user output
`3` view save

Test 29

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 2 1 2` view save

correct output
`2` view save

user output
`2` view save

Datatähti 2020 loppu

Riippuliito

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Tasks

Submissions (Antti Paraoanu)