| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1045028 | Malix | Table Tennis (info1cup20_tabletennis) | C++14 | 202 ms | 3188 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;
typedef vector<int> vi;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define PB push_back
int n,k;
vi a,ans;
bool solve(int x){
int l=0,r=n+k-1;ans.clear();
while(l<r&&ans.size()<n){
while(l<r&&a[l]+a[r]>x)r--;
if(l<r&&a[l]+a[r]==x){
ans.PB(a[l]);ans.PB(a[r]);
}
if(r-l+1+ans.size()<n)break;
l++;
}
sort(ans.begin(),ans.end());
return ans.size()==n;
}
int main() {
cin>>n>>k;a.resize(n+k);
REP(i,0,n+k)cin>>a[i];
REP(i,0,k+1)REP(j,n-1,n+k)if(solve(a[i]+a[j])){
for(auto u:ans)cout<<u<<" ";
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... | ||||
