답안 #52384 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
52384	2018-06-25T17:19:26 Z	WLZ	커다란 상품 (IOI17_prize)	C++17	100 / 100	54 ms	956 KB

prize

#include "prize.h"
#include <vector>
#include <stack>
#include <utility>
#include <map>

std::map<int, std::map<int, std::pair<int, int> > > mp;

int find_best(int n) {
    std::stack< std::pair<int, int> > st;
    st.emplace(0, n - 1);
    while (!st.empty()) {
        int lo = st.top().first;
        int hi = st.top().second;
        st.pop();
        int mid = (lo + hi) / 2;
        std::vector<int> q = ask(mid);
        int l = q[0], r = q[1];
        // the same type nodes are mp[l+r], key in mp[l+r] is the possible possition
        // sort mp[l+r]'s key using upper_bound to find the first position that is after mid
        // if for that position p1, r[p1] == r[mid], then we know we don't need push right interval
        // upper_bound -1 is the position that is before or equal to mid
        // if for that position p2, l[p2] == l[mid], then we know we don't need push left interval
        auto rIt = mp[l + r].upper_bound(mid);

        bool processLeft = true, processRight = true;
        if (!(rIt == mp[l + r].begin())) {
            // check if left interval can be ignored
            auto lIt = rIt; --lIt;
            if (lIt->second.first == l) {
                processLeft = false;
            }
        }
        if ((!(rIt == mp[l + r].end()) && rIt->second.second == r)||(r == 0)) {
            processRight = false;
        }

        
        mp[l + r][mid] = {l, r};
        if (l == 0 && r == 0) return mid;
        if (l == 0) st = std::stack< std::pair<int, int> >();
        if (lo != mid && processLeft) st.emplace(lo, mid - 1);
        if (hi != mid && processRight) st.emplace(mid + 1, hi);
    }
	return 0;
}

Subtask #1
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	308 KB	Output is correct
3	Correct	2 ms	472 KB	Output is correct
4	Correct	4 ms	472 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	2 ms	484 KB	Output is correct
8	Correct	2 ms	488 KB	Output is correct
9	Correct	3 ms	488 KB	Output is correct
10	Correct	2 ms	504 KB	Output is correct

Subtask #2
80.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	532 KB	Output is correct
2	Correct	2 ms	532 KB	Output is correct
3	Correct	2 ms	532 KB	Output is correct
4	Correct	2 ms	532 KB	Output is correct
5	Correct	2 ms	532 KB	Output is correct
6	Correct	2 ms	532 KB	Output is correct
7	Correct	2 ms	532 KB	Output is correct
8	Correct	2 ms	532 KB	Output is correct
9	Correct	1 ms	556 KB	Output is correct
10	Correct	2 ms	556 KB	Output is correct
11	Correct	4 ms	572 KB	Output is correct
12	Correct	5 ms	572 KB	Output is correct
13	Correct	2 ms	572 KB	Output is correct
14	Correct	7 ms	572 KB	Output is correct
15	Correct	16 ms	788 KB	Output is correct
16	Correct	8 ms	788 KB	Output is correct
17	Correct	42 ms	808 KB	Output is correct
18	Correct	3 ms	808 KB	Output is correct
19	Correct	54 ms	828 KB	Output is correct
20	Correct	9 ms	828 KB	Output is correct
21	Correct	30 ms	828 KB	Output is correct
22	Correct	32 ms	828 KB	Output is correct
23	Correct	2 ms	828 KB	Output is correct
24	Correct	6 ms	828 KB	Output is correct
25	Correct	20 ms	828 KB	Output is correct
26	Correct	9 ms	828 KB	Output is correct
27	Correct	3 ms	828 KB	Output is correct
28	Correct	4 ms	828 KB	Output is correct
29	Correct	8 ms	828 KB	Output is correct
30	Correct	3 ms	828 KB	Output is correct
31	Correct	38 ms	828 KB	Output is correct
32	Correct	2 ms	828 KB	Output is correct
33	Correct	2 ms	828 KB	Output is correct
34	Correct	34 ms	828 KB	Output is correct
35	Correct	2 ms	828 KB	Output is correct
36	Correct	46 ms	828 KB	Output is correct
37	Correct	4 ms	828 KB	Output is correct
38	Correct	2 ms	828 KB	Output is correct
39	Correct	34 ms	828 KB	Output is correct
40	Correct	2 ms	828 KB	Output is correct
41	Correct	17 ms	828 KB	Output is correct
42	Correct	25 ms	828 KB	Output is correct
43	Correct	18 ms	828 KB	Output is correct
44	Correct	25 ms	828 KB	Output is correct
45	Correct	22 ms	828 KB	Output is correct
46	Correct	43 ms	828 KB	Output is correct
47	Correct	25 ms	828 KB	Output is correct
48	Correct	6 ms	828 KB	Output is correct
49	Correct	40 ms	828 KB	Output is correct
50	Correct	2 ms	828 KB	Output is correct
51	Correct	21 ms	828 KB	Output is correct
52	Correct	40 ms	828 KB	Output is correct
53	Correct	2 ms	828 KB	Output is correct
54	Correct	21 ms	828 KB	Output is correct
55	Correct	19 ms	844 KB	Output is correct
56	Correct	2 ms	844 KB	Output is correct
57	Correct	15 ms	844 KB	Output is correct
58	Correct	12 ms	844 KB	Output is correct
59	Correct	15 ms	844 KB	Output is correct
60	Correct	10 ms	844 KB	Output is correct
61	Correct	1 ms	844 KB	Output is correct
62	Correct	2 ms	844 KB	Output is correct
63	Correct	2 ms	844 KB	Output is correct
64	Correct	2 ms	844 KB	Output is correct
65	Correct	2 ms	844 KB	Output is correct
66	Correct	2 ms	844 KB	Output is correct
67	Correct	2 ms	844 KB	Output is correct
68	Correct	2 ms	844 KB	Output is correct
69	Correct	2 ms	844 KB	Output is correct
70	Correct	2 ms	844 KB	Output is correct
71	Correct	44 ms	844 KB	Output is correct
72	Correct	5 ms	844 KB	Output is correct
73	Correct	37 ms	844 KB	Output is correct
74	Correct	38 ms	956 KB	Output is correct
75	Correct	2 ms	956 KB	Output is correct
76	Correct	32 ms	956 KB	Output is correct
77	Correct	34 ms	956 KB	Output is correct
78	Correct	5 ms	956 KB	Output is correct
79	Correct	19 ms	956 KB	Output is correct
80	Correct	36 ms	956 KB	Output is correct
81	Correct	37 ms	956 KB	Output is correct
82	Correct	20 ms	956 KB	Output is correct
83	Correct	3 ms	956 KB	Output is correct
84	Correct	30 ms	956 KB	Output is correct
85	Correct	36 ms	956 KB	Output is correct
86	Correct	5 ms	956 KB	Output is correct
87	Correct	3 ms	956 KB	Output is correct
88	Correct	5 ms	956 KB	Output is correct
89	Correct	5 ms	956 KB	Output is correct
90	Correct	2 ms	956 KB	Output is correct
91	Correct	4 ms	956 KB	Output is correct
92	Correct	3 ms	956 KB	Output is correct
93	Correct	4 ms	956 KB	Output is correct
94	Correct	4 ms	956 KB	Output is correct
95	Correct	4 ms	956 KB	Output is correct
96	Correct	3 ms	956 KB	Output is correct
97	Correct	2 ms	956 KB	Output is correct

답안 #52384

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 80.0 / 80.0

Subtask #1
20.0 / 20.0

Subtask #2
80.0 / 80.0