oj.uz

Submission #718279

# Submission time Handle Problem Language Result Execution time Memory
718279 2023-04-03T19:34:37 Z MrM7md Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 349012 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;
         for(int w=i;w<=sz-j-1;w++){
            if(a[w]!=ans-a[w]){
               if(!mp[ans-a[w]]){
                  if(cur<k&&cur>=0)cur++;
                  else cur=-1;
               }
               else v.pb(a[w]);
            }
            else{
               if(cur<k&&cur>=0)cur++;
               else cur=-1;
            }
            if(cur==-1)break;
         }
         if(cur==k){
            for(auto it:v){
               cout<<it<<' ';
            }
            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 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2160 KB Output is correct
2 Correct 72 ms 13572 KB Output is correct
3 Correct 105 ms 13632 KB Output is correct
4 Correct 78 ms 13604 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 13660 KB Output is correct
2 Correct 74 ms 13688 KB Output is correct
3 Correct 78 ms 13644 KB Output is correct
4 Correct 96 ms 13572 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 34 ms 8088 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 32 ms 9104 KB Output is correct
5 Correct 2 ms 576 KB Output is correct

Subtask #5
9.0 / 9.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

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 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 Correct 2 ms 468 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 78 ms 13764 KB Output is correct
3 Correct 80 ms 13576 KB Output is correct
4 Correct 84 ms 13656 KB Output is correct
5 Correct 82 ms 13596 KB Output is correct
6 Correct 302 ms 15604 KB Output is correct
7 Correct 80 ms 13740 KB Output is correct
8 Correct 78 ms 13612 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5312 KB Output is correct
2 Correct 2333 ms 66364 KB Output is correct
3 Correct 98 ms 20144 KB Output is correct
4 Correct 2434 ms 349012 KB Output is correct
5 Correct 96 ms 18576 KB Output is correct
6 Execution timed out 3089 ms 15996 KB Time limit exceeded
7 Halted 0 ms 0 KB -