답안 #52422 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
52422	2018-06-25T22:33:54 Z	Kubalionzzale	커다란 상품 (IOI17_prize)	C++14	20 / 100	114 ms	1076 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 < 472; ++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 = 471;
    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	9 ms	376 KB	Output is correct
2	Correct	17 ms	516 KB	Output is correct
3	Correct	14 ms	516 KB	Output is correct
4	Correct	19 ms	664 KB	Output is correct
5	Correct	17 ms	664 KB	Output is correct
6	Correct	2 ms	664 KB	Output is correct
7	Correct	14 ms	664 KB	Output is correct
8	Correct	13 ms	664 KB	Output is correct
9	Correct	13 ms	664 KB	Output is correct
10	Correct	30 ms	664 KB	Output is correct

Subtask #2
0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	664 KB	Output is correct
2	Correct	23 ms	664 KB	Output is correct
3	Correct	23 ms	664 KB	Output is correct
4	Correct	27 ms	664 KB	Output is correct
5	Correct	12 ms	664 KB	Output is correct
6	Correct	2 ms	664 KB	Output is correct
7	Correct	16 ms	664 KB	Output is correct
8	Correct	15 ms	664 KB	Output is correct
9	Correct	17 ms	664 KB	Output is correct
10	Correct	28 ms	664 KB	Output is correct
11	Correct	12 ms	664 KB	Output is correct
12	Correct	7 ms	664 KB	Output is correct
13	Correct	11 ms	688 KB	Output is correct
14	Correct	8 ms	688 KB	Output is correct
15	Correct	6 ms	688 KB	Output is correct
16	Correct	50 ms	736 KB	Output is correct
17	Correct	5 ms	736 KB	Output is correct
18	Partially correct	55 ms	948 KB	Partially correct - number of queries: 5465
19	Correct	4 ms	948 KB	Output is correct
20	Correct	19 ms	948 KB	Output is correct
21	Correct	22 ms	948 KB	Output is correct
22	Correct	11 ms	948 KB	Output is correct
23	Correct	11 ms	948 KB	Output is correct
24	Correct	3 ms	948 KB	Output is correct
25	Correct	44 ms	948 KB	Output is correct
26	Correct	30 ms	948 KB	Output is correct
27	Correct	13 ms	948 KB	Output is correct
28	Partially correct	46 ms	948 KB	Partially correct - number of queries: 5579
29	Correct	39 ms	948 KB	Output is correct
30	Partially correct	52 ms	948 KB	Partially correct - number of queries: 5489
31	Correct	6 ms	948 KB	Output is correct
32	Correct	23 ms	948 KB	Output is correct
33	Correct	2 ms	948 KB	Output is correct
34	Correct	26 ms	948 KB	Output is correct
35	Correct	10 ms	948 KB	Output is correct
36	Correct	19 ms	948 KB	Output is correct
37	Correct	9 ms	948 KB	Output is correct
38	Correct	10 ms	948 KB	Output is correct
39	Correct	34 ms	948 KB	Output is correct
40	Correct	54 ms	948 KB	Output is correct
41	Correct	26 ms	948 KB	Output is correct
42	Correct	37 ms	948 KB	Output is correct
43	Correct	35 ms	948 KB	Output is correct
44	Correct	27 ms	948 KB	Output is correct
45	Correct	27 ms	948 KB	Output is correct
46	Correct	6 ms	948 KB	Output is correct
47	Correct	34 ms	948 KB	Output is correct
48	Correct	47 ms	948 KB	Output is correct
49	Correct	13 ms	948 KB	Output is correct
50	Partially correct	49 ms	948 KB	Partially correct - number of queries: 5392
51	Correct	30 ms	948 KB	Output is correct
52	Correct	9 ms	948 KB	Output is correct
53	Correct	18 ms	948 KB	Output is correct
54	Correct	19 ms	948 KB	Output is correct
55	Correct	5 ms	948 KB	Output is correct
56	Partially correct	37 ms	948 KB	Partially correct - number of queries: 5459
57	Correct	32 ms	948 KB	Output is correct
58	Correct	33 ms	948 KB	Output is correct
59	Correct	27 ms	948 KB	Output is correct
60	Correct	13 ms	948 KB	Output is correct
61	Correct	27 ms	948 KB	Output is correct
62	Correct	6 ms	948 KB	Output is correct
63	Correct	22 ms	948 KB	Output is correct
64	Correct	8 ms	948 KB	Output is correct
65	Correct	20 ms	948 KB	Output is correct
66	Correct	26 ms	948 KB	Output is correct
67	Correct	26 ms	948 KB	Output is correct
68	Correct	5 ms	948 KB	Output is correct
69	Correct	32 ms	948 KB	Output is correct
70	Correct	21 ms	948 KB	Output is correct
71	Partially correct	45 ms	948 KB	Partially correct - number of queries: 5193
72	Correct	21 ms	948 KB	Output is correct
73	Partially correct	23 ms	960 KB	Partially correct - number of queries: 5123
74	Partially correct	45 ms	960 KB	Partially correct - number of queries: 5153
75	Correct	13 ms	960 KB	Output is correct
76	Correct	51 ms	960 KB	Output is correct
77	Partially correct	39 ms	960 KB	Partially correct - number of queries: 5382
78	Correct	24 ms	960 KB	Output is correct
79	Correct	24 ms	960 KB	Output is correct
80	Partially correct	44 ms	960 KB	Partially correct - number of queries: 5398
81	Partially correct	33 ms	960 KB	Partially correct - number of queries: 5403
82	Partially correct	38 ms	972 KB	Partially correct - number of queries: 5324
83	Correct	22 ms	972 KB	Output is correct
84	Correct	34 ms	972 KB	Output is correct
85	Partially correct	35 ms	972 KB	Partially correct - number of queries: 5362
86	Incorrect	114 ms	1076 KB	Incorrect
87	Halted	0 ms	0 KB	-

답안 #52422

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 0 / 80.0

Subtask #1
20.0 / 20.0

Subtask #2
0 / 80.0