# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
926988 | blacktulip | Table Tennis (info1cup20_tabletennis) | C++17 | 0 ms | 0 KiB |
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 ort ((bas+son)/2)
#define int long long
#define endl "\n"
int n,k,a[150005],index;
inline bool check(int l,int r,int sum){
int say=0;
while(l<r){
if(a[l]+a[r]==sum){
l++;
r--;
say++;
}
else if(a[l]+a[r]<sum){
index=l;
l++;
}
else{
index=r;
r--;
}
}
if(say==n/2)return 1;
return 0;
}
int32_t main(void){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n>>k;
for(int i=1;i<=n;i++)cin>>a[i];
if(check(1,n,a[1]+a[n])){
for(int i=1;i<index;i++)cout<<i<<" ";
for(int i=index+1;i<=n;i++)cout<<i<<" ";
return 0;
}
if(check(1,n-1,a[1]+a[n-1])){
for(int i=1;i<n;i++)cout<<i<<" ";
return 0;
}
if(check(2,n,a[2]+a[n])){
for(int i=2;i<=n;i++)cout<<i<<" ";
return 0;
}
return 0;
}