# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366191 | 2021-02-13T13:16:24 Z | Ahmad_Hasan | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 398512 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((k+5)*(k+5)); int cr=1; for(int i=0;i<nn&&i<k+2;i++){ mp2[v[i]]=i+1; 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(map<int,int>::iterator it=mp.begin();it!=mp.end();it++){ for(int i=0;i<nn;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 | Runtime error | 5 ms | 2284 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 18 ms | 3308 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 551 ms | 211436 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 762 ms | 64364 KB | Output is correct |
2 | Incorrect | 630 ms | 39020 KB | Output not sorted |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 492 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 1004 KB | Output is correct |
2 | Runtime error | 99 ms | 28268 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 1004 KB | Output is correct |
2 | Execution timed out | 3109 ms | 398512 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3025 ms | 197016 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |