# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
735062 | NintsiChkhaidze | Table Tennis (info1cup20_tabletennis) | C++17 | 3068 ms | 23184 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>
#define pb push_back
#define f first
#define s second
#define int long long
using namespace std;
const int N = 2e5+5,inf = 1e9;
int a[N],n,k;
map <int,int> mp;
vector <int> v;
void check(int sum){
mp.clear();
for (int i= 1; i <= n+k;i++)
mp[a[i]]++;
v.clear();
for (int i = 1; i <= n + k; i++){
if (!mp[a[i]]) continue;
mp[a[i]]--;
if (mp[sum - a[i]] > 0) {
v.pb(a[i]);
v.pb(sum - a[i]);
mp[sum - a[i]]--;
continue;
}
mp[a[i]]++;
}
if (v.size() == n){
sort(v.begin(),v.end());
for (int x: v) cout<<x<<" ";
cout<<endl;
exit(0);
}
}
signed main (){
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
cin>>n>>k;
for (int i = 1; i <= n+k;i++)
cin>>a[i];
for (int i = 1; i <= min(n,k/2 + 2); i++){
int c=0;
for (int j = n; j > i; j--){
++c;
if (c > k/2 + 1) break;
int s = a[i] + a[j];
check(s);
}
}
}
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... |