oj.uz

Submission #373233

# Submission time Handle Problem Language Result Execution time Memory
373233 2021-03-03T21:55:45 Z ahmedfouadnew Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 121892 KB 
#include<bits/stdc++.h>
using namespace std;
#define s second
#define f first
#define pb push_back
#define int long long
#define double long double
int n,k;
int a[200005];
unordered_map<int,int>mp;
int mx,mxi;
void fun(int ii,int s,int e)
{
    e=min(e,n+k-1);
    s=max(0ll,s);
    for(int i=s;i<=e;i++)
    {
        if(i==ii) continue;
        mp[a[ii]+a[i]]++;
        if(mp[a[ii]+a[i]]>mx)
        {
            mx=mp[a[ii]+a[i]];
            mxi=a[ii]+a[i];
        }
    }
}
signed main()
{
  cin>>n>>k;
  for(int i=0;i<n+k;i++)
  {
      cin>>a[i];
  }
  sort(a,a+n+k);
  for(int i=0;i<n+k;i++)
  {
      fun(i,(n+k-1-i)-k-1,(n+k-1-i)+k+1);
  }
  vector<int>ans;
  int cnt=n;
  int e=n+k-1;
  for(int i=0;i<n+k;i++)
  {
      int cur=e;
      bool ok=0;
      while(e-cur<=k)
      {
          if(a[i]+a[cur]==mxi)
          {
              ok=1;
              ans.pb(a[i]);
              ans.pb(a[cur]);
              break;
          }
          cur--;
      }
      if(ok)
      {
          cnt-=2;
          e=cur-1;
      }
      if(cnt==0) break;
  }
  sort(ans.begin(),ans.end());
  for(int i=0;i<ans.size();i++)
  {
      cout<<ans[i]<<" \n"[i+1==ans.size()];
  }
     return 0;
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:65:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   for(int i=0;i<ans.size();i++)
      |               ~^~~~~~~~~~~
tabletennis.cpp:67:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |       cout<<ans[i]<<" \n"[i+1==ans.size()];
      |                           ~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1000 KB Output is correct
2 Correct 127 ms 6876 KB Output is correct
3 Correct 128 ms 6876 KB Output is correct
4 Correct 132 ms 6788 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 4316 KB Output is correct
2 Correct 132 ms 6368 KB Output is correct
3 Correct 140 ms 5752 KB Output is correct
4 Correct 128 ms 6144 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 3 ms 876 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 3 ms 876 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 5 ms 492 KB Output is correct
3 Correct 10 ms 2040 KB Output is correct
4 Correct 6 ms 620 KB Output is correct
5 Correct 5 ms 492 KB Output is correct
6 Correct 5 ms 364 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1076 ms 14932 KB Output is correct
3 Correct 517 ms 14640 KB Output is correct
4 Correct 319 ms 5852 KB Output is correct
5 Correct 376 ms 14004 KB Output is correct
6 Correct 309 ms 5848 KB Output is correct
7 Correct 325 ms 5984 KB Output is correct
8 Correct 295 ms 5852 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4240 KB Output is correct
2 Execution timed out 3055 ms 121892 KB Time limit exceeded
3 Halted 0 ms 0 KB -