Submission #1154987

#TimeUsernameProblemLanguageResultExecution timeMemory
1154987vivkostovTable Tennis (info1cup20_tabletennis)C++20
34 / 100
801 ms10172 KiB
#include<bits/stdc++.h> #define endl '\n' using namespace std; void speed() { ios_base :: sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); } int n,k,a[2000005]; set<int>v; vector<int>otg; void print(int sum) { for(int i=1;i<=n+k;i++) { if(a[i]<sum&&v.count(sum-a[i])) { otg.push_back(a[i]); if(otg.size()==n) { for(int j=0;j<n;j++) { cout<<otg[j]<<" "; } cout<<endl; exit(0); } } } } void resh(int beg,int to) { int sum=a[beg]+a[to],brf=0,brt=0; for(int j=beg+1;j<=beg+k*2;j++) { if(a[j]<sum&&v.count(sum-a[j]))brt++; else brf++; //cout<<beg<<" "<<to<<" "<<brf<<" "<<brt<<" "<<j<<endl; if(brf>k)return; if(brt>k-1) { print(sum); } } } void read() { cin>>n>>k; for(int i=1;i<=n+k;i++) { cin>>a[i]; v.insert(a[i]); } for(int i=1;i<=k+1;i++) { for(int j=n+k;j>=n;j--) { resh(i,j); } } } int main () { speed(); read(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...