# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366184 | 2021-02-13T13:07:01 Z | Ahmad_Hasan | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 1048580 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); int nn=n+k; for(int i=0;i<nn;i++){ cin>>v[i]; } map<int,int >mp,mp2; vector<vector<pair<int,int> > >pos(nn*(k+5)); int cr=1; for(int i=0;i<n;i++){ mp2[v[i]]=i+1; for(int j=i+1;j<n&&(j-i)<=k+5;j++){ if(!mp[v[i]+v[j]])mp[v[i]+v[j]]=cr++; } } int mxi=0; for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++){ for(int i=0;i<n;i++){ int vl=mp2[(it->first)-v[i]]; if(vl>i+1){ pos[it->second].push_back({i,vl-1}); if(pos[it->second].size()>pos[mxi].size()) mxi=it->second; } } } vector<int>ans; for(int i=0;i<pos[mxi].size()&&i<n/2;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<n;i++) cout<<ans[i]<<' '; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3027 ms | 152228 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3075 ms | 24652 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3118 ms | 733196 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 748 KB | Output is correct |
2 | Incorrect | 57 ms | 4460 KB | Output not sorted |
3 | Halted | 0 ms | 0 KB | - |
# | 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 | 0 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 921 ms | 40844 KB | Output not sorted |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Execution timed out | 3125 ms | 658076 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 4460 KB | Output is correct |
2 | Runtime error | 592 ms | 1048580 KB | Execution killed with signal 9 |
3 | Halted | 0 ms | 0 KB | - |