답안 #1030990

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1030990	2024-07-22T13:16:55 Z	coolboy19521	커다란 상품 (IOI17_prize)	C++17	99.72 / 100	35 ms	6228 KB

prize

#include "prize.h"
#include "iostream"
 
using namespace std;

const int sz = 2e5 + 10;

vector<int> bf[sz];
int ft[sz];
int N;

void inc(int v) {
    for (; v <= N; v += v & -v)
        ft[v] ++;
}

int sum(int le, int ri) {
    le --;
    int ql = 0;
    for (; 0 < le; le -= le & -le)
        ql += ft[le];
    int qr = 0;
    for (; 0 < ri; ri -= ri & -ri)
        qr += ft[ri];
    return qr - ql;
}

vector<int> Ask(int x) {
    if (bf[x].size()) return bf[x];
    return bf[x] = ask(x);
}
 
int find_best(int n) {
    N = n;
    int mx = 0, xx = 600;
    for (int i = 0; i < min(n, 600); i ++) {
        auto pr = Ask(i);
        mx = max(mx, pr[0] + pr[1]);
        if (0 == pr[0] + pr[1]) return i;
        if (30 < mx) {
            xx = i + 1;
            break;
        }
        inc(i + 1);
    }
    int ls = xx;
    while (ls < n) {
        int ps;
        for (; ls < n; ls ++) {
            auto pr = Ask(ls);
            int sm = pr[0] + pr[1];
            if (0 == sm) return ls;
            if (sm == mx) {
                ps = pr[1];
                break;
            }
            inc(ls + 1);
        }
        int ds = xx;
        int rs = n;
        while (1 < rs - ds) {
            int mi = (ds + rs) / 2;
            if (mi <= ls) {
                ds = mi;
                continue;
            }
            if (sum(ls + 1, mi + 1)) {
                rs = mi;
                continue;
            }
            auto pr = Ask(mi);
            int sm = pr[0] + pr[1];
            if (0 == sm) return mi;
            if (sm != mx) {
                inc(mi + 1);
                rs = mi;
            }
            if (0 == ps - pr[1]) ds = mi;
            else rs = mi;
        }
        ls = ds + 1;
    }
    return 0;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:78:13: warning: 'ps' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |             if (0 == ps - pr[1]) ds = mi;
      |             ^~

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	4952 KB	Output is correct
2	Correct	7 ms	5208 KB	Output is correct
3	Correct	4 ms	5208 KB	Output is correct
4	Correct	6 ms	4952 KB	Output is correct
5	Correct	4 ms	5184 KB	Output is correct
6	Correct	2 ms	4952 KB	Output is correct
7	Correct	6 ms	5164 KB	Output is correct
8	Correct	5 ms	4952 KB	Output is correct
9	Correct	4 ms	4948 KB	Output is correct
10	Correct	5 ms	4952 KB	Output is correct

Subtask #2

79.72 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	4952 KB	Output is correct
2	Correct	6 ms	4952 KB	Output is correct
3	Correct	6 ms	5184 KB	Output is correct
4	Correct	4 ms	4952 KB	Output is correct
5	Correct	5 ms	4952 KB	Output is correct
6	Correct	2 ms	4952 KB	Output is correct
7	Correct	5 ms	5208 KB	Output is correct
8	Correct	5 ms	4952 KB	Output is correct
9	Correct	4 ms	5128 KB	Output is correct
10	Correct	3 ms	4952 KB	Output is correct
11	Correct	3 ms	5208 KB	Output is correct
12	Correct	2 ms	4952 KB	Output is correct
13	Correct	4 ms	5720 KB	Output is correct
14	Correct	3 ms	4952 KB	Output is correct
15	Correct	5 ms	5136 KB	Output is correct
16	Correct	13 ms	5712 KB	Output is correct
17	Correct	2 ms	4952 KB	Output is correct
18	Correct	26 ms	6144 KB	Output is correct
19	Correct	2 ms	4952 KB	Output is correct
20	Correct	6 ms	5208 KB	Output is correct
21	Correct	11 ms	5464 KB	Output is correct
22	Correct	4 ms	5208 KB	Output is correct
23	Correct	4 ms	5176 KB	Output is correct
24	Correct	2 ms	4952 KB	Output is correct
25	Correct	19 ms	5576 KB	Output is correct
26	Correct	11 ms	5492 KB	Output is correct
27	Correct	5 ms	5208 KB	Output is correct
28	Correct	22 ms	5968 KB	Output is correct
29	Correct	13 ms	5712 KB	Output is correct
30	Correct	35 ms	6016 KB	Output is correct
31	Correct	2 ms	4952 KB	Output is correct
32	Correct	5 ms	5208 KB	Output is correct
33	Correct	2 ms	4952 KB	Output is correct
34	Correct	10 ms	5388 KB	Output is correct
35	Correct	4 ms	5208 KB	Output is correct
36	Correct	7 ms	5208 KB	Output is correct
37	Correct	3 ms	5208 KB	Output is correct
38	Correct	5 ms	5208 KB	Output is correct
39	Correct	13 ms	5424 KB	Output is correct
40	Correct	15 ms	6000 KB	Output is correct
41	Correct	12 ms	5420 KB	Output is correct
42	Correct	15 ms	5464 KB	Output is correct
43	Correct	14 ms	5464 KB	Output is correct
44	Correct	12 ms	5456 KB	Output is correct
45	Correct	7 ms	5208 KB	Output is correct
46	Correct	2 ms	4952 KB	Output is correct
47	Correct	12 ms	5464 KB	Output is correct
48	Correct	16 ms	5568 KB	Output is correct
49	Correct	4 ms	5208 KB	Output is correct
50	Correct	30 ms	5804 KB	Output is correct
51	Correct	10 ms	5716 KB	Output is correct
52	Correct	2 ms	4952 KB	Output is correct
53	Correct	4 ms	5208 KB	Output is correct
54	Correct	13 ms	5464 KB	Output is correct
55	Correct	2 ms	4952 KB	Output is correct
56	Correct	32 ms	5968 KB	Output is correct
57	Correct	25 ms	5964 KB	Output is correct
58	Correct	18 ms	5752 KB	Output is correct
59	Correct	17 ms	5732 KB	Output is correct
60	Correct	18 ms	5616 KB	Output is correct
61	Correct	7 ms	5464 KB	Output is correct
62	Correct	6 ms	5496 KB	Output is correct
63	Correct	5 ms	5208 KB	Output is correct
64	Correct	5 ms	5208 KB	Output is correct
65	Correct	3 ms	4952 KB	Output is correct
66	Correct	4 ms	5204 KB	Output is correct
67	Correct	2 ms	4952 KB	Output is correct
68	Correct	3 ms	4952 KB	Output is correct
69	Correct	4 ms	5140 KB	Output is correct
70	Correct	3 ms	4952 KB	Output is correct
71	Correct	21 ms	5864 KB	Output is correct
72	Correct	4 ms	5464 KB	Output is correct
73	Correct	21 ms	6016 KB	Output is correct
74	Correct	30 ms	6228 KB	Output is correct
75	Correct	5 ms	5208 KB	Output is correct
76	Correct	30 ms	5864 KB	Output is correct
77	Partially correct	25 ms	5968 KB	Partially correct - number of queries: 5004
78	Correct	4 ms	5464 KB	Output is correct
79	Correct	17 ms	5864 KB	Output is correct
80	Correct	19 ms	5968 KB	Output is correct
81	Partially correct	21 ms	5968 KB	Partially correct - number of queries: 5028
82	Correct	22 ms	5984 KB	Output is correct
83	Correct	9 ms	5216 KB	Output is correct
84	Correct	31 ms	5968 KB	Output is correct
85	Correct	26 ms	6224 KB	Output is correct
86	Correct	4 ms	4952 KB	Output is correct
87	Correct	2 ms	4952 KB	Output is correct
88	Correct	4 ms	4952 KB	Output is correct
89	Correct	6 ms	4952 KB	Output is correct
90	Correct	4 ms	4952 KB	Output is correct
91	Correct	6 ms	4952 KB	Output is correct
92	Correct	7 ms	4952 KB	Output is correct
93	Correct	7 ms	5452 KB	Output is correct
94	Correct	8 ms	5208 KB	Output is correct
95	Correct	6 ms	5208 KB	Output is correct
96	Correct	5 ms	5208 KB	Output is correct
97	Correct	4 ms	4952 KB	Output is correct