# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717391 | 2023-04-01T22:15:12 Z | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 331160 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 j=0;j<v.size();j++){ for(int i=0;i<sz;i++){ 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; } if(h[j]==-1)break; } if(h[j]!=-1){ int ans=v[j]; for(int i=0;i<sz;i++){ if(mp[ans-a[i]]&&ans-a[i]!=a[i])cout<<a[i]<<' '; } return 0; } } } /* */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 1364 KB | Output is correct |
2 | Correct | 78 ms | 8356 KB | Output is correct |
3 | Correct | 79 ms | 8360 KB | Output is correct |
4 | Correct | 67 ms | 8420 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 58 ms | 8400 KB | Output is correct |
2 | Correct | 69 ms | 8420 KB | Output is correct |
3 | Correct | 60 ms | 8384 KB | Output is correct |
4 | Correct | 70 ms | 8384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 852 KB | Output is correct |
2 | Correct | 58 ms | 12656 KB | Output is correct |
3 | Correct | 2 ms | 852 KB | Output is correct |
4 | Correct | 72 ms | 12288 KB | Output is correct |
5 | Correct | 2 ms | 852 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 2 ms | 596 KB | Output is correct |
3 | Correct | 1 ms | 468 KB | Output is correct |
4 | Correct | 1 ms | 468 KB | Output is correct |
5 | Correct | 1 ms | 468 KB | Output is correct |
6 | Incorrect | 1 ms | 468 KB | Extra information in the output file |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 72 ms | 8508 KB | Output is correct |
3 | Correct | 76 ms | 8372 KB | Output is correct |
4 | Correct | 68 ms | 8444 KB | Output is correct |
5 | Correct | 69 ms | 8424 KB | Output is correct |
6 | Incorrect | 41 ms | 8372 KB | Extra information in the output file |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 7288 KB | Output is correct |
2 | Correct | 1986 ms | 81076 KB | Output is correct |
3 | Correct | 131 ms | 16500 KB | Output is correct |
4 | Execution timed out | 3063 ms | 331160 KB | Time limit exceeded |
5 | Halted | 0 ms | 0 KB | - |