oj.uz

Submission #98438

# Submission time Handle Problem Language Result Execution time Memory
98438 2019-02-23T17:12:08 Z bogdan10bos The Big Prize (IOI17_prize) C++14
20 / 100
 98 ms 1240 KB 
#include <bits/stdc++.h>

#include "prize.h"

using namespace std;

typedef pair<int, int> pii;

int sq, mxcnt, ans;
map<int, int> mp[2];

pii myask(int pos)
{
    if(mp[0].count(pos))
        return {mp[0][pos], mp[1][pos]};

    auto v = ask(pos);
    mp[0][pos] = v[0];
    mp[1][pos] = v[1];
    return {v[0], v[1]};
}

void solve(int st, int dr)
{
    if(st > dr) return;
    if(ans != -1)   return;
    auto askst = myask(st);
    auto askdr = myask(dr);

    int sumst = askst.first + askst.second;
    int sumdr = askdr.first + askdr.second;

    if(sumst == 0)  { ans = st; return; }
    if(sumdr == 0)  { ans = dr; return; }

    if(askst.second == 0 || askdr.first == 0)   return;

    if(dr - st <= 1)    return;

    if(sumst != mxcnt)
    {
        solve(st + 1, dr);
        return;
    }

    if(sumdr != mxcnt)
    {
        solve(st, dr - 1);
        return;
    }

    int cnt = askdr.first - askst.first;
    if(cnt == 0)    return;

    int lgt = dr - st - 1;

    int add = lgt / (cnt + 1);
    add = max(add, 1);

    solve(st, st + add);
    solve(st + add, dr);
}

int find_best(int N)
{
    ans = -1;
    sq = sqrt(N) + 1;
    sq = min(sq, N);
    mxcnt = 0;
	for(int i = 0; i < sq; i++)
    {
        auto x = myask(i);
        int sum = x.first + x.second;
        if(sum == 0)    ans = i;
        mxcnt = max(mxcnt, sum);
    }
    int st = 0, dr = sq;
    for(; st < N; )
    {
        solve(st, dr);
        st += sq; dr += sq;
        if(dr >= N) dr = N - 1;
    }
    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 420 KB Output is correct
2 Correct 4 ms 432 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 10 ms 388 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 7 ms 308 KB Output is correct
7 Correct 6 ms 560 KB Output is correct
8 Correct 9 ms 304 KB Output is correct
9 Correct 6 ms 452 KB Output is correct
10 Correct 10 ms 476 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 336 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 8 ms 376 KB Output is correct
4 Correct 7 ms 432 KB Output is correct
5 Correct 9 ms 376 KB Output is correct
6 Correct 7 ms 304 KB Output is correct
7 Correct 5 ms 312 KB Output is correct
8 Correct 10 ms 376 KB Output is correct
9 Correct 12 ms 308 KB Output is correct
10 Correct 8 ms 408 KB Output is correct
11 Correct 8 ms 376 KB Output is correct
12 Correct 9 ms 312 KB Output is correct
13 Correct 15 ms 316 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 12 ms 384 KB Output is correct
16 Correct 39 ms 816 KB Output is correct
17 Correct 8 ms 256 KB Output is correct
18 Partially correct 58 ms 680 KB Partially correct - number of queries: 5104
19 Correct 7 ms 384 KB Output is correct
20 Correct 18 ms 376 KB Output is correct
21 Correct 14 ms 704 KB Output is correct
22 Correct 11 ms 308 KB Output is correct
23 Correct 6 ms 420 KB Output is correct
24 Correct 9 ms 384 KB Output is correct
25 Correct 34 ms 552 KB Output is correct
26 Correct 34 ms 512 KB Output is correct
27 Correct 9 ms 256 KB Output is correct
28 Correct 51 ms 880 KB Output is correct
29 Correct 34 ms 728 KB Output is correct
30 Partially correct 36 ms 844 KB Partially correct - number of queries: 5070
31 Correct 7 ms 304 KB Output is correct
32 Correct 10 ms 308 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 10 ms 520 KB Output is correct
35 Correct 9 ms 376 KB Output is correct
36 Correct 9 ms 656 KB Output is correct
37 Correct 9 ms 344 KB Output is correct
38 Correct 9 ms 256 KB Output is correct
39 Correct 28 ms 424 KB Output is correct
40 Correct 36 ms 680 KB Output is correct
41 Correct 20 ms 776 KB Output is correct
42 Correct 16 ms 580 KB Output is correct
43 Correct 31 ms 572 KB Output is correct
44 Correct 28 ms 424 KB Output is correct
45 Correct 23 ms 424 KB Output is correct
46 Correct 8 ms 256 KB Output is correct
47 Correct 34 ms 524 KB Output is correct
48 Correct 42 ms 552 KB Output is correct
49 Correct 6 ms 364 KB Output is correct
50 Partially correct 48 ms 696 KB Partially correct - number of queries: 5068
51 Correct 28 ms 428 KB Output is correct
52 Correct 8 ms 256 KB Output is correct
53 Correct 13 ms 320 KB Output is correct
54 Correct 14 ms 584 KB Output is correct
55 Correct 6 ms 256 KB Output is correct
56 Partially correct 52 ms 828 KB Partially correct - number of queries: 5113
57 Correct 22 ms 712 KB Output is correct
58 Correct 39 ms 624 KB Output is correct
59 Correct 33 ms 504 KB Output is correct
60 Correct 21 ms 636 KB Output is correct
61 Correct 6 ms 432 KB Output is correct
62 Correct 7 ms 304 KB Output is correct
63 Correct 10 ms 376 KB Output is correct
64 Correct 6 ms 364 KB Output is correct
65 Correct 8 ms 380 KB Output is correct
66 Correct 12 ms 376 KB Output is correct
67 Correct 13 ms 336 KB Output is correct
68 Correct 9 ms 256 KB Output is correct
69 Correct 17 ms 376 KB Output is correct
70 Correct 15 ms 384 KB Output is correct
71 Partially correct 56 ms 764 KB Partially correct - number of queries: 5614
72 Correct 13 ms 376 KB Output is correct
73 Partially correct 64 ms 748 KB Partially correct - number of queries: 5544
74 Partially correct 55 ms 760 KB Partially correct - number of queries: 5574
75 Correct 14 ms 380 KB Output is correct
76 Correct 47 ms 728 KB Output is correct
77 Partially correct 56 ms 760 KB Partially correct - number of queries: 5363
78 Correct 7 ms 392 KB Output is correct
79 Correct 36 ms 504 KB Output is correct
80 Partially correct 27 ms 816 KB Partially correct - number of queries: 5338
81 Partially correct 57 ms 808 KB Partially correct - number of queries: 5309
82 Partially correct 56 ms 820 KB Partially correct - number of queries: 5264
83 Correct 12 ms 376 KB Output is correct
84 Correct 24 ms 784 KB Output is correct
85 Partially correct 37 ms 920 KB Partially correct - number of queries: 5304
86 Incorrect 98 ms 1240 KB Incorrect
87 Halted 0 ms 0 KB -