oj.uz

Submission #766806

# Submission time Handle Problem Language Result Execution time Memory
766806 2023-06-26T07:41:40 Z danikoynov The Big Prize (IOI17_prize) C++14
20 / 100
 88 ms 2640 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
map < int, vector < int > > mp;
map < int, int > used;
int cnt = 0;
vector < int > local_ask(int idx)
{
    if (used[idx])
        return mp[idx];
    cnt ++;
    //if (cnt == 1e4)
    //  while(true);
    used[idx] = 1;
    mp[idx] = ask(idx);
    return mp[idx];
}

const int maxn = 2e5 + 10;
vector < int > st;
int best;
void solve_range(int l, int r)
{
    ///cout << l << " " << r << " " << cnt << endl;
    int m = (l + r) / 2;
    vector < int > lf = local_ask(l);
    vector < int > rf = local_ask(r);
    if (lf[1] == rf[1])
        return;
    while(m > l)
    {
        vector < int > mf = local_ask(m);
        if (mf[0] + mf[1] != best)
        {
            st.push_back(m);
            m --;
        }
        else
        {
            break;
        }
    }
    if (m == l)
    {
        m = (l + r) / 2 + 1;
        while(m < r)
        {
            vector < int > mf = local_ask(m);
            if (mf[0] + mf[1] != best)
                st.push_back(m), m ++;
            else
                break;
        }
    }
    if (m == r)
        return;

    vector < int > mf = local_ask(m);
    if (lf[0] != mf[0])
        solve_range(l, m);
    if (rf[0] != mf[0])
        solve_range(m, r);
}
int find_best(int n)
{
    vector < int > idc;
    for (int i = 0; i < n; i ++)
        idc.push_back(i);
    int nec = min(n, (int)sqrt(n) + 2);
    int mx = -1;
    for (int i = 0; i < nec; i ++)
    {
        vector < int > cur = local_ask(i);
        if (cur[0] + cur[1] > best)
        {
            best = cur[0] + cur[1];
            mx = i;
        }
    }
    int pt = n - 1;
    while(true)
    {
        vector < int > cur = local_ask(pt);
        if (cur[0] + cur[1] == best)
            break;
        pt --;
    }


    for (int i = 0; i < mx; i ++)
        st.push_back(i);
    for (int i = pt + 1; i < n; i ++)
        st.push_back(i);
    solve_range(mx, pt);

    //cout << st.size() << " " << cnt << endl;
    for (int i = 0; i < st.size(); i ++)
    {
        vector < int > cur = local_ask(st[i]);
        if (cur[0] + cur[1] == 0)
            return st[i];
    }
    return -1;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:97:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     for (int i = 0; i < st.size(); i ++)
      |                     ~~^~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1352 KB Output is correct
2 Correct 4 ms 1352 KB Output is correct
3 Correct 4 ms 1432 KB Output is correct
4 Correct 3 ms 1440 KB Output is correct
5 Correct 3 ms 1432 KB Output is correct
6 Correct 3 ms 1432 KB Output is correct
7 Correct 5 ms 1352 KB Output is correct
8 Correct 5 ms 1352 KB Output is correct
9 Correct 4 ms 1432 KB Output is correct
10 Correct 6 ms 1352 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1436 KB Output is correct
2 Correct 4 ms 1440 KB Output is correct
3 Correct 4 ms 1352 KB Output is correct
4 Correct 5 ms 1352 KB Output is correct
5 Correct 5 ms 1352 KB Output is correct
6 Correct 5 ms 1352 KB Output is correct
7 Correct 3 ms 1428 KB Output is correct
8 Correct 3 ms 1432 KB Output is correct
9 Correct 5 ms 1440 KB Output is correct
10 Correct 3 ms 1352 KB Output is correct
11 Correct 8 ms 1436 KB Output is correct
12 Correct 10 ms 1432 KB Output is correct
13 Correct 5 ms 1436 KB Output is correct
14 Correct 11 ms 464 KB Output is correct
15 Correct 36 ms 1860 KB Output is correct
16 Partially correct 48 ms 1852 KB Partially correct - number of queries: 5205
17 Partially correct 50 ms 1788 KB Partially correct - number of queries: 5208
18 Partially correct 36 ms 1836 KB Partially correct - number of queries: 5206
19 Correct 23 ms 1860 KB Output is correct
20 Correct 32 ms 1204 KB Output is correct
21 Partially correct 24 ms 1856 KB Partially correct - number of queries: 5174
22 Correct 32 ms 1716 KB Output is correct
23 Correct 6 ms 1352 KB Output is correct
24 Correct 4 ms 1432 KB Output is correct
25 Correct 46 ms 1720 KB Output is correct
26 Correct 32 ms 1736 KB Output is correct
27 Correct 6 ms 1352 KB Output is correct
28 Correct 47 ms 1756 KB Output is correct
29 Correct 18 ms 1648 KB Output is correct
30 Partially correct 50 ms 1872 KB Partially correct - number of queries: 5175
31 Partially correct 27 ms 1868 KB Partially correct - number of queries: 5173
32 Correct 10 ms 1352 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Partially correct 49 ms 1768 KB Partially correct - number of queries: 5211
35 Correct 7 ms 1352 KB Output is correct
36 Partially correct 24 ms 1848 KB Partially correct - number of queries: 5174
37 Correct 8 ms 1352 KB Output is correct
38 Correct 5 ms 1436 KB Output is correct
39 Partially correct 32 ms 1784 KB Partially correct - number of queries: 5174
40 Correct 44 ms 1724 KB Output is correct
41 Partially correct 49 ms 1844 KB Partially correct - number of queries: 5210
42 Partially correct 35 ms 1844 KB Partially correct - number of queries: 5210
43 Partially correct 48 ms 1856 KB Partially correct - number of queries: 5076
44 Partially correct 50 ms 1832 KB Partially correct - number of queries: 5209
45 Correct 43 ms 1716 KB Output is correct
46 Partially correct 45 ms 1856 KB Partially correct - number of queries: 5207
47 Correct 46 ms 1800 KB Output is correct
48 Partially correct 40 ms 1852 KB Partially correct - number of queries: 5207
49 Partially correct 50 ms 1800 KB Partially correct - number of queries: 5206
50 Partially correct 49 ms 1840 KB Partially correct - number of queries: 5210
51 Partially correct 23 ms 1916 KB Partially correct - number of queries: 5205
52 Partially correct 40 ms 1852 KB Partially correct - number of queries: 5208
53 Correct 5 ms 1436 KB Output is correct
54 Partially correct 24 ms 1864 KB Partially correct - number of queries: 5179
55 Partially correct 27 ms 1968 KB Partially correct - number of queries: 5206
56 Partially correct 49 ms 1780 KB Partially correct - number of queries: 5203
57 Partially correct 24 ms 1848 KB Partially correct - number of queries: 5172
58 Partially correct 23 ms 1896 KB Partially correct - number of queries: 5207
59 Partially correct 43 ms 1860 KB Partially correct - number of queries: 5209
60 Partially correct 37 ms 1852 KB Partially correct - number of queries: 5173
61 Correct 3 ms 1436 KB Output is correct
62 Correct 4 ms 1436 KB Output is correct
63 Correct 3 ms 1436 KB Output is correct
64 Correct 5 ms 1352 KB Output is correct
65 Correct 3 ms 1436 KB Output is correct
66 Correct 7 ms 1432 KB Output is correct
67 Correct 5 ms 1432 KB Output is correct
68 Correct 6 ms 1432 KB Output is correct
69 Correct 8 ms 1432 KB Output is correct
70 Correct 7 ms 1352 KB Output is correct
71 Partially correct 41 ms 1776 KB Partially correct - number of queries: 5208
72 Correct 10 ms 1352 KB Output is correct
73 Partially correct 48 ms 1848 KB Partially correct - number of queries: 5145
74 Partially correct 29 ms 1852 KB Partially correct - number of queries: 5172
75 Correct 6 ms 1352 KB Output is correct
76 Correct 41 ms 1768 KB Output is correct
77 Partially correct 53 ms 1856 KB Partially correct - number of queries: 5334
78 Correct 7 ms 1352 KB Output is correct
79 Correct 24 ms 1480 KB Output is correct
80 Partially correct 43 ms 1924 KB Partially correct - number of queries: 5321
81 Partially correct 50 ms 1804 KB Partially correct - number of queries: 5324
82 Partially correct 43 ms 1856 KB Partially correct - number of queries: 5266
83 Correct 5 ms 1352 KB Output is correct
84 Correct 35 ms 1756 KB Output is correct
85 Partially correct 30 ms 1856 KB Partially correct - number of queries: 5286
86 Incorrect 88 ms 2640 KB Incorrect
87 Halted 0 ms 0 KB -