Submission #98437

# Submission time Handle Problem Language Result Execution time Memory
98437 2019-02-23T17:09:41 Z bogdan10bos The Big Prize (IOI17_prize) C++14
20 / 100
96 ms 1212 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);
    }
    solve(0, N - 1);
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 13 ms 376 KB Output is correct
2 Correct 8 ms 256 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 5 ms 416 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 7 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 4 ms 536 KB Output is correct
4 Correct 7 ms 256 KB Output is correct
5 Correct 4 ms 276 KB Output is correct
6 Correct 12 ms 276 KB Output is correct
7 Correct 5 ms 424 KB Output is correct
8 Correct 10 ms 384 KB Output is correct
9 Correct 4 ms 424 KB Output is correct
10 Correct 7 ms 256 KB Output is correct
11 Correct 6 ms 432 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 15 ms 376 KB Output is correct
14 Correct 7 ms 252 KB Output is correct
15 Correct 20 ms 424 KB Output is correct
16 Correct 27 ms 776 KB Output is correct
17 Correct 7 ms 256 KB Output is correct
18 Partially correct 44 ms 820 KB Partially correct - number of queries: 5233
19 Correct 6 ms 256 KB Output is correct
20 Correct 10 ms 528 KB Output is correct
21 Correct 24 ms 596 KB Output is correct
22 Correct 6 ms 432 KB Output is correct
23 Correct 6 ms 256 KB Output is correct
24 Correct 8 ms 256 KB Output is correct
25 Correct 31 ms 560 KB Output is correct
26 Correct 20 ms 516 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 29 ms 644 KB Output is correct
29 Correct 26 ms 632 KB Output is correct
30 Partially correct 58 ms 712 KB Partially correct - number of queries: 5342
31 Correct 6 ms 408 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 17 ms 376 KB Output is correct
35 Correct 10 ms 256 KB Output is correct
36 Correct 13 ms 536 KB Output is correct
37 Correct 8 ms 284 KB Output is correct
38 Correct 8 ms 256 KB Output is correct
39 Correct 26 ms 620 KB Output is correct
40 Correct 48 ms 772 KB Output is correct
41 Correct 18 ms 440 KB Output is correct
42 Correct 15 ms 484 KB Output is correct
43 Correct 16 ms 376 KB Output is correct
44 Correct 12 ms 716 KB Output is correct
45 Correct 17 ms 424 KB Output is correct
46 Correct 9 ms 384 KB Output is correct
47 Correct 32 ms 428 KB Output is correct
48 Correct 38 ms 640 KB Output is correct
49 Correct 10 ms 248 KB Output is correct
50 Partially correct 48 ms 728 KB Partially correct - number of queries: 5158
51 Correct 30 ms 464 KB Output is correct
52 Correct 5 ms 416 KB Output is correct
53 Correct 10 ms 256 KB Output is correct
54 Correct 22 ms 504 KB Output is correct
55 Correct 8 ms 256 KB Output is correct
56 Partially correct 51 ms 752 KB Partially correct - number of queries: 5209
57 Correct 31 ms 632 KB Output is correct
58 Correct 32 ms 644 KB Output is correct
59 Correct 8 ms 420 KB Output is correct
60 Correct 10 ms 504 KB Output is correct
61 Correct 7 ms 256 KB Output is correct
62 Correct 9 ms 256 KB Output is correct
63 Correct 12 ms 320 KB Output is correct
64 Correct 9 ms 304 KB Output is correct
65 Correct 9 ms 392 KB Output is correct
66 Correct 7 ms 412 KB Output is correct
67 Correct 8 ms 432 KB Output is correct
68 Correct 4 ms 420 KB Output is correct
69 Correct 8 ms 296 KB Output is correct
70 Correct 17 ms 564 KB Output is correct
71 Partially correct 45 ms 748 KB Partially correct - number of queries: 5641
72 Correct 17 ms 376 KB Output is correct
73 Partially correct 58 ms 760 KB Partially correct - number of queries: 5564
74 Partially correct 55 ms 832 KB Partially correct - number of queries: 5597
75 Correct 6 ms 256 KB Output is correct
76 Correct 40 ms 764 KB Output is correct
77 Partially correct 54 ms 968 KB Partially correct - number of queries: 5367
78 Correct 7 ms 392 KB Output is correct
79 Correct 37 ms 540 KB Output is correct
80 Partially correct 33 ms 788 KB Partially correct - number of queries: 5355
81 Partially correct 55 ms 788 KB Partially correct - number of queries: 5398
82 Partially correct 68 ms 792 KB Partially correct - number of queries: 5228
83 Correct 5 ms 256 KB Output is correct
84 Correct 43 ms 692 KB Output is correct
85 Partially correct 56 ms 760 KB Partially correct - number of queries: 5378
86 Incorrect 96 ms 1212 KB Incorrect
87 Halted 0 ms 0 KB -