#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma warning(disable : 6031)
#define USACO freopen("moocast.in", "r", stdin); freopen("moocast.out", "w+", stdout)
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ll long long
using namespace std;
ll binpow(ll a, ll x, ll m) {
ll ans = 1, md = a % m;
for (int i = 0; i < 63; i++) {
if (x & ((ll)1 << i)) ans = (ans * md) % m;
md = (md * md) % m;
}
return ans;
}
vector<ll> gcd(ll a, ll b) {
if (b == 0) {
return { a, 1, 0 };
}
vector<ll> d = gcd(b, a % b);
return { d[0], d[2], d[1] - d[2] * (a / b) };
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b)[0];
}
int a[200000], ans[150000];
void solve() {
int n, k;
cin >> k >> n;
n += k;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i + k - 1; j < n; j++) {
ans[0] = a[i];
ans[k - 1] = a[j];
int cnt = 1;
for (int l = i + 1, r = j - 1; 2 * cnt < k; l++) {
while (r > l && a[j] - a[r] < a[l] - a[i]) r--;
if (r <= l) break;
if (a[j] - a[r] == a[l] - a[i]) {
ans[cnt] = a[l];
ans[k - cnt - 1] = a[r];
cnt++;
r--;
}
}
if (2 * cnt == k) {
for (int c = 0; c < k; c++) cout << ans[c] << " ";
return;
}
}
}
}
int main() {
//USACO;
fastIO;
solve();
}
Compilation message
tabletennis.cpp:2: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
2 | #pragma warning(disable : 4996)
|
tabletennis.cpp:3: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
3 | #pragma warning(disable : 6031)
|
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
632 KB |
Output is correct |
2 |
Correct |
29 ms |
2884 KB |
Output is correct |
3 |
Correct |
28 ms |
2900 KB |
Output is correct |
4 |
Correct |
28 ms |
2896 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
2892 KB |
Output is correct |
2 |
Correct |
27 ms |
2892 KB |
Output is correct |
3 |
Correct |
35 ms |
2944 KB |
Output is correct |
4 |
Correct |
30 ms |
2900 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
2 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
153 ms |
2956 KB |
Output is correct |
3 |
Correct |
32 ms |
2856 KB |
Output is correct |
4 |
Correct |
56 ms |
2948 KB |
Output is correct |
5 |
Correct |
42 ms |
2936 KB |
Output is correct |
6 |
Correct |
51 ms |
2940 KB |
Output is correct |
7 |
Correct |
60 ms |
2884 KB |
Output is correct |
8 |
Correct |
34 ms |
2892 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Execution timed out |
3092 ms |
868 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |