# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717386 | 2023-04-01T22:10:50 Z | MrM7md | Table Tennis (info1cup20_tabletennis) | C++14 | 3000 ms | 334644 KB |
#include <bits/stdc++.h> using namespace std; // #define int long long #define endl '\n' #define F first #define S second #define pb push_back #define all(a) a.begin(),a.end() const int N=1e5; const int off=(1<<20); const int MOD = 1e9+7; signed main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n,k; cin >> n >> k; int sz=n+k; int a[sz]; unordered_map<int,bool>mp; for(int i=0;i<sz;i++){ cin >>a[i]; mp[a[i]]=1; } sort(a,a+sz); vector<int>v; for(int i=0;i<=k;i++){ for(int j=0;j<=k-i;j++){ v.pb(a[i]+a[sz-j-1]); // cout<<v.back()<<' '; } } // cout<<v.size()<<endl; int h[v.size()]={0}; for(int i=0;i<sz;i++){ for(int j=0;j<v.size();j++){ if(a[i]!=v[j]-a[i]){ if(!mp[v[j]-a[i]]){ if(h[j]<k&&h[j]>=0)h[j]++; else h[j]=-1; } } else{ if(h[j]<k&&h[j]>=0)h[j]++; else h[j]=-1; } } } int ans; for(int i=0;i<v.size();i++){ if(h[i]>-1)ans=v[i]; // cout<<pp[i].F<<' '<<pp[i].S; } for(int i=0;i<sz;i++){ if(mp[ans-a[i]]&&ans-a[i]!=a[i])cout<<a[i]<<' '; } } /* */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 596 KB | Output is correct |
2 | Correct | 2 ms | 468 KB | Output is correct |
3 | Correct | 2 ms | 596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 1364 KB | Output is correct |
2 | Correct | 203 ms | 22012 KB | Output is correct |
3 | Correct | 229 ms | 22028 KB | Output is correct |
4 | Correct | 221 ms | 22028 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 363 ms | 40116 KB | Output is correct |
2 | Correct | 440 ms | 41868 KB | Output is correct |
3 | Correct | 411 ms | 40004 KB | Output is correct |
4 | Correct | 431 ms | 41904 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 213 ms | 24628 KB | Output is correct |
2 | Correct | 92 ms | 19572 KB | Output is correct |
3 | Correct | 173 ms | 22560 KB | Output is correct |
4 | Correct | 274 ms | 39476 KB | Output is correct |
5 | Correct | 173 ms | 22444 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 596 KB | Output is correct |
2 | Correct | 45 ms | 9796 KB | Output is correct |
3 | Correct | 160 ms | 20352 KB | Output is correct |
4 | Correct | 119 ms | 19624 KB | Output is correct |
5 | Correct | 14 ms | 2640 KB | Output is correct |
6 | Correct | 7 ms | 1364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 596 KB | Output is correct |
2 | Execution timed out | 3073 ms | 334644 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3052 ms | 329336 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |