oj.uz

Submission #717379

# Submission time Handle Problem Language Result Execution time Memory
717379 2023-04-01T21:57:46 Z MrM7md Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 329316 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 i=0;i<sz;i++){
      for(int j=0;j<v.size();j++){
         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;
         }
      }
   }
   int ans;
   for(int i=0;i<v.size();i++){
      if(h[i]>-1)ans=v[i];
      // cout<<pp[i].F<<' '<<pp[i].S;

   }

   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:38:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |       for(int j=0;j<v.size();j++){
      |                   ~^~~~~~~~~
tabletennis.cpp:52:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |    for(int i=0;i<v.size();i++){
      |                ~^~~~~~~~~
tabletennis.cpp:59:16: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   59 |       if(mp[ans-a[i]]&&ans-a[i]!=a[i])cout<<a[i]<<' ';
      |             ~~~^~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1364 KB Output is correct
2 Correct 210 ms 22056 KB Output is correct
3 Correct 259 ms 22008 KB Output is correct
4 Correct 243 ms 22016 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 418 ms 40120 KB Output is correct
2 Correct 434 ms 41836 KB Output is correct
3 Correct 419 ms 40120 KB Output is correct
4 Correct 444 ms 41800 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 24464 KB Output is correct
2 Correct 126 ms 19572 KB Output is correct
3 Correct 193 ms 22536 KB Output is correct
4 Correct 342 ms 39460 KB Output is correct
5 Correct 182 ms 22564 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 596 KB Output is correct
2 Correct 71 ms 9760 KB Output is correct
3 Correct 161 ms 20408 KB Output is correct
4 Correct 137 ms 19640 KB Output is correct
5 Correct 23 ms 2620 KB Output is correct
6 Correct 9 ms 1484 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Execution timed out 3097 ms 329316 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

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