# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679417 | alexdd | Table Tennis (info1cup20_tabletennis) | C++17 | 3098 ms | 329680 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,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000007
int n,k;
unordered_map<int,int> fr;
unordered_map<int,int> fr1;
int mxm,unde;
int a[150001];
vector<int> rez;
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>k;
mxm=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
fr1[a[i]]++;
for(int j=1;j<i;j++)
{
fr[a[i]+a[j]]++;
if(fr[a[i]+a[j]] > mxm)
{
mxm = fr[a[i]+a[j]];
unde = a[i]+a[j];
}
}
}
for(int i=1;i<=n;i++)
{
if(a[i]<unde-a[i] && fr1[unde-a[i]]>0 && rez.size()<n)
{
rez.push_back(a[i]);
rez.push_back(unde-a[i]);
}
}
sort(rez.begin(),rez.end());
for(int i=0;i<n;i++)
cout<<rez[i]<<" ";
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... |