Submission #38435

# Submission time Handle Problem Language Result Execution time Memory
38435 2018-01-04T06:19:56 Z MatheusLealV The Big Prize (IOI17_prize) C++14
20 / 100
73 ms 8700 KB
#include <bits/stdc++.h>
#define N 200050
#include "prize.h"
using namespace std;

int n, v[N], maior, ans, raiz;

vector<int> dp[N];

vector<int> aski(int x)
{
	if(!dp[x].empty()) return dp[x];

	return dp[x] = ask(x);
}

#define f first
#define s second
typedef pair<int, int> pii;

vector<int> bucket[500];

int solve(int p, int en)
{
    while(p <= en)
    {
        vector<int> aux = aski(p);

        if(aux[0] + aux[1] == 0) return p;

        int ini = p + 1, fim = en, mid;

        if(aux[0] + aux[1] == maior)
        {
            while(fim >= ini)
            {
                mid = (ini + fim)/2;

                vector<int> atual = aski(mid);

                if(atual[0] + atual[1] == 0) return mid;

                if(ini == fim) break;

                if(atual[0] + atual[1] < maior) fim = mid;
                else
                {
                    if(aux[1] - atual[1] > 0) fim = mid - 1;
                    else ini = mid + 1;
                }
            }

            p = ini + 1;

        } else p++;
    }

    return -1;
}

int find_best(int n)
{
	raiz = sqrt(n) + 1;

	for(int i = 0; i < n; i ++ ) bucket[i/raiz].push_back(i);

	for(int i = 0; i < raiz; i++)
	{
		vector<int> aux = aski(i);

		if(aux[0] + aux[1] == 0) return i;

		maior = max(maior, aux[0] + aux[1]);
	}

	for(int i = 1; i < 500; i++)
	{
		if(bucket[i].empty()) continue;

		int a = bucket[i][0], b = bucket[i].back();

		int ans = solve(a, b);

		if(ans > -1) return ans;
	}

	return -1;
}
# Verdict Execution time Memory Grader output
1 Correct 9 ms 8436 KB Output is correct
2 Correct 13 ms 8568 KB Output is correct
3 Correct 13 ms 8568 KB Output is correct
4 Correct 26 ms 8568 KB Output is correct
5 Correct 19 ms 8568 KB Output is correct
6 Correct 0 ms 8436 KB Output is correct
7 Correct 16 ms 8568 KB Output is correct
8 Correct 16 ms 8568 KB Output is correct
9 Correct 26 ms 8568 KB Output is correct
10 Correct 16 ms 8568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 8436 KB Output is correct
2 Correct 56 ms 8568 KB Output is correct
3 Correct 16 ms 8568 KB Output is correct
4 Correct 66 ms 8568 KB Output is correct
5 Correct 13 ms 8568 KB Output is correct
6 Correct 3 ms 8436 KB Output is correct
7 Correct 23 ms 8568 KB Output is correct
8 Correct 13 ms 8568 KB Output is correct
9 Correct 23 ms 8568 KB Output is correct
10 Correct 33 ms 8568 KB Output is correct
11 Correct 19 ms 8568 KB Output is correct
12 Correct 9 ms 8436 KB Output is correct
13 Partially correct 16 ms 8568 KB Partially correct - number of queries: 5051
14 Correct 9 ms 7644 KB Output is correct
15 Correct 16 ms 8436 KB Output is correct
16 Partially correct 23 ms 8700 KB Partially correct - number of queries: 7234
17 Correct 6 ms 8436 KB Output is correct
18 Partially correct 36 ms 8700 KB Partially correct - number of queries: 8625
19 Correct 6 ms 8436 KB Output is correct
20 Correct 3 ms 8172 KB Output is correct
21 Correct 13 ms 8568 KB Output is correct
22 Correct 13 ms 8436 KB Output is correct
23 Correct 6 ms 8436 KB Output is correct
24 Correct 0 ms 8436 KB Output is correct
25 Correct 39 ms 8568 KB Output is correct
26 Correct 33 ms 8568 KB Output is correct
27 Correct 13 ms 8436 KB Output is correct
28 Partially correct 73 ms 8700 KB Partially correct - number of queries: 8179
29 Partially correct 56 ms 8700 KB Partially correct - number of queries: 6929
30 Partially correct 46 ms 8700 KB Partially correct - number of queries: 8599
31 Correct 6 ms 8436 KB Output is correct
32 Correct 23 ms 8568 KB Output is correct
33 Correct 0 ms 7512 KB Output is correct
34 Correct 33 ms 8568 KB Output is correct
35 Correct 29 ms 8568 KB Output is correct
36 Correct 13 ms 8436 KB Output is correct
37 Correct 6 ms 8436 KB Output is correct
38 Correct 13 ms 8436 KB Output is correct
39 Correct 26 ms 8568 KB Output is correct
40 Partially correct 36 ms 8700 KB Partially correct - number of queries: 8100
41 Partially correct 59 ms 8568 KB Partially correct - number of queries: 5100
42 Partially correct 59 ms 8568 KB Partially correct - number of queries: 5100
43 Correct 36 ms 8568 KB Output is correct
44 Correct 16 ms 8568 KB Output is correct
45 Correct 23 ms 8568 KB Output is correct
46 Correct 3 ms 8436 KB Output is correct
47 Correct 46 ms 8568 KB Output is correct
48 Partially correct 36 ms 8568 KB Partially correct - number of queries: 6265
49 Correct 13 ms 8436 KB Output is correct
50 Partially correct 46 ms 8700 KB Partially correct - number of queries: 8649
51 Correct 33 ms 8568 KB Output is correct
52 Correct 6 ms 8436 KB Output is correct
53 Correct 26 ms 8568 KB Output is correct
54 Correct 26 ms 8568 KB Output is correct
55 Correct 9 ms 8436 KB Output is correct
56 Partially correct 63 ms 8700 KB Partially correct - number of queries: 8632
57 Partially correct 69 ms 8568 KB Partially correct - number of queries: 6203
58 Partially correct 43 ms 8568 KB Partially correct - number of queries: 6275
59 Partially correct 26 ms 8568 KB Partially correct - number of queries: 5100
60 Correct 13 ms 8568 KB Output is correct
61 Correct 23 ms 8568 KB Output is correct
62 Correct 3 ms 8436 KB Output is correct
63 Correct 39 ms 8568 KB Output is correct
64 Correct 26 ms 8568 KB Output is correct
65 Correct 46 ms 8568 KB Output is correct
66 Partially correct 33 ms 8568 KB Partially correct - number of queries: 5363
67 Correct 6 ms 8568 KB Output is correct
68 Correct 3 ms 8436 KB Output is correct
69 Partially correct 29 ms 8568 KB Partially correct - number of queries: 5346
70 Correct 9 ms 8568 KB Output is correct
71 Partially correct 59 ms 8700 KB Partially correct - number of queries: 8649
72 Partially correct 29 ms 8568 KB Partially correct - number of queries: 5171
73 Partially correct 56 ms 8700 KB Partially correct - number of queries: 8600
74 Partially correct 39 ms 8700 KB Partially correct - number of queries: 8621
75 Correct 36 ms 8568 KB Output is correct
76 Partially correct 29 ms 8700 KB Partially correct - number of queries: 8097
77 Partially correct 69 ms 8700 KB Partially correct - number of queries: 8728
78 Partially correct 23 ms 8568 KB Partially correct - number of queries: 5160
79 Partially correct 69 ms 8700 KB Partially correct - number of queries: 6610
80 Partially correct 53 ms 8700 KB Partially correct - number of queries: 8709
81 Partially correct 69 ms 8700 KB Partially correct - number of queries: 8700
82 Partially correct 36 ms 8700 KB Partially correct - number of queries: 8664
83 Correct 33 ms 8568 KB Output is correct
84 Partially correct 63 ms 8700 KB Partially correct - number of queries: 7994
85 Partially correct 56 ms 8700 KB Partially correct - number of queries: 8705
86 Incorrect 56 ms 8700 KB Incorrect
87 Halted 0 ms 0 KB -