답안 #52405 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
52405	2018-06-25T22:08:32 Z	Kubalionzzale	커다란 상품 (IOI17_prize)	C++14	90 / 100	57 ms	948 KB

prize

#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;
        }


        while (1 && get[0] + get[1] != 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;
            }
        }


        bool flag = false;
        for (int i = 8; i >= 0; --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

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	248 KB	Output is correct
2	Correct	27 ms	532 KB	Output is correct
3	Correct	19 ms	532 KB	Output is correct
4	Correct	50 ms	644 KB	Output is correct
5	Correct	25 ms	644 KB	Output is correct
6	Correct	2 ms	644 KB	Output is correct
7	Correct	19 ms	660 KB	Output is correct
8	Correct	28 ms	660 KB	Output is correct
9	Correct	25 ms	660 KB	Output is correct
10	Correct	30 ms	700 KB	Output is correct

Subtask #2
70.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	700 KB	Output is correct
2	Correct	12 ms	704 KB	Output is correct
3	Correct	19 ms	704 KB	Output is correct
4	Correct	19 ms	788 KB	Output is correct
5	Correct	33 ms	788 KB	Output is correct
6	Correct	2 ms	788 KB	Output is correct
7	Correct	15 ms	788 KB	Output is correct
8	Correct	18 ms	788 KB	Output is correct
9	Correct	19 ms	788 KB	Output is correct
10	Correct	30 ms	788 KB	Output is correct
11	Correct	11 ms	788 KB	Output is correct
12	Correct	8 ms	788 KB	Output is correct
13	Correct	53 ms	788 KB	Output is correct
14	Correct	6 ms	788 KB	Output is correct
15	Correct	11 ms	788 KB	Output is correct
16	Correct	33 ms	788 KB	Output is correct
17	Correct	5 ms	788 KB	Output is correct
18	Partially correct	42 ms	828 KB	Partially correct - number of queries: 5021
19	Correct	3 ms	828 KB	Output is correct
20	Correct	11 ms	828 KB	Output is correct
21	Correct	14 ms	828 KB	Output is correct
22	Correct	9 ms	828 KB	Output is correct
23	Correct	8 ms	828 KB	Output is correct
24	Correct	3 ms	828 KB	Output is correct
25	Correct	35 ms	828 KB	Output is correct
26	Correct	34 ms	828 KB	Output is correct
27	Correct	15 ms	828 KB	Output is correct
28	Partially correct	55 ms	884 KB	Partially correct - number of queries: 6636
29	Partially correct	47 ms	884 KB	Partially correct - number of queries: 5585
30	Partially correct	33 ms	884 KB	Partially correct - number of queries: 5047
31	Correct	4 ms	884 KB	Output is correct
32	Correct	30 ms	884 KB	Output is correct
33	Correct	2 ms	884 KB	Output is correct
34	Correct	15 ms	884 KB	Output is correct
35	Correct	29 ms	884 KB	Output is correct
36	Correct	13 ms	884 KB	Output is correct
37	Correct	10 ms	884 KB	Output is correct
38	Correct	13 ms	884 KB	Output is correct
39	Correct	19 ms	884 KB	Output is correct
40	Correct	33 ms	884 KB	Output is correct
41	Correct	22 ms	884 KB	Output is correct
42	Correct	23 ms	884 KB	Output is correct
43	Correct	21 ms	884 KB	Output is correct
44	Correct	20 ms	884 KB	Output is correct
45	Correct	20 ms	884 KB	Output is correct
46	Correct	4 ms	884 KB	Output is correct
47	Correct	19 ms	884 KB	Output is correct
48	Correct	28 ms	884 KB	Output is correct
49	Correct	7 ms	884 KB	Output is correct
50	Correct	42 ms	884 KB	Output is correct
51	Correct	23 ms	884 KB	Output is correct
52	Correct	3 ms	884 KB	Output is correct
53	Correct	36 ms	884 KB	Output is correct
54	Correct	21 ms	884 KB	Output is correct
55	Correct	5 ms	884 KB	Output is correct
56	Partially correct	46 ms	884 KB	Partially correct - number of queries: 5015
57	Correct	31 ms	884 KB	Output is correct
58	Correct	20 ms	884 KB	Output is correct
59	Correct	28 ms	884 KB	Output is correct
60	Correct	12 ms	884 KB	Output is correct
61	Correct	41 ms	884 KB	Output is correct
62	Correct	11 ms	884 KB	Output is correct
63	Correct	38 ms	884 KB	Output is correct
64	Correct	29 ms	884 KB	Output is correct
65	Correct	19 ms	884 KB	Output is correct
66	Correct	22 ms	884 KB	Output is correct
67	Correct	46 ms	884 KB	Output is correct
68	Correct	5 ms	884 KB	Output is correct
69	Correct	48 ms	884 KB	Output is correct
70	Correct	36 ms	884 KB	Output is correct
71	Partially correct	33 ms	948 KB	Partially correct - number of queries: 6297
72	Correct	35 ms	948 KB	Output is correct
73	Partially correct	44 ms	948 KB	Partially correct - number of queries: 6266
74	Partially correct	47 ms	948 KB	Partially correct - number of queries: 6280
75	Correct	34 ms	948 KB	Output is correct
76	Partially correct	49 ms	948 KB	Partially correct - number of queries: 6001
77	Partially correct	39 ms	948 KB	Partially correct - number of queries: 6526
78	Correct	33 ms	948 KB	Output is correct
79	Partially correct	49 ms	948 KB	Partially correct - number of queries: 5326
80	Partially correct	57 ms	948 KB	Partially correct - number of queries: 6532
81	Partially correct	49 ms	948 KB	Partially correct - number of queries: 6505
82	Partially correct	55 ms	948 KB	Partially correct - number of queries: 6501
83	Correct	32 ms	948 KB	Output is correct
84	Partially correct	48 ms	948 KB	Partially correct - number of queries: 6070
85	Partially correct	45 ms	948 KB	Partially correct - number of queries: 6495
86	Correct	34 ms	948 KB	Output is correct
87	Correct	28 ms	948 KB	Output is correct
88	Correct	18 ms	948 KB	Output is correct
89	Correct	40 ms	948 KB	Output is correct
90	Correct	44 ms	948 KB	Output is correct
91	Correct	44 ms	948 KB	Output is correct
92	Correct	18 ms	948 KB	Output is correct
93	Correct	30 ms	948 KB	Output is correct
94	Correct	44 ms	948 KB	Output is correct
95	Correct	47 ms	948 KB	Output is correct
96	Correct	21 ms	948 KB	Output is correct
97	Correct	32 ms	948 KB	Output is correct

답안 #52405

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 70.0 / 80.0

Subtask #1
20.0 / 20.0

Subtask #2
70.0 / 80.0