oj.uz

Submission #436853

# Submission time Handle Problem Language Result Execution time Memory
436853 2021-06-25T05:28:10 Z davitmarg A Difficult(y) Choice (BOI21_books) C++17
100 / 100
 3 ms 1216 KB 
/*
DavitMarg
In a honky-tonk,
Down in Mexico
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <random>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair    
#define PB push_back
#define all(v) v.begin(), v.end()
#define fastIO ios::sync_with_stdio(false); cin.tie(0)
using namespace std;

#ifndef death
#include "books.h"
#endif // death


const int N = 500005;

#ifdef death

LL A[N];

LL skim(int i)
{
	cout << "? " << i << endl;
	LL res = A[i];
	//cin >> res;
	return res;
}

void answer(vector<int> v)
{
	cout << "!";
	for (int i = 0; i < v.size(); i++)
		cout << " " << v[i];
	cout << endl;
}

void impossible()
{
	cout << "! -1" << endl;
}

#endif

int rnd()
{
	return (rand() << 32) + rand();
}

int rnd(int l, int r)
{
	int d = r - l + 1;
	return l + rnd() % d;
}


int n, k, s;
LL X, a[N], sum, pr[N];
vector<int> ans;
int used[N];

LL mySkim(int pos)
{
	if (!used[pos])
	{
		used[pos] = 1;
		a[pos] = skim(pos);
	}
	return a[pos];
}

vector<int> lr(int l, int r)
{
	vector<int> res;
	for (int i = l; i <= r; i++)
		res.push_back(i);
	return res;
}

LL get(int l, int r)
{
	LL p = r - l + 1ll;
	LL sum = 0;
	int steps = min(70, r - l + 1);
	int d = p / steps;
	for (int i = 0; i < steps; i++)
	{
		sum += skim(r - d * i) * p;
	}
	sum /= steps;
	return sum;
}

bool check(LL val)
{
	return (val >= X && val <= X + X);
}

void solve(int NN, int K, long long A, int S)
{
	n = NN;
	k = K;
	X = A;
	s = S;

	int l = k, r = n, m, pos = n + 1;

	while (l <= r)
	{
		m = (l + r) / 2;
		mySkim(m);
		if (a[m] >= X)
		{
			pos = m;
			r = m - 1;
		}
		else
			l = m + 1;
	}

	if (pos < k)
	{
		impossible();
		return;
	}


	for (int i = 1; i <= k; i++)
		mySkim(i);		

	for (int i = pos - 1; i >= pos - k && i >= 1; i--)
		mySkim(i);

	for (int i = 1; i <= n; i++)
		pr[i] = pr[i - 1] + a[i];

	if(pos<=n)
	if (check(pr[k - 1] + a[pos]))
	{
		ans = lr(1, k - 1);
		ans.push_back(pos);
		answer(ans);
		return;
	}

	if (check(pr[k]))
	{
		ans = lr(1, k);
		answer(ans);
		return;
	}

	pos--;

	if (pos < k)
	{
		impossible();
		return;
	}

	if (check(pr[pos] - pr[pos - k]))
	{
		ans = lr(pos-k+1, pos);
		answer(ans);
		return;
	}

	for (int i = 1; i < k; i++)
	{
		if (check(pr[k] - pr[i] + pr[pos] - pr[pos - i]))
		{
			ans = lr(i + 1, k);
			vector<int> x = lr(pos - i + 1, pos);
			for (int j = 0; j < x.size(); j++)
				ans.push_back(x[j]);
			answer(ans);
			return;
		}
	}

	impossible();
}


#ifdef death

int main()
{
	fastIO;
	int nn, kk, aa;
	cin >> nn >> kk >> aa;
	for (int i = 1; i <= nn; i++)
		cin >> A[i];
	solve(nn, kk, aa, 100);
	return 0;
}


#endif // death

/*


8 3 110
1 3 5 10 40 60 70 105


*/

Compilation message

books.cpp: In function 'int rnd()':
books.cpp:67:17: warning: left shift count >= width of type [-Wshift-count-overflow]
   67 |  return (rand() << 32) + rand();
      |          ~~~~~~~^~~~~
books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:194:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |    for (int j = 0; j < x.size(); j++)
      |                    ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 448 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 3 ms 456 KB Output is correct
12 Correct 2 ms 456 KB Output is correct
13 Correct 2 ms 456 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 1 ms 456 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1072 KB Output is correct
2 Correct 3 ms 1060 KB Output is correct
3 Correct 2 ms 1088 KB Output is correct
4 Correct 2 ms 1080 KB Output is correct
5 Correct 2 ms 1088 KB Output is correct
6 Correct 2 ms 1088 KB Output is correct
7 Correct 2 ms 1072 KB Output is correct
8 Correct 2 ms 1088 KB Output is correct
9 Correct 3 ms 1076 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1072 KB Output is correct
2 Correct 3 ms 1060 KB Output is correct
3 Correct 2 ms 1088 KB Output is correct
4 Correct 2 ms 1080 KB Output is correct
5 Correct 2 ms 1088 KB Output is correct
6 Correct 2 ms 1088 KB Output is correct
7 Correct 2 ms 1072 KB Output is correct
8 Correct 2 ms 1088 KB Output is correct
9 Correct 3 ms 1076 KB Output is correct
10 Correct 2 ms 1080 KB Output is correct
11 Correct 2 ms 1072 KB Output is correct
12 Correct 2 ms 1060 KB Output is correct
13 Correct 2 ms 1072 KB Output is correct
14 Correct 2 ms 1080 KB Output is correct
15 Correct 2 ms 1096 KB Output is correct
16 Correct 2 ms 1064 KB Output is correct
17 Correct 2 ms 1072 KB Output is correct
18 Correct 3 ms 1204 KB Output is correct
19 Correct 2 ms 1064 KB Output is correct
20 Correct 2 ms 1076 KB Output is correct
21 Correct 2 ms 1060 KB Output is correct
22 Correct 2 ms 1068 KB Output is correct
23 Correct 2 ms 1096 KB Output is correct
24 Correct 2 ms 1096 KB Output is correct
25 Correct 2 ms 1088 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1072 KB Output is correct
2 Correct 3 ms 1060 KB Output is correct
3 Correct 2 ms 1088 KB Output is correct
4 Correct 2 ms 1080 KB Output is correct
5 Correct 2 ms 1088 KB Output is correct
6 Correct 2 ms 1088 KB Output is correct
7 Correct 2 ms 1072 KB Output is correct
8 Correct 2 ms 1088 KB Output is correct
9 Correct 3 ms 1076 KB Output is correct
10 Correct 2 ms 1080 KB Output is correct
11 Correct 2 ms 1072 KB Output is correct
12 Correct 2 ms 1060 KB Output is correct
13 Correct 2 ms 1072 KB Output is correct
14 Correct 2 ms 1080 KB Output is correct
15 Correct 2 ms 1096 KB Output is correct
16 Correct 2 ms 1064 KB Output is correct
17 Correct 2 ms 1072 KB Output is correct
18 Correct 3 ms 1204 KB Output is correct
19 Correct 2 ms 1064 KB Output is correct
20 Correct 2 ms 1076 KB Output is correct
21 Correct 2 ms 1060 KB Output is correct
22 Correct 2 ms 1068 KB Output is correct
23 Correct 2 ms 1096 KB Output is correct
24 Correct 2 ms 1096 KB Output is correct
25 Correct 2 ms 1088 KB Output is correct
26 Correct 2 ms 1060 KB Output is correct
27 Correct 2 ms 1088 KB Output is correct
28 Correct 2 ms 1088 KB Output is correct
29 Correct 2 ms 1088 KB Output is correct
30 Correct 2 ms 1076 KB Output is correct
31 Correct 2 ms 1064 KB Output is correct
32 Correct 2 ms 1064 KB Output is correct
33 Correct 3 ms 1076 KB Output is correct
34 Correct 2 ms 1064 KB Output is correct
35 Correct 2 ms 1072 KB Output is correct
36 Correct 2 ms 1088 KB Output is correct
37 Correct 2 ms 1080 KB Output is correct
38 Correct 2 ms 1088 KB Output is correct
39 Correct 2 ms 1124 KB Output is correct
40 Correct 2 ms 1084 KB Output is correct
41 Correct 2 ms 1088 KB Output is correct
42 Correct 2 ms 1088 KB Output is correct
43 Correct 2 ms 1080 KB Output is correct
44 Correct 2 ms 1060 KB Output is correct
45 Correct 2 ms 1088 KB Output is correct
46 Correct 2 ms 1216 KB Output is correct
47 Correct 2 ms 1092 KB Output is correct
48 Correct 2 ms 1096 KB Output is correct
49 Correct 2 ms 1060 KB Output is correct
50 Correct 2 ms 1064 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1072 KB Output is correct
2 Correct 3 ms 1060 KB Output is correct
3 Correct 2 ms 1088 KB Output is correct
4 Correct 2 ms 1080 KB Output is correct
5 Correct 2 ms 1088 KB Output is correct
6 Correct 2 ms 1088 KB Output is correct
7 Correct 2 ms 1072 KB Output is correct
8 Correct 2 ms 1088 KB Output is correct
9 Correct 3 ms 1076 KB Output is correct
10 Correct 2 ms 1080 KB Output is correct
11 Correct 2 ms 1072 KB Output is correct
12 Correct 2 ms 1060 KB Output is correct
13 Correct 2 ms 1072 KB Output is correct
14 Correct 2 ms 1080 KB Output is correct
15 Correct 2 ms 1096 KB Output is correct
16 Correct 2 ms 1064 KB Output is correct
17 Correct 2 ms 1072 KB Output is correct
18 Correct 3 ms 1204 KB Output is correct
19 Correct 2 ms 1064 KB Output is correct
20 Correct 2 ms 1076 KB Output is correct
21 Correct 2 ms 1060 KB Output is correct
22 Correct 2 ms 1068 KB Output is correct
23 Correct 2 ms 1096 KB Output is correct
24 Correct 2 ms 1096 KB Output is correct
25 Correct 2 ms 1088 KB Output is correct
26 Correct 2 ms 1076 KB Output is correct
27 Correct 2 ms 1072 KB Output is correct
28 Correct 2 ms 1096 KB Output is correct
29 Correct 2 ms 1088 KB Output is correct
30 Correct 2 ms 1076 KB Output is correct
31 Correct 2 ms 1088 KB Output is correct
32 Correct 2 ms 1072 KB Output is correct
33 Correct 2 ms 1068 KB Output is correct
34 Correct 2 ms 1084 KB Output is correct
35 Correct 2 ms 1088 KB Output is correct
36 Correct 2 ms 1080 KB Output is correct
37 Correct 2 ms 1064 KB Output is correct
38 Correct 3 ms 1088 KB Output is correct
39 Correct 2 ms 1080 KB Output is correct
40 Correct 2 ms 1096 KB Output is correct
41 Correct 2 ms 1084 KB Output is correct
42 Correct 3 ms 1084 KB Output is correct
43 Correct 2 ms 1060 KB Output is correct
44 Correct 2 ms 1072 KB Output is correct
45 Correct 2 ms 1076 KB Output is correct
46 Correct 2 ms 1088 KB Output is correct
47 Correct 2 ms 1076 KB Output is correct
48 Correct 2 ms 1076 KB Output is correct
49 Correct 2 ms 1076 KB Output is correct
50 Correct 2 ms 1084 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1072 KB Output is correct
2 Correct 3 ms 1060 KB Output is correct
3 Correct 2 ms 1088 KB Output is correct
4 Correct 2 ms 1080 KB Output is correct
5 Correct 2 ms 1088 KB Output is correct
6 Correct 2 ms 1088 KB Output is correct
7 Correct 2 ms 1072 KB Output is correct
8 Correct 2 ms 1088 KB Output is correct
9 Correct 3 ms 1076 KB Output is correct
10 Correct 2 ms 1080 KB Output is correct
11 Correct 2 ms 1072 KB Output is correct
12 Correct 2 ms 1060 KB Output is correct
13 Correct 2 ms 1072 KB Output is correct
14 Correct 2 ms 1080 KB Output is correct
15 Correct 2 ms 1096 KB Output is correct
16 Correct 2 ms 1064 KB Output is correct
17 Correct 2 ms 1072 KB Output is correct
18 Correct 3 ms 1204 KB Output is correct
19 Correct 2 ms 1064 KB Output is correct
20 Correct 2 ms 1076 KB Output is correct
21 Correct 2 ms 1060 KB Output is correct
22 Correct 2 ms 1068 KB Output is correct
23 Correct 2 ms 1096 KB Output is correct
24 Correct 2 ms 1096 KB Output is correct
25 Correct 2 ms 1088 KB Output is correct
26 Correct 2 ms 1060 KB Output is correct
27 Correct 2 ms 1088 KB Output is correct
28 Correct 2 ms 1088 KB Output is correct
29 Correct 2 ms 1088 KB Output is correct
30 Correct 2 ms 1076 KB Output is correct
31 Correct 2 ms 1064 KB Output is correct
32 Correct 2 ms 1064 KB Output is correct
33 Correct 3 ms 1076 KB Output is correct
34 Correct 2 ms 1064 KB Output is correct
35 Correct 2 ms 1072 KB Output is correct
36 Correct 2 ms 1088 KB Output is correct
37 Correct 2 ms 1080 KB Output is correct
38 Correct 2 ms 1088 KB Output is correct
39 Correct 2 ms 1124 KB Output is correct
40 Correct 2 ms 1084 KB Output is correct
41 Correct 2 ms 1088 KB Output is correct
42 Correct 2 ms 1088 KB Output is correct
43 Correct 2 ms 1080 KB Output is correct
44 Correct 2 ms 1060 KB Output is correct
45 Correct 2 ms 1088 KB Output is correct
46 Correct 2 ms 1216 KB Output is correct
47 Correct 2 ms 1092 KB Output is correct
48 Correct 2 ms 1096 KB Output is correct
49 Correct 2 ms 1060 KB Output is correct
50 Correct 2 ms 1064 KB Output is correct
51 Correct 2 ms 1076 KB Output is correct
52 Correct 2 ms 1072 KB Output is correct
53 Correct 2 ms 1096 KB Output is correct
54 Correct 2 ms 1088 KB Output is correct
55 Correct 2 ms 1076 KB Output is correct
56 Correct 2 ms 1088 KB Output is correct
57 Correct 2 ms 1072 KB Output is correct
58 Correct 2 ms 1068 KB Output is correct
59 Correct 2 ms 1084 KB Output is correct
60 Correct 2 ms 1088 KB Output is correct
61 Correct 2 ms 1080 KB Output is correct
62 Correct 2 ms 1064 KB Output is correct
63 Correct 3 ms 1088 KB Output is correct
64 Correct 2 ms 1080 KB Output is correct
65 Correct 2 ms 1096 KB Output is correct
66 Correct 2 ms 1084 KB Output is correct
67 Correct 3 ms 1084 KB Output is correct
68 Correct 2 ms 1060 KB Output is correct
69 Correct 2 ms 1072 KB Output is correct
70 Correct 2 ms 1076 KB Output is correct
71 Correct 2 ms 1088 KB Output is correct
72 Correct 2 ms 1076 KB Output is correct
73 Correct 2 ms 1076 KB Output is correct
74 Correct 2 ms 1076 KB Output is correct
75 Correct 2 ms 1084 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 1 ms 436 KB Output is correct
78 Correct 1 ms 328 KB Output is correct
79 Correct 1 ms 328 KB Output is correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 1 ms 328 KB Output is correct
82 Correct 1 ms 328 KB Output is correct
83 Correct 1 ms 328 KB Output is correct
84 Correct 1 ms 456 KB Output is correct
85 Correct 1 ms 444 KB Output is correct
86 Correct 1 ms 456 KB Output is correct
87 Correct 2 ms 456 KB Output is correct
88 Correct 2 ms 440 KB Output is correct
89 Correct 2 ms 456 KB Output is correct
90 Correct 1 ms 456 KB Output is correct
91 Correct 1 ms 456 KB Output is correct
92 Correct 2 ms 1060 KB Output is correct
93 Correct 2 ms 1088 KB Output is correct
94 Correct 2 ms 1072 KB Output is correct
95 Correct 2 ms 1088 KB Output is correct
96 Correct 2 ms 1088 KB Output is correct
97 Correct 2 ms 1080 KB Output is correct
98 Correct 2 ms 1088 KB Output is correct
99 Correct 2 ms 1068 KB Output is correct
100 Correct 2 ms 1088 KB Output is correct
101 Correct 2 ms 1076 KB Output is correct
102 Correct 2 ms 1080 KB Output is correct
103 Correct 2 ms 1064 KB Output is correct
104 Correct 2 ms 1068 KB Output is correct
105 Correct 2 ms 1096 KB Output is correct
106 Correct 2 ms 1084 KB Output is correct
107 Correct 2 ms 1096 KB Output is correct
108 Correct 2 ms 1064 KB Output is correct
109 Correct 2 ms 1072 KB Output is correct
110 Correct 2 ms 1096 KB Output is correct
111 Correct 3 ms 1060 KB Output is correct
112 Correct 3 ms 1096 KB Output is correct
113 Correct 3 ms 1072 KB Output is correct
114 Correct 3 ms 1076 KB Output is correct
115 Correct 2 ms 1088 KB Output is correct
116 Correct 2 ms 1088 KB Output is correct
117 Correct 2 ms 1076 KB Output is correct
118 Correct 2 ms 1064 KB Output is correct
119 Correct 2 ms 1076 KB Output is correct
120 Correct 2 ms 1076 KB Output is correct
121 Correct 2 ms 1092 KB Output is correct
122 Correct 2 ms 1076 KB Output is correct
123 Correct 2 ms 1084 KB Output is correct
124 Correct 2 ms 1084 KB Output is correct
125 Correct 2 ms 1096 KB Output is correct
126 Correct 2 ms 1072 KB Output is correct
127 Correct 2 ms 1096 KB Output is correct
128 Correct 2 ms 1088 KB Output is correct
129 Correct 2 ms 1064 KB Output is correct
130 Correct 2 ms 1064 KB Output is correct
131 Correct 3 ms 1088 KB Output is correct
132 Correct 2 ms 1088 KB Output is correct
133 Correct 2 ms 1088 KB Output is correct
134 Correct 2 ms 1096 KB Output is correct
135 Correct 3 ms 1096 KB Output is correct