# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423633 | 2021-06-11T10:40:07 Z | jamezzz | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 10028 KB |
#include <bits/stdc++.h> using namespace std; #define sf scanf #define pf printf #define pb emplace_back #define all(x) x.begin(),x.end() int n,k,v; vector<int> s,ans; unordered_map<int,bool> mp; int main(){ sf("%d%d",&n,&k); n+=k; for(int i=0;i<n;++i){ sf("%d",&v); s.push_back(v); } sort(all(s)); int res=0; for(int i=0;i<=k;++i){ for(int j=n-(k-i)-1;j<n;++j){ mp.clear(); for(int l=i+1;l<j;++l)mp[s[l]]=1; int t=s[i]+s[j],take=1; for(int l=i+1;l<j;++l){ if(!mp[s[l]])continue; if(s[l]<t-s[l]&&mp.count(t-s[l])&&mp[t-s[l]]){ ++take; mp[s[l]]=0; mp[t-s[l]]=0; } if(take==(n-k)/2)break; } if(take==(n-k)/2){ res=t; break; } } if(res!=0)break; } mp.clear(); for(int i=0;i<n;++i)mp[s[i]]=1; for(int i=0;i<n;++i){ if(!mp[s[i]])continue; if(s[i]<res-s[i]&&mp.count(res-s[i])&&mp[res-s[i]]){ ans.pb(s[i]); ans.pb(res-s[i]); mp[s[i]]=0; mp[res-s[i]]=0; } if(ans.size()==n-k)break; } sort(all(ans)); for(int x:ans)pf("%d ",x); pf("\n"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 332 KB | Output is correct |
2 | Correct | 2 ms | 332 KB | Output is correct |
3 | Correct | 2 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 1536 KB | Output is correct |
2 | Correct | 211 ms | 9948 KB | Output is correct |
3 | Correct | 138 ms | 10008 KB | Output is correct |
4 | Correct | 161 ms | 10028 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 218 ms | 9996 KB | Output is correct |
2 | Correct | 140 ms | 9948 KB | Output is correct |
3 | Correct | 316 ms | 10004 KB | Output is correct |
4 | Correct | 126 ms | 9952 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 66 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 50 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 34 ms | 368 KB | Output is correct |
3 | Correct | 2 ms | 332 KB | Output is correct |
4 | Correct | 29 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 12 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Execution timed out | 3048 ms | 6876 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Execution timed out | 3050 ms | 6800 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |