Submission #679420

#TimeUsernameProblemLanguageResultExecution timeMemory
679420alexddTable Tennis (info1cup20_tabletennis)C++17
49 / 100
3077 ms329408 KiB
#pragma GCC optimize("O3,unroll-loops") #include<bits/stdc++.h> using namespace std; #define int long long int n,k; unordered_map<int,int> fr; unordered_map<int,int> fr1; int mxm,unde; int a[160001]; 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+k;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+k;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)

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:33:60: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   33 |         if(a[i]<unde-a[i] && fr1[unde-a[i]]>0 && rez.size()<n)
      |                                                  ~~~~~~~~~~^~
#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...