oj.uz

Submission #105424

# Submission time Handle Problem Language Result Execution time Memory
105424 2019-04-12T08:43:19 Z Alexa2001 The Big Prize (IOI17_prize) C++17
20 / 100
 90 ms 2048 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> possible;
int rangMax;

pair<int,int> ans[200005];

int found = -1;


pair<int,int> query(int x)
{
    if(ans[x] != make_pair(-1, -1)) return ans[x];
    auto res = ask(x);
    ans[x] = {res[0], res[1]};
    return ans[x];
}

int rang(int x)
{
    return query(x).first + query(x).second;
}


void divide(int st, int dr, int outleft, int outright)
{
    if(found != -1) return;

    int mid = (st + dr) / 2, pos = mid;

    while(found == -1 && pos <= dr && rang(pos) != rangMax)
    {
        if(rang(pos) == 0) found = pos;
        ++pos;
    }

    if(pos <= dr && found == -1)
    {
        if(query(pos).second > outright)
            divide(pos+1, dr, query(pos).first, outright);

        if(query(pos).first > outleft + (pos - mid))
            divide(st, mid-1, outleft, query(pos).second + (pos - mid));

        return;
    }

    pos = mid;
    while(found == -1 && pos >= st && rang(pos) != rangMax)
    {
        if(rang(pos) == 0) found = pos;
        pos--;
    }

    if(found == -1 && pos >= st)
    {
        if(query(pos).first > outleft)
            divide(st, pos-1, outleft, query(pos).second);

        if(query(pos).second > outright + (mid - pos))
            divide(mid+1, dr, query(pos).first + (mid - pos), outright);

        return;
    }
}

int find_best(int n)
{
    int i;
    for(i=0; i<n; ++i) ans[i] = {-1, -1};

    for(i=0; i<450 && i<n; ++i)
        rangMax = max(rangMax, rang(i));

    divide(0, n-1, 0, 0);
    assert(found != -1);
    return found;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1920 KB Output is correct
2 Correct 5 ms 1960 KB Output is correct
3 Correct 5 ms 1912 KB Output is correct
4 Correct 5 ms 1844 KB Output is correct
5 Correct 6 ms 1920 KB Output is correct
6 Correct 8 ms 1784 KB Output is correct
7 Correct 7 ms 1784 KB Output is correct
8 Correct 9 ms 1932 KB Output is correct
9 Correct 5 ms 1856 KB Output is correct
10 Correct 7 ms 1920 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 8 ms 1912 KB Output is correct
3 Correct 5 ms 2040 KB Output is correct
4 Correct 5 ms 1912 KB Output is correct
5 Correct 5 ms 1912 KB Output is correct
6 Correct 10 ms 1784 KB Output is correct
7 Correct 7 ms 1792 KB Output is correct
8 Correct 7 ms 1784 KB Output is correct
9 Correct 5 ms 1912 KB Output is correct
10 Correct 9 ms 1792 KB Output is correct
11 Correct 9 ms 1792 KB Output is correct
12 Correct 11 ms 1792 KB Output is correct
13 Correct 5 ms 1848 KB Output is correct
14 Correct 16 ms 384 KB Output is correct
15 Correct 20 ms 1932 KB Output is correct
16 Correct 16 ms 1928 KB Output is correct
17 Correct 28 ms 1912 KB Output is correct
18 Correct 8 ms 1784 KB Output is correct
19 Correct 52 ms 1792 KB Output is correct
20 Correct 24 ms 1072 KB Output is correct
21 Correct 24 ms 1844 KB Output is correct
22 Correct 18 ms 1940 KB Output is correct
23 Correct 9 ms 1784 KB Output is correct
24 Correct 12 ms 1916 KB Output is correct
25 Correct 19 ms 1784 KB Output is correct
26 Correct 23 ms 1852 KB Output is correct
27 Correct 10 ms 1784 KB Output is correct
28 Correct 6 ms 1912 KB Output is correct
29 Correct 8 ms 1920 KB Output is correct
30 Correct 8 ms 1784 KB Output is correct
31 Correct 41 ms 1784 KB Output is correct
32 Correct 8 ms 1784 KB Output is correct
33 Correct 4 ms 256 KB Output is correct
34 Correct 23 ms 2040 KB Output is correct
35 Correct 5 ms 1848 KB Output is correct
36 Correct 46 ms 1856 KB Output is correct
37 Correct 8 ms 1784 KB Output is correct
38 Correct 5 ms 1912 KB Output is correct
39 Correct 15 ms 2048 KB Output is correct
40 Correct 7 ms 1784 KB Output is correct
41 Correct 20 ms 1932 KB Output is correct
42 Correct 15 ms 1940 KB Output is correct
43 Correct 20 ms 1820 KB Output is correct
44 Correct 25 ms 1912 KB Output is correct
45 Correct 26 ms 1832 KB Output is correct
46 Correct 32 ms 1784 KB Output is correct
47 Correct 15 ms 1912 KB Output is correct
48 Correct 10 ms 1852 KB Output is correct
49 Correct 37 ms 1848 KB Output is correct
50 Correct 10 ms 1784 KB Output is correct
51 Correct 15 ms 1912 KB Output is correct
52 Correct 55 ms 1852 KB Output is correct
53 Correct 8 ms 1804 KB Output is correct
54 Correct 31 ms 1920 KB Output is correct
55 Correct 21 ms 1844 KB Output is correct
56 Correct 9 ms 1792 KB Output is correct
57 Correct 15 ms 1912 KB Output is correct
58 Correct 14 ms 1788 KB Output is correct
59 Correct 15 ms 1912 KB Output is correct
60 Correct 22 ms 1808 KB Output is correct
61 Correct 8 ms 1848 KB Output is correct
62 Correct 9 ms 1920 KB Output is correct
63 Correct 9 ms 1832 KB Output is correct
64 Correct 5 ms 1936 KB Output is correct
65 Correct 6 ms 1928 KB Output is correct
66 Correct 9 ms 1784 KB Output is correct
67 Correct 13 ms 1784 KB Output is correct
68 Correct 6 ms 1932 KB Output is correct
69 Correct 9 ms 1800 KB Output is correct
70 Correct 6 ms 1920 KB Output is correct
71 Partially correct 40 ms 1920 KB Partially correct - number of queries: 5208
72 Correct 11 ms 1792 KB Output is correct
73 Partially correct 45 ms 1920 KB Partially correct - number of queries: 5145
74 Partially correct 53 ms 1792 KB Partially correct - number of queries: 5172
75 Correct 5 ms 1920 KB Output is correct
76 Correct 47 ms 1792 KB Output is correct
77 Correct 54 ms 1792 KB Output is correct
78 Correct 12 ms 1792 KB Output is correct
79 Correct 22 ms 2048 KB Output is correct
80 Correct 36 ms 1792 KB Output is correct
81 Correct 43 ms 1792 KB Output is correct
82 Correct 37 ms 1792 KB Output is correct
83 Correct 7 ms 1792 KB Output is correct
84 Correct 29 ms 1792 KB Output is correct
85 Correct 33 ms 1792 KB Output is correct
86 Incorrect 90 ms 1936 KB Incorrect
87 Halted 0 ms 0 KB -