oj.uz

Submission #717387

# Submission time Handle Problem Language Result Execution time Memory
717387 2023-04-01T22:13:06 Z MrM7md Table Tennis (info1cup20_tabletennis) C++14
87 / 100
 3000 ms 329600 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];
   unordered_map<int,bool>mp;
   for(int i=0;i<sz;i++){
      cin >>a[i];
      mp[a[i]]=1;
   }
   sort(a,a+sz);

   vector<int>v;
   for(int i=0;i<=k;i++){
      for(int j=0;j<=k-i;j++){
         v.pb(a[i]+a[sz-j-1]);
         // cout<<v.back()<<' ';
      }
   }
   // cout<<v.size()<<endl;
   int h[v.size()]={0};

   for(int j=0;j<v.size();j++){
      for(int i=0;i<sz;i++){
         if(a[i]!=v[j]-a[i]){
            if(!mp[v[j]-a[i]]){
               if(h[j]<k&&h[j]>=0)h[j]++;
               else h[j]=-1;
            }
         }
         else{
            if(h[j]<k&&h[j]>=0)h[j]++;
            else h[j]=-1;
         }
         if(h[j]==-1)break;
      }
   }
   int ans;
   for(int i=0;i<v.size();i++){
      if(h[i]>-1)ans=v[i];

   }

   for(int i=0;i<sz;i++){
      if(mp[ans-a[i]]&&ans-a[i]!=a[i])cout<<a[i]<<' ';
   }

}
/*

*/

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:37:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |    for(int j=0;j<v.size();j++){
      |                ~^~~~~~~~~
tabletennis.cpp:53:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |    for(int i=0;i<v.size();i++){
      |                ~^~~~~~~~~

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 8 ms 1364 KB Output is correct
2 Correct 77 ms 8412 KB Output is correct
3 Correct 67 ms 8364 KB Output is correct
4 Correct 76 ms 8368 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 8328 KB Output is correct
2 Correct 93 ms 8476 KB Output is correct
3 Correct 71 ms 8376 KB Output is correct
4 Correct 78 ms 8364 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 19596 KB Output is correct
2 Correct 71 ms 12660 KB Output is correct
3 Correct 11 ms 1652 KB Output is correct
4 Correct 108 ms 19544 KB Output is correct
5 Correct 13 ms 1584 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 1 ms 340 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 104 ms 8592 KB Output is correct
3 Correct 70 ms 8356 KB Output is correct
4 Correct 67 ms 8460 KB Output is correct
5 Correct 110 ms 8368 KB Output is correct
6 Correct 172 ms 8468 KB Output is correct
7 Correct 87 ms 8520 KB Output is correct
8 Correct 89 ms 8428 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3085 ms 329600 KB Time limit exceeded
2 Halted 0 ms 0 KB -