oj.uz

Submission #662878

# Submission time Handle Problem Language Result Execution time Memory
662878 2022-11-26T13:08:32 Z BlancaHM The Big Prize (IOI17_prize) C++14
97.68 / 100
 48 ms 1948 KB 
#include "prize.h"
#include <vector>

using namespace std;

vector<pair<int, int>> preguntasHechas;
int totalInteresantes;

pair<int, int> preguntar(int i) {
    if (preguntasHechas[i].first == -1) {
        auto a = ask(i);
        preguntasHechas[i] = make_pair(a[0], a[1]);
    }
    return preguntasHechas[i];
}

int carosIzq(int i) {
    pair<int, int> v = preguntar(i);
    return v.first;
}

int carosDer(int i) {
    pair<int, int> v = preguntar(i);
    return v.second;
}

// limIzq contendrá lollipop
// buscamos el diamante en [limIzq, limDer]
// sabemos que en el intervalo hay numPremiosCaros (i.e. premios no lollipop)
int buscarDiamanteEnIntervalo(int limIzq, int limDer, int numPremiosCaros) {
    if (!numPremiosCaros) return -1;
    if (limDer-limIzq == numPremiosCaros) {
        // todas las posiciones aparte de limIzq contienen premio caro -> buscamos una a una por el diamante
        for (int i = limIzq+1; i <= limDer; i++) {
            preguntar(i);
            if (carosIzq(i) + carosDer(i) == 0) {
                return i;
            }
        }
        return -1;
    }
    int mid = limIzq + (limDer-limIzq)/2;
    int pos = mid;
    while(pos <= limDer) {
        if (carosIzq(pos) + carosDer(pos) == 0) {
            return pos;
        }
        if (carosIzq(pos) + carosDer(pos) == totalInteresantes) {
            break;
        }
        pos++;
    }
    if (pos == limDer+1) {
        // no hay lollipops en [mid, limDer]
        return buscarDiamanteEnIntervalo(limIzq, mid-1, numPremiosCaros - (limDer - mid + 1));
    } else {
        int diamante = buscarDiamanteEnIntervalo(limIzq, mid-1, carosIzq(pos) - carosIzq(limIzq) + mid - pos);
        if (diamante != -1) return diamante;
        return buscarDiamanteEnIntervalo(pos, limDer, numPremiosCaros - carosIzq(pos) + carosIzq(limIzq));
    }
}

int find_best(int n) {
    preguntasHechas.assign(n, make_pair(-1, -1));
    // buscamos el índice del primer lollipop
    int primerLollipop = 0;
    totalInteresantes = -1;
    for (int i = 0; i <= min(473, n-1); i++) {
        if (carosIzq(i) + carosDer(i) == 0) return i;
        if (carosIzq(i) + carosDer(i) > totalInteresantes) {
            primerLollipop = i;
            totalInteresantes = carosIzq(i) + carosDer(i);
            if (totalInteresantes >= 40) break;
        }
    }
    return buscarDiamanteEnIntervalo(primerLollipop, n-1, carosDer(primerLollipop));
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1828 KB Output is correct
2 Correct 3 ms 1824 KB Output is correct
3 Correct 5 ms 1872 KB Output is correct
4 Correct 3 ms 1828 KB Output is correct
5 Correct 3 ms 1872 KB Output is correct
6 Correct 1 ms 1872 KB Output is correct
7 Correct 6 ms 1804 KB Output is correct
8 Correct 6 ms 1828 KB Output is correct
9 Correct 5 ms 1828 KB Output is correct
10 Correct 6 ms 1872 KB Output is correct

Subtask #2
77.68 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1832 KB Output is correct
2 Correct 6 ms 1816 KB Output is correct
3 Correct 5 ms 1816 KB Output is correct
4 Correct 5 ms 1872 KB Output is correct
5 Correct 5 ms 1872 KB Output is correct
6 Correct 1 ms 1832 KB Output is correct
7 Correct 6 ms 1744 KB Output is correct
8 Correct 4 ms 1872 KB Output is correct
9 Correct 6 ms 1812 KB Output is correct
10 Correct 7 ms 1872 KB Output is correct
11 Correct 7 ms 1804 KB Output is correct
12 Correct 5 ms 1824 KB Output is correct
13 Correct 9 ms 1804 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Correct 9 ms 1824 KB Output is correct
16 Correct 21 ms 1808 KB Output is correct
17 Correct 3 ms 1808 KB Output is correct
18 Correct 36 ms 1816 KB Output is correct
19 Correct 2 ms 1804 KB Output is correct
20 Correct 12 ms 1060 KB Output is correct
21 Correct 17 ms 1816 KB Output is correct
22 Correct 5 ms 1824 KB Output is correct
23 Correct 10 ms 1820 KB Output is correct
24 Correct 6 ms 1828 KB Output is correct
25 Correct 24 ms 1836 KB Output is correct
26 Correct 20 ms 1816 KB Output is correct
27 Correct 5 ms 1824 KB Output is correct
28 Correct 27 ms 1808 KB Output is correct
29 Correct 34 ms 1736 KB Output is correct
30 Correct 42 ms 1828 KB Output is correct
31 Correct 1 ms 1872 KB Output is correct
32 Correct 10 ms 1832 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 6 ms 1872 KB Output is correct
35 Correct 3 ms 1948 KB Output is correct
36 Correct 10 ms 1828 KB Output is correct
37 Correct 6 ms 1816 KB Output is correct
38 Correct 3 ms 1804 KB Output is correct
39 Correct 16 ms 1736 KB Output is correct
40 Correct 37 ms 1820 KB Output is correct
41 Correct 28 ms 1872 KB Output is correct
42 Correct 28 ms 1872 KB Output is correct
43 Correct 19 ms 1784 KB Output is correct
44 Correct 15 ms 1828 KB Output is correct
45 Correct 13 ms 1828 KB Output is correct
46 Correct 1 ms 1808 KB Output is correct
47 Correct 16 ms 1816 KB Output is correct
48 Correct 27 ms 1872 KB Output is correct
49 Correct 6 ms 1872 KB Output is correct
50 Correct 45 ms 1872 KB Output is correct
51 Correct 19 ms 1872 KB Output is correct
52 Correct 1 ms 1808 KB Output is correct
53 Correct 6 ms 1820 KB Output is correct
54 Correct 13 ms 1736 KB Output is correct
55 Correct 1 ms 1872 KB Output is correct
56 Correct 28 ms 1808 KB Output is correct
57 Correct 30 ms 1872 KB Output is correct
58 Correct 33 ms 1832 KB Output is correct
59 Correct 26 ms 1736 KB Output is correct
60 Correct 19 ms 1872 KB Output is correct
61 Correct 6 ms 1872 KB Output is correct
62 Correct 5 ms 1832 KB Output is correct
63 Correct 5 ms 1736 KB Output is correct
64 Correct 4 ms 1820 KB Output is correct
65 Correct 4 ms 1872 KB Output is correct
66 Correct 4 ms 1816 KB Output is correct
67 Correct 5 ms 1872 KB Output is correct
68 Correct 4 ms 1828 KB Output is correct
69 Correct 5 ms 1828 KB Output is correct
70 Correct 3 ms 1828 KB Output is correct
71 Partially correct 37 ms 1872 KB Partially correct - number of queries: 5232
72 Correct 7 ms 1872 KB Output is correct
73 Partially correct 37 ms 1872 KB Partially correct - number of queries: 5162
74 Partially correct 48 ms 1796 KB Partially correct - number of queries: 5192
75 Correct 6 ms 1872 KB Output is correct
76 Correct 31 ms 1872 KB Output is correct
77 Correct 33 ms 1872 KB Output is correct
78 Correct 9 ms 1872 KB Output is correct
79 Correct 21 ms 1832 KB Output is correct
80 Correct 35 ms 1872 KB Output is correct
81 Correct 33 ms 1744 KB Output is correct
82 Correct 37 ms 1872 KB Output is correct
83 Correct 5 ms 1872 KB Output is correct
84 Correct 19 ms 1828 KB Output is correct
85 Correct 34 ms 1872 KB Output is correct
86 Correct 6 ms 1872 KB Output is correct
87 Correct 6 ms 1872 KB Output is correct
88 Correct 6 ms 1872 KB Output is correct
89 Correct 6 ms 1872 KB Output is correct
90 Correct 5 ms 1828 KB Output is correct
91 Correct 4 ms 1872 KB Output is correct
92 Correct 5 ms 1872 KB Output is correct
93 Correct 9 ms 1872 KB Output is correct
94 Correct 7 ms 1872 KB Output is correct
95 Correct 8 ms 1872 KB Output is correct
96 Correct 8 ms 1872 KB Output is correct
97 Correct 3 ms 1872 KB Output is correct