# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
518290 | 2022-01-23T10:33:00 Z | Ronin13 | Table Tennis (info1cup20_tabletennis) | C++14 | 3000 ms | 665352 KB |
#include<bits/stdc++.h> #define ll long long #define ull unsigned ll #define pb push_back #define f first #define s second #define pii pair<int,int> #define pll pair<ll,ll> #define epb emplace_back #define inf 1e9+1 #define linf 1e18+11 using namespace std; unordered_map<int,pii>used; int dp[1001][150001]; int main(){ int n;cin>>n; int k;cin>>k; int a[n+k+1]; for(int i=1;i<=n+k;i++){ cin>>a[i]; } for(int i=0;i<=2*k;i++){ for(int j=0;j<=n;j++)dp[i][j]=-inf; } dp[0][0]=0; sort(a+1,a+1+n+k); for(int i=2*k;i>=1;i--){ for(int j=i+1;j<=n+k;j++){ int x=a[i]+a[j]; dp[i][j]=dp[used[x].f][used[x].s]+2; } for(int j=i+1;j<=n+k;j++){ int x=a[i]+a[j]; used[x]={i,j}; } } int val=0; for(int i=1;i<=2*k;i++){ for(int j=1;j<=n+k;j++){ if(dp[i][j]>=n){ val=a[i]+a[j]; break; } } } int l=1,r=n+k; vector<int>vec; while(l<r){ if(vec.size()==n)break; int ss=a[l]+a[r]; if(ss==val){ vec.pb(a[l]); vec.pb(a[r]); l++; r--; continue; } if(ss>val){ r--; continue; } l++; continue; } sort(vec.begin(),vec.end()); for(int to:vec)cout<<to<<' '; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 444 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 11 ms | 1500 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 279 ms | 26696 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 1740 KB | Output is correct |
2 | Correct | 3 ms | 2060 KB | Output is correct |
3 | Correct | 3 ms | 2124 KB | Output is correct |
4 | Correct | 3 ms | 2124 KB | Output is correct |
5 | Correct | 3 ms | 2124 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 304 KB | Output is correct |
3 | Correct | 1 ms | 420 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 460 KB | Output is correct |
2 | Incorrect | 11 ms | 2036 KB | Unexpected end of file - int32 expected |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 460 KB | Output is correct |
2 | Execution timed out | 3082 ms | 237844 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 9784 KB | Output is correct |
2 | Execution timed out | 3054 ms | 665352 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |