oj.uz

Submission #718282

# Submission time Handle Problem Language Result Execution time Memory
718282 2023-04-03T19:35:46 Z MrM7md Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 260496 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 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1620 KB Output is correct
2 Correct 68 ms 10120 KB Output is correct
3 Correct 80 ms 10076 KB Output is correct
4 Correct 68 ms 10104 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 10048 KB Output is correct
2 Correct 81 ms 10112 KB Output is correct
3 Correct 77 ms 10164 KB Output is correct
4 Correct 80 ms 10056 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 29 ms 6172 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 23 ms 6868 KB Output is correct
5 Correct 1 ms 468 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 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 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 0 ms 212 KB Output is correct
2 Correct 73 ms 10220 KB Output is correct
3 Correct 72 ms 10132 KB Output is correct
4 Correct 68 ms 10088 KB Output is correct
5 Correct 83 ms 10028 KB Output is correct
6 Correct 282 ms 11056 KB Output is correct
7 Correct 67 ms 10204 KB Output is correct
8 Correct 70 ms 10112 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4088 KB Output is correct
2 Correct 1900 ms 48536 KB Output is correct
3 Correct 98 ms 13892 KB Output is correct
4 Correct 2220 ms 260496 KB Output is correct
5 Correct 82 ms 12728 KB Output is correct
6 Execution timed out 3046 ms 10148 KB Time limit exceeded
7 Halted 0 ms 0 KB -