oj.uz

Submission #52414

# Submission time Handle Problem Language Result Execution time Memory
52414 2018-06-25T22:22:44 Z Kubalionzzale The Big Prize (IOI17_prize) C++14
90 / 100
 66 ms 940 KB 
#include "prize.h"

#include <algorithm>
#include <set>
#include <map>

std::map<int, int> mapa;
//first - sum
//second - left

int find_best(int n) {

    if (n <= 500)
    {
        std::vector<int> get;
        for (int i = 0; i < n; ++i)
        {
            get = ask(i);

            if (get[0] == 0 && get[1] == 0)
            {
                return i;
            }
        }
    }


    int max = 0;
    std::vector<int> get;
    std::map<int, std::pair<int, int> > askedBig;
    for (int i = 0; i < 500; ++i)
    {
        get = ask(i);
        if (get[0] + get[1] > max)
        {
            max = get[0] + get[1];
        }
        if (get[0] == 0 && get[1] == 0)
        {
            return i;
        }

        int sum = get[0] + get[1];
        if (mapa.find(sum) == mapa.end())
        {
            mapa.insert(std::make_pair(sum, 0));
        }
        else
        {
            mapa[sum] = get[0];
        }
    }

    int cur = 499;
    while (1)
    {

        if (askedBig.find(cur) != askedBig.end())
        {
            get[0] = askedBig[cur].first;
            get[1] = askedBig[cur].second;
        }
        else
        {
            get = ask(cur);
            askedBig.insert(std::make_pair(cur, std::make_pair(get[0], get[1])));
        }

        if (get[0] == 0 && get[1] == 0)
        {
            return cur;
        }


        int s = get[0] + get[1];
        while (1 && s != max)
        {
            if (askedBig.find(cur + 1) != askedBig.end())
            {
                get[0] = askedBig[cur + 1].first;
                get[1] = askedBig[cur + 1].second;
            }
            else
            {
                get = ask(cur + 1);
                askedBig.insert(std::make_pair(cur + 1, std::make_pair(get[0], get[1])));
            }

            int inner = get[0] + get[1];
            if (inner == 0)
            {
                return cur + 1;
            }
            else if (inner != max)
            {
                mapa[inner] = get[0];
                ++cur;
            }
            else
            {
                mapa[inner] = get[0];
                break;
            }
        }

        int curs = 1 << 11;
        curs = std::min(n - 1, curs + cur);
        if (askedBig.find(curs) != askedBig.end())
        {
            get[0] = askedBig[curs].first;
            get[1] = askedBig[curs].second;
        }
        else
        {
            get = ask(curs);
            askedBig.insert(std::make_pair(curs, std::make_pair(get[0], get[1])));
        }

        int sum = get[0] + get[1];

        if (get[0] == 0 && get[1] == 0)
        {
            return curs;
        }

        bool flag2 = false;
        if (mapa.find(sum) == mapa.end())
            flag2 = true;
        if (get[0] > mapa[sum])
            flag2 = true;

        if (get[0] == 0 && sum != max)
        {
            mapa.insert(std::make_pair(sum, 0));

            cur = curs;
        }
        else if (get[0] == mapa[sum] && sum != max)
        {
            cur = curs;
        }
        else if (mapa.find(sum) == mapa.end())
        {
            flag2 = true;
        }
        else if (get[0] > mapa[sum])
        {
            flag2 = true;
        }
        else
        {
            cur = curs;
        }

        bool flag = false;
        for (int i = 10; i >= 0 && flag2; --i)
        {
            int nr = 1 << i;
            int toAsk = std::min(cur + nr, n - 1);

            if (askedBig.find(toAsk) != askedBig.end())
            {
                get[0] = askedBig[toAsk].first;
                get[1] = askedBig[toAsk].second;
            }
            else
            {
                get = ask(toAsk);
                askedBig.insert(std::make_pair(toAsk, std::make_pair(get[0], get[1])));
            }


            int sum = get[0] + get[1];

            if (get[0] == 0 && get[1] == 0)
            {
                return toAsk;
            }

            if (get[0] == 0 && sum != max)
            {
                mapa.insert(std::make_pair(sum, 0));

                cur = toAsk;
                flag = true;
                break;
            }
            else if (mapa.find(sum) == mapa.end())
            {
                continue;
            }
            else if (get[0] > mapa[sum])
            {
                continue;
            }
            else if (get[0] == mapa[sum] && sum != max)
            {
                cur = toAsk;
                flag = true;
                break;
            }
            else
            {
                cur = toAsk;
            }
        }

        if (!flag)
            ++cur;
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 248 KB Output is correct
2 Correct 6 ms 308 KB Output is correct
3 Correct 7 ms 388 KB Output is correct
4 Correct 10 ms 388 KB Output is correct
5 Correct 6 ms 388 KB Output is correct
6 Correct 2 ms 388 KB Output is correct
7 Correct 5 ms 388 KB Output is correct
8 Correct 5 ms 436 KB Output is correct
9 Correct 6 ms 436 KB Output is correct
10 Correct 6 ms 452 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 452 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 4 ms 496 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 6 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 5 ms 560 KB Output is correct
8 Correct 6 ms 560 KB Output is correct
9 Correct 6 ms 560 KB Output is correct
10 Correct 7 ms 572 KB Output is correct
11 Correct 6 ms 572 KB Output is correct
12 Correct 5 ms 572 KB Output is correct
13 Correct 10 ms 572 KB Output is correct
14 Correct 7 ms 572 KB Output is correct
15 Correct 14 ms 604 KB Output is correct
16 Partially correct 22 ms 852 KB Partially correct - number of queries: 5394
17 Correct 7 ms 852 KB Output is correct
18 Partially correct 66 ms 852 KB Partially correct - number of queries: 6431
19 Correct 6 ms 852 KB Output is correct
20 Correct 22 ms 852 KB Output is correct
21 Correct 23 ms 852 KB Output is correct
22 Correct 11 ms 852 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 42 ms 852 KB Output is correct
26 Correct 38 ms 852 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Partially correct 51 ms 852 KB Partially correct - number of queries: 5972
29 Correct 36 ms 852 KB Output is correct
30 Partially correct 49 ms 928 KB Partially correct - number of queries: 6445
31 Correct 6 ms 928 KB Output is correct
32 Correct 7 ms 928 KB Output is correct
33 Correct 1 ms 928 KB Output is correct
34 Correct 28 ms 928 KB Output is correct
35 Correct 7 ms 928 KB Output is correct
36 Correct 15 ms 928 KB Output is correct
37 Correct 6 ms 928 KB Output is correct
38 Correct 5 ms 928 KB Output is correct
39 Correct 25 ms 928 KB Output is correct
40 Partially correct 28 ms 928 KB Partially correct - number of queries: 5447
41 Correct 38 ms 928 KB Output is correct
42 Correct 30 ms 928 KB Output is correct
43 Correct 28 ms 928 KB Output is correct
44 Correct 19 ms 928 KB Output is correct
45 Correct 19 ms 928 KB Output is correct
46 Correct 3 ms 928 KB Output is correct
47 Correct 27 ms 928 KB Output is correct
48 Correct 35 ms 928 KB Output is correct
49 Correct 9 ms 928 KB Output is correct
50 Partially correct 32 ms 928 KB Partially correct - number of queries: 6358
51 Correct 25 ms 928 KB Output is correct
52 Correct 5 ms 928 KB Output is correct
53 Correct 6 ms 928 KB Output is correct
54 Correct 12 ms 928 KB Output is correct
55 Correct 4 ms 928 KB Output is correct
56 Partially correct 55 ms 928 KB Partially correct - number of queries: 6425
57 Correct 53 ms 928 KB Output is correct
58 Correct 46 ms 928 KB Output is correct
59 Correct 32 ms 928 KB Output is correct
60 Correct 26 ms 928 KB Output is correct
61 Correct 8 ms 928 KB Output is correct
62 Correct 5 ms 928 KB Output is correct
63 Correct 6 ms 928 KB Output is correct
64 Correct 8 ms 928 KB Output is correct
65 Correct 6 ms 928 KB Output is correct
66 Correct 10 ms 928 KB Output is correct
67 Correct 6 ms 928 KB Output is correct
68 Correct 4 ms 928 KB Output is correct
69 Correct 10 ms 928 KB Output is correct
70 Correct 4 ms 928 KB Output is correct
71 Partially correct 42 ms 928 KB Partially correct - number of queries: 6159
72 Correct 9 ms 928 KB Output is correct
73 Partially correct 49 ms 928 KB Partially correct - number of queries: 6075
74 Partially correct 47 ms 928 KB Partially correct - number of queries: 6111
75 Correct 7 ms 928 KB Output is correct
76 Partially correct 24 ms 940 KB Partially correct - number of queries: 5291
77 Partially correct 49 ms 940 KB Partially correct - number of queries: 6392
78 Correct 9 ms 940 KB Output is correct
79 Correct 13 ms 940 KB Output is correct
80 Partially correct 40 ms 940 KB Partially correct - number of queries: 6356
81 Partially correct 50 ms 940 KB Partially correct - number of queries: 6322
82 Partially correct 41 ms 940 KB Partially correct - number of queries: 6288
83 Correct 7 ms 940 KB Output is correct
84 Partially correct 38 ms 940 KB Partially correct - number of queries: 5246
85 Partially correct 26 ms 940 KB Partially correct - number of queries: 6336
86 Correct 7 ms 940 KB Output is correct
87 Correct 4 ms 940 KB Output is correct
88 Correct 6 ms 940 KB Output is correct
89 Correct 6 ms 940 KB Output is correct
90 Correct 10 ms 940 KB Output is correct
91 Correct 9 ms 940 KB Output is correct
92 Correct 8 ms 940 KB Output is correct
93 Correct 10 ms 940 KB Output is correct
94 Correct 8 ms 940 KB Output is correct
95 Correct 8 ms 940 KB Output is correct
96 Correct 12 ms 940 KB Output is correct
97 Correct 6 ms 940 KB Output is correct