oj.uz

Submission #717416

# Submission time Handle Problem Language Result Execution time Memory
717416 2023-04-01T22:30:04 Z MrM7md Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 346180 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;
         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{
               if(cur<k&&cur>=0)cur++;
               else cur=-1;
            }
            if(cur==-1)break;
         }
         if(cur==k){
            for(int w=0;w<sz;w++){
               if(mp[ans-a[w]]&&ans-a[w]!=a[w])cout<<a[w]<<' ';
            }
            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 1 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1876 KB Output is correct
2 Correct 87 ms 12312 KB Output is correct
3 Correct 92 ms 12236 KB Output is correct
4 Correct 88 ms 12244 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 12420 KB Output is correct
2 Correct 87 ms 12280 KB Output is correct
3 Correct 87 ms 12352 KB Output is correct
4 Correct 86 ms 12276 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 32 ms 8124 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 28 ms 9168 KB Output is correct
5 Correct 1 ms 596 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 468 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 292 KB Output is correct
2 Correct 90 ms 12444 KB Output is correct
3 Correct 89 ms 12360 KB Output is correct
4 Correct 91 ms 12348 KB Output is correct
5 Correct 92 ms 12412 KB Output is correct
6 Correct 274 ms 12296 KB Output is correct
7 Correct 88 ms 12544 KB Output is correct
8 Correct 86 ms 12236 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 5408 KB Output is correct
2 Correct 1668 ms 63656 KB Output is correct
3 Correct 103 ms 17356 KB Output is correct
4 Correct 2178 ms 346180 KB Output is correct
5 Correct 96 ms 15820 KB Output is correct
6 Execution timed out 3062 ms 11272 KB Time limit exceeded
7 Halted 0 ms 0 KB -