oj.uz

Submission #718296

# Submission time Handle Problem Language Result Execution time Memory
718296 2023-04-03T19:53:44 Z MrM7md Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 285 ms 3540 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>sml,big;
         int l=i,r=sz-j-1;
         while(l<=r){
            if(l==r){
               cur++;
               break;
            }
            if(a[l]+a[r]==ans){
               sml.pb(a[l]);
               big.pb(a[r]);
               l++;
               r--;
            }
            else if(a[l]+a[r]>ans){
               cur++;
               r--;
            }
            else{
               cur++;
               l++;
            }
            if(cur>k){
               cur=-1;
               break;
            }
         }
         if(cur==k){
            for(auto it:sml){
               cout<<it<<' ';
            }
            for(int i=big.size()-1;i>=0;i--)cout<<big[i]<<' ';
            return 0;
         }
         // cout<<v.back()<<' ';
      }
   }
   // cout<<v.size()<<endl;


}
/*

*/

Subtask #1
11.0 / 11.0

# 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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 29 ms 3228 KB Output is correct
3 Correct 27 ms 3196 KB Output is correct
4 Correct 28 ms 3144 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3096 KB Output is correct
2 Correct 26 ms 3156 KB Output is correct
3 Correct 29 ms 3188 KB Output is correct
4 Correct 27 ms 3196 KB Output is correct

Subtask #4
15.0 / 15.0

# 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 0 ms 212 KB Output is correct

Subtask #5
9.0 / 9.0

# 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 1 ms 212 KB Output is correct

Subtask #6
14.0 / 14.0

# 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 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 30 ms 3184 KB Output is correct
3 Correct 26 ms 3144 KB Output is correct
4 Correct 29 ms 3112 KB Output is correct
5 Correct 27 ms 3176 KB Output is correct
6 Correct 37 ms 3540 KB Output is correct
7 Correct 28 ms 3160 KB Output is correct
8 Correct 28 ms 3156 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 43 ms 3176 KB Output is correct
3 Correct 27 ms 3160 KB Output is correct
4 Correct 38 ms 3188 KB Output is correct
5 Correct 35 ms 3148 KB Output is correct
6 Correct 285 ms 3488 KB Output is correct
7 Correct 68 ms 3176 KB Output is correct
8 Correct 26 ms 3136 KB Output is correct