# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366229 | 2021-02-13T15:09:51 Z | Ahmad_Hasan | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 12632 KB |
#include <bits/stdc++.h> #define int long long /** |||||||||| ||||| ||||| |||||||||| ||||||||||||| ||||| ||||| ||||| |||| |||||| ||||| ||||| ||||| ||||||||||||||||| ||||||||||||||| |||||||||| ||||||||||||||||||| ||||||||||||||| ||||| ||||| ||||| ||||| ||||| ||||| ||||| ||||| ||||| ||||| |||||||||| AHMED;HASSAN;SAEED; */ using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,k; cin>>n>>k; vector<int>v(n+k); unordered_map<int,int >mp,mp2; int nn=n+k; for(int i=0;i<nn;i++){ cin>>v[i]; } vector<vector<pair<int,int> > >pos((k+5)*(k+5)); int cr=1; for(int i=0;i<nn&&i<k+2;i++){ for(int j=nn-1;j>=0&&(nn-1-j)<=k+2;j--){ if(!mp[v[i]+v[j]]){ mp[v[i]+v[j]]=cr++; } } } int mxi=0; for(unordered_map<int,int>::iterator it=mp.begin();it!=mp.end();it++){ for(int i=0;i<nn;i++){ vector<int>::iterator it2=lower_bound(v.begin(),v.end(),(it->first)-v[i]); if(it2==v.end()||*it2!=(it->first)-v[i])continue; int vl=it2-v.begin(); if(vl>i){ pos[it->second].push_back({i,vl}); } } } /** for(int i=0;i<pos.size();i++){ for(int j=0;j<pos[i].size();j++){ cout<<pos[i][j].first<<'-'<<pos[i][j].second<<' '; } cout<<'\n'; }*/ for(int i=0;i<pos.size();i++) if(pos[i].size()>pos[mxi].size()) mxi=i; vector<int>ans; for(int i=0;i<pos[mxi].size()&&ans.size()<n;i++){ ans.push_back(v[pos[mxi][i].first]); ans.push_back(v[pos[mxi][i].second]); } sort(ans.begin(),ans.end()); for(int i=0;i<ans.size();i++) cout<<ans[i]<<' '; return 0; } /** 4 3 100000000000 200000000000 300000000000 400000000000 800000000000 1000000000000 2000000000000 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 492 KB | Output is correct |
2 | Correct | 2 ms | 492 KB | Output is correct |
3 | Correct | 2 ms | 492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 1920 KB | Output is correct |
2 | Correct | 141 ms | 5732 KB | Output is correct |
3 | Correct | 92 ms | 5728 KB | Output is correct |
4 | Correct | 119 ms | 5728 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 141 ms | 9568 KB | Output is correct |
2 | Correct | 147 ms | 5860 KB | Output is correct |
3 | Correct | 174 ms | 6620 KB | Output is correct |
4 | Correct | 134 ms | 5992 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 1260 KB | Output is correct |
2 | Correct | 30 ms | 1388 KB | Output is correct |
3 | Correct | 43 ms | 1664 KB | Output is correct |
4 | Correct | 25 ms | 1260 KB | Output is correct |
5 | Correct | 35 ms | 1388 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 29 ms | 876 KB | Output is correct |
3 | Correct | 20 ms | 492 KB | Output is correct |
4 | Correct | 23 ms | 756 KB | Output is correct |
5 | Correct | 17 ms | 876 KB | Output is correct |
6 | Correct | 9 ms | 1052 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Execution timed out | 3057 ms | 4204 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1000 ms | 10976 KB | Output is correct |
2 | Execution timed out | 3071 ms | 12632 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |