Submission #717417

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
717417	2023-04-01T22:30:40 Z	MrM7md	Table Tennis (info1cup20_tabletennis)	C++17	87 / 100	3000 ms	346140 KB

tabletennis

#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=i;w<=sz-j+1;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	2 ms	468 KB	Output is correct
2	Correct	1 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	1852 KB	Output is correct
2	Correct	87 ms	12320 KB	Output is correct
3	Correct	91 ms	12300 KB	Output is correct
4	Correct	86 ms	12340 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	89 ms	12384 KB	Output is correct
2	Correct	105 ms	12364 KB	Output is correct
3	Correct	88 ms	12356 KB	Output is correct
4	Correct	88 ms	12252 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	33 ms	8056 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	27 ms	9068 KB	Output is correct
5	Correct	2 ms	596 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct

Subtask #6
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	2 ms	468 KB	Output is correct
3	Correct	2 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	114 ms	12444 KB	Output is correct
3	Correct	94 ms	12312 KB	Output is correct
4	Correct	91 ms	12324 KB	Output is correct
5	Correct	104 ms	12328 KB	Output is correct
6	Correct	300 ms	12416 KB	Output is correct
7	Correct	90 ms	12404 KB	Output is correct
8	Correct	95 ms	12284 KB	Output is correct

Subtask #8
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	5392 KB	Output is correct
2	Correct	1739 ms	63560 KB	Output is correct
3	Correct	114 ms	17344 KB	Output is correct
4	Correct	2626 ms	346140 KB	Output is correct
5	Correct	100 ms	15872 KB	Output is correct
6	Execution timed out	3072 ms	11272 KB	Time limit exceeded
7	Halted	0 ms	0 KB	-

Submission #717417

Compilation message