This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#define int long long
using namespace std;
//ifstream cin("test.in");
//ofstream cout("test.out");
int n, k;
int v[200005];
pair<int, int> rez[200005];
bool possible(int sum)
{
int st = 0, dr = n + k - 1, cnt = 0;
while (st < dr && cnt < n / 2 && (dr - st + 1) / 2 + cnt >= n / 2) {
if (v[st] + v[dr] == sum)
rez[cnt++] = {st++, dr--};
else if (v[st] + v[dr] < sum)
st++;
else
dr--;
}
return (cnt >= n / 2);
}
void solve()
{
bool ok = false;
for(int i = 1; i <= k && !ok; i++)
for(int j = n; j <= n + k && !ok; j++)
if(i < j && possible(v[i] + v[j]))
ok = true;
for(int i = 0; i < n / 2; i++)
cout<<rez[i].first<<" ";
for(int i = n / 2 - 1; i >= 0; i--)
cout<<rez[i].second<<" ";
return;
}
signed main()
{
cin>>n>>k;
for(int i = 0; i < n + k; i++)
cin>>v[i];
solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |