# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227837 | blacktulip | Table Tennis (info1cup20_tabletennis) | C++17 | 1707 ms | 5736 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.
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t,sum;
int cev;
string s;
//~ map<int,int> mpp;
vector<int> v;
main(void){
scanf("%lld %lld",&n,&k);
for(int i=1;i<=n+k;i++)scanf("%lld",&a[i]);
for(int i=k+1;i>=1;i--){
for(int j=n+k;j>=n+k-k+(i-1);j--){
int bas=i;
int son=j;
flag=0;
cev=0;
v.clear();
int at=k-i+1-(n+k-(j));
//~ printf("%d\n",v.size());
while(bas<son && at>=0){
if(a[bas]+a[son]==a[i]+a[j]){v.pb(a[bas]);v.pb(a[son]);bas++;son--;cev++;}
else if(a[bas]+a[son]<a[i]+a[j]){at--;bas++;}
else if(a[bas]+a[son]>a[i]+a[j]){at--;son--;}
if(cev>=n/2){flag=1;break;}
}
if(flag==1){
sort(v.begin(),v.end());
for(int i=0;i<(int)v.size();i++){
printf("%lld ",v[i]);
}
return 0;
}
}
}
return 0;
}
Compilation message (stderr)
# | 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... |