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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define all(x) x.begin(),x.end()
const int MOD = 1e9 + 7, SZ = 1e5 + 10, MX = 1e9;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
ll arr[n + k];
for(ll &i : arr)
cin >> i;
for(int i=0;i<n+k;i++){
ll a = 0, b = 0;
int l = 0, r = n + k - 1, c = 0;
while(l < r){
if(c)
a += arr[l] + arr[r];
else
b += arr[l] + arr[r];
c = (c + 1)%2;
l++;
if(l == i)
l++;
r--;
if(r == i)
r--;
}
if(a != b)
continue;
for(int j=0;j<n+k;j++){
if(j == i)
continue;
cout << arr[j] << ' ';
}
return 0;
}
return 0;
}
// https://www.youtube.com/watch?v=zL32whN6p0A&ab_channel=HeidiAdel-CartoonWorld
# | 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... |