# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
718299 | 2023-04-03T19:57:28 Z | MrM7md | Table Tennis (info1cup20_tabletennis) | C++17 | 307 ms | 4132 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]; // map<int,bool>mp; for(int i=0;i<sz;i++){ cin >>a[i]; // mp[a[i]]=1; } // sort(a,a+sz); for(int i=0;i<=k;i++){ for(int j=0;j<=k-i;j++){ int ans=a[i]+a[sz-j-1]; int cur=i+j; vector<int>v; int l=i,r=sz-j-1; while(l<=r){ if(l==r){ cur++; } else if(a[l]+a[r]==ans){ v.pb(a[l]); v.pb(a[r]); l++; r--; } else if(a[l]+a[r]>ans){ cur++; r--; } else{ cur++; l++; } if(cur>k||v.size()>n){ cur=-1; break; } } if(cur==k){ sort(all(v)); for(auto it:v){ cout<<it<<' '; } return 0; } // cout<<v.back()<<' '; } } // cout<<v.size()<<endl; } /* */
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 | 5 ms | 724 KB | Output is correct |
2 | Correct | 31 ms | 3052 KB | Output is correct |
3 | Correct | 30 ms | 3072 KB | Output is correct |
4 | Correct | 31 ms | 2980 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 3088 KB | Output is correct |
2 | Correct | 30 ms | 3076 KB | Output is correct |
3 | Correct | 30 ms | 3072 KB | Output is correct |
4 | Correct | 32 ms | 3032 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 | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 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 | 212 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 2 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 37 ms | 3012 KB | Output is correct |
3 | Correct | 29 ms | 3084 KB | Output is correct |
4 | Correct | 33 ms | 3028 KB | Output is correct |
5 | Correct | 29 ms | 3076 KB | Output is correct |
6 | Correct | 42 ms | 3932 KB | Output is correct |
7 | Correct | 29 ms | 3044 KB | Output is correct |
8 | Correct | 30 ms | 3076 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 56 ms | 3064 KB | Output is correct |
3 | Correct | 30 ms | 3044 KB | Output is correct |
4 | Correct | 50 ms | 3016 KB | Output is correct |
5 | Correct | 31 ms | 3064 KB | Output is correct |
6 | Correct | 307 ms | 4132 KB | Output is correct |
7 | Correct | 77 ms | 3068 KB | Output is correct |
8 | Correct | 30 ms | 3048 KB | Output is correct |