답안 #52415 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
52415	2018-06-25T22:23:53 Z	Kubalionzzale	커다란 상품 (IOI17_prize)	C++14	93.92 / 100	60 ms	856 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;
        }


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


        bool flag = false;
        for (int i = 9; 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	8 ms	376 KB	Output is correct
2	Correct	9 ms	520 KB	Output is correct
3	Correct	17 ms	520 KB	Output is correct
4	Correct	26 ms	572 KB	Output is correct
5	Correct	9 ms	580 KB	Output is correct
6	Correct	2 ms	580 KB	Output is correct
7	Correct	14 ms	580 KB	Output is correct
8	Correct	13 ms	580 KB	Output is correct
9	Correct	15 ms	580 KB	Output is correct
10	Correct	23 ms	580 KB	Output is correct

Subtask #2
73.92 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	580 KB	Output is correct
2	Correct	16 ms	636 KB	Output is correct
3	Correct	21 ms	636 KB	Output is correct
4	Correct	22 ms	636 KB	Output is correct
5	Correct	13 ms	636 KB	Output is correct
6	Correct	2 ms	636 KB	Output is correct
7	Correct	10 ms	636 KB	Output is correct
8	Correct	13 ms	636 KB	Output is correct
9	Correct	13 ms	652 KB	Output is correct
10	Correct	19 ms	652 KB	Output is correct
11	Correct	9 ms	652 KB	Output is correct
12	Correct	5 ms	652 KB	Output is correct
13	Correct	24 ms	652 KB	Output is correct
14	Correct	6 ms	652 KB	Output is correct
15	Correct	11 ms	656 KB	Output is correct
16	Correct	43 ms	780 KB	Output is correct
17	Correct	6 ms	780 KB	Output is correct
18	Partially correct	49 ms	780 KB	Partially correct - number of queries: 5492
19	Correct	7 ms	780 KB	Output is correct
20	Correct	20 ms	780 KB	Output is correct
21	Correct	21 ms	780 KB	Output is correct
22	Correct	6 ms	780 KB	Output is correct
23	Correct	9 ms	780 KB	Output is correct
24	Correct	7 ms	780 KB	Output is correct
25	Correct	28 ms	780 KB	Output is correct
26	Correct	40 ms	780 KB	Output is correct
27	Correct	12 ms	780 KB	Output is correct
28	Partially correct	46 ms	832 KB	Partially correct - number of queries: 5608
29	Correct	60 ms	832 KB	Output is correct
30	Partially correct	50 ms	832 KB	Partially correct - number of queries: 5514
31	Correct	5 ms	832 KB	Output is correct
32	Correct	17 ms	832 KB	Output is correct
33	Correct	2 ms	832 KB	Output is correct
34	Correct	20 ms	832 KB	Output is correct
35	Correct	15 ms	832 KB	Output is correct
36	Correct	18 ms	832 KB	Output is correct
37	Correct	9 ms	832 KB	Output is correct
38	Correct	4 ms	832 KB	Output is correct
39	Correct	26 ms	832 KB	Output is correct
40	Correct	52 ms	848 KB	Output is correct
41	Correct	41 ms	848 KB	Output is correct
42	Correct	27 ms	848 KB	Output is correct
43	Correct	25 ms	848 KB	Output is correct
44	Correct	16 ms	848 KB	Output is correct
45	Correct	21 ms	848 KB	Output is correct
46	Correct	6 ms	848 KB	Output is correct
47	Correct	23 ms	848 KB	Output is correct
48	Correct	35 ms	848 KB	Output is correct
49	Correct	8 ms	848 KB	Output is correct
50	Partially correct	33 ms	856 KB	Partially correct - number of queries: 5419
51	Correct	21 ms	856 KB	Output is correct
52	Correct	4 ms	856 KB	Output is correct
53	Correct	20 ms	856 KB	Output is correct
54	Correct	11 ms	856 KB	Output is correct
55	Correct	5 ms	856 KB	Output is correct
56	Partially correct	40 ms	856 KB	Partially correct - number of queries: 5486
57	Correct	35 ms	856 KB	Output is correct
58	Correct	46 ms	856 KB	Output is correct
59	Correct	38 ms	856 KB	Output is correct
60	Correct	35 ms	856 KB	Output is correct
61	Correct	16 ms	856 KB	Output is correct
62	Correct	5 ms	856 KB	Output is correct
63	Correct	20 ms	856 KB	Output is correct
64	Correct	22 ms	856 KB	Output is correct
65	Correct	23 ms	856 KB	Output is correct
66	Correct	27 ms	856 KB	Output is correct
67	Correct	21 ms	856 KB	Output is correct
68	Correct	4 ms	856 KB	Output is correct
69	Correct	23 ms	856 KB	Output is correct
70	Correct	21 ms	856 KB	Output is correct
71	Partially correct	39 ms	856 KB	Partially correct - number of queries: 5221
72	Correct	31 ms	856 KB	Output is correct
73	Partially correct	56 ms	856 KB	Partially correct - number of queries: 5151
74	Partially correct	24 ms	856 KB	Partially correct - number of queries: 5181
75	Correct	28 ms	856 KB	Output is correct
76	Correct	38 ms	856 KB	Output is correct
77	Partially correct	58 ms	856 KB	Partially correct - number of queries: 5431
78	Correct	20 ms	856 KB	Output is correct
79	Correct	31 ms	856 KB	Output is correct
80	Partially correct	53 ms	856 KB	Partially correct - number of queries: 5415
81	Partially correct	47 ms	856 KB	Partially correct - number of queries: 5399
82	Partially correct	31 ms	856 KB	Partially correct - number of queries: 5323
83	Correct	25 ms	856 KB	Output is correct
84	Correct	34 ms	856 KB	Output is correct
85	Partially correct	42 ms	856 KB	Partially correct - number of queries: 5384
86	Correct	29 ms	856 KB	Output is correct
87	Correct	13 ms	856 KB	Output is correct
88	Correct	23 ms	856 KB	Output is correct
89	Correct	21 ms	856 KB	Output is correct
90	Correct	29 ms	856 KB	Output is correct
91	Correct	18 ms	856 KB	Output is correct
92	Correct	21 ms	856 KB	Output is correct
93	Correct	23 ms	856 KB	Output is correct
94	Correct	17 ms	856 KB	Output is correct
95	Correct	23 ms	856 KB	Output is correct
96	Correct	31 ms	856 KB	Output is correct
97	Correct	24 ms	856 KB	Output is correct

답안 #52415

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 73.92 / 80.0

Subtask #1
20.0 / 20.0

Subtask #2
73.92 / 80.0