oj.uz

답안 #105427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105427 2019-04-12T08:55:41 Z Alexa2001 커다란 상품 (IOI17_prize) C++17
20 / 100
 49 ms 3576 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

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(found != -1) return;

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

        if(found != -1) return;

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

        return;
    }


    if(found != -1) return;

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

    if(found != -1) return;

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

        if(found != -1) return;

        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};

    mt19937 mt(time(0));

    for(i=0; i<200; ++i)
        rangMax = max(rangMax, rang( uniform_int_distribution<int> (0, n-1) (mt) ));

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1944 KB Output is correct
2 Correct 4 ms 1920 KB Output is correct
3 Correct 3 ms 1932 KB Output is correct
4 Correct 6 ms 1784 KB Output is correct
5 Correct 5 ms 2048 KB Output is correct
6 Correct 4 ms 1860 KB Output is correct
7 Correct 7 ms 1792 KB Output is correct
8 Correct 5 ms 1784 KB Output is correct
9 Correct 5 ms 1912 KB Output is correct
10 Correct 6 ms 1920 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1780 KB Output is correct
2 Correct 7 ms 1920 KB Output is correct
3 Correct 6 ms 1920 KB Output is correct
4 Correct 6 ms 1912 KB Output is correct
5 Correct 6 ms 1792 KB Output is correct
6 Correct 5 ms 1932 KB Output is correct
7 Correct 4 ms 1876 KB Output is correct
8 Correct 5 ms 1792 KB Output is correct
9 Correct 6 ms 1912 KB Output is correct
10 Correct 4 ms 1792 KB Output is correct
11 Correct 5 ms 1912 KB Output is correct
12 Correct 16 ms 1784 KB Output is correct
13 Correct 4 ms 1912 KB Output is correct
14 Correct 10 ms 384 KB Output is correct
15 Correct 28 ms 1784 KB Output is correct
16 Correct 10 ms 1828 KB Output is correct
17 Correct 19 ms 1912 KB Output is correct
18 Correct 5 ms 1784 KB Output is correct
19 Correct 35 ms 1784 KB Output is correct
20 Correct 17 ms 1024 KB Output is correct
21 Correct 28 ms 1932 KB Output is correct
22 Correct 17 ms 2072 KB Output is correct
23 Correct 8 ms 1960 KB Output is correct
24 Correct 12 ms 1920 KB Output is correct
25 Correct 17 ms 1848 KB Output is correct
26 Correct 19 ms 1916 KB Output is correct
27 Correct 6 ms 1832 KB Output is correct
28 Correct 6 ms 1920 KB Output is correct
29 Correct 7 ms 1932 KB Output is correct
30 Correct 4 ms 2040 KB Output is correct
31 Correct 43 ms 1792 KB Output is correct
32 Correct 5 ms 1844 KB Output is correct
33 Correct 3 ms 328 KB Output is correct
34 Correct 29 ms 1912 KB Output is correct
35 Correct 7 ms 1792 KB Output is correct
36 Correct 45 ms 1784 KB Output is correct
37 Correct 5 ms 1844 KB Output is correct
38 Correct 5 ms 1920 KB Output is correct
39 Correct 23 ms 1792 KB Output is correct
40 Correct 5 ms 1912 KB Output is correct
41 Correct 12 ms 1912 KB Output is correct
42 Correct 12 ms 1844 KB Output is correct
43 Correct 19 ms 1840 KB Output is correct
44 Correct 26 ms 2040 KB Output is correct
45 Correct 26 ms 1912 KB Output is correct
46 Correct 49 ms 1784 KB Output is correct
47 Correct 24 ms 1784 KB Output is correct
48 Correct 9 ms 1912 KB Output is correct
49 Correct 38 ms 1784 KB Output is correct
50 Correct 6 ms 1976 KB Output is correct
51 Correct 23 ms 1912 KB Output is correct
52 Correct 28 ms 1912 KB Output is correct
53 Correct 7 ms 1792 KB Output is correct
54 Correct 24 ms 1940 KB Output is correct
55 Correct 39 ms 1784 KB Output is correct
56 Correct 7 ms 1784 KB Output is correct
57 Correct 18 ms 1932 KB Output is correct
58 Correct 17 ms 1784 KB Output is correct
59 Correct 23 ms 1788 KB Output is correct
60 Correct 11 ms 1920 KB Output is correct
61 Correct 4 ms 2040 KB Output is correct
62 Correct 8 ms 1788 KB Output is correct
63 Correct 8 ms 1784 KB Output is correct
64 Correct 8 ms 1784 KB Output is correct
65 Correct 7 ms 1784 KB Output is correct
66 Correct 10 ms 1912 KB Output is correct
67 Correct 12 ms 1912 KB Output is correct
68 Correct 8 ms 1848 KB Output is correct
69 Correct 10 ms 1940 KB Output is correct
70 Correct 6 ms 1920 KB Output is correct
71 Correct 40 ms 1792 KB Output is correct
72 Correct 7 ms 1952 KB Output is correct
73 Correct 19 ms 1792 KB Output is correct
74 Correct 38 ms 1792 KB Output is correct
75 Correct 5 ms 1792 KB Output is correct
76 Correct 35 ms 1920 KB Output is correct
77 Correct 42 ms 1920 KB Output is correct
78 Correct 7 ms 1920 KB Output is correct
79 Correct 22 ms 1792 KB Output is correct
80 Correct 43 ms 1920 KB Output is correct
81 Correct 36 ms 1792 KB Output is correct
82 Correct 43 ms 1792 KB Output is correct
83 Correct 7 ms 1920 KB Output is correct
84 Correct 38 ms 1836 KB Output is correct
85 Correct 20 ms 1860 KB Output is correct
86 Correct 13 ms 2048 KB Output is correct
87 Correct 8 ms 1820 KB Output is correct
88 Correct 24 ms 1880 KB Output is correct
89 Correct 10 ms 1920 KB Output is correct
90 Correct 6 ms 1920 KB Output is correct
91 Correct 9 ms 1920 KB Output is correct
92 Correct 11 ms 1920 KB Output is correct
93 Runtime error 15 ms 3576 KB Execution killed with signal 11 (could be triggered by violating memory limits)
94 Halted 0 ms 0 KB -