oj.uz

Submission #373236

# Submission time Handle Problem Language Result Execution time Memory
373236 2021-03-03T22:03:11 Z ahmedfouadnew Table Tennis (info1cup20_tabletennis) C++17
49 / 100
 3000 ms 120336 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(0,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()
{
  scanf("%d%d",&n,&k);
  for(int i=0;i<n+k;i++)
  {
      scanf("%d",a+i);
  }
  sort(a,a+n+k);
  for(int i=0;i<(n)/2+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++)
  {
      if(i) printf(" ");
      printf("%d",ans[i]);
  }
     return 0;
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:65:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   for(int i=0;i<ans.size();i++)
      |               ~^~~~~~~~~~~
tabletennis.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |   scanf("%d%d",&n,&k);
      |   ~~~~~^~~~~~~~~~~~~~
tabletennis.cpp:32:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   32 |       scanf("%d",a+i);
      |       ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 364 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 3168 KB Output is correct
2 Correct 87 ms 3560 KB Output is correct
3 Correct 71 ms 3168 KB Output is correct
4 Correct 73 ms 3560 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 780 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 4 ms 876 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Correct 8 ms 2040 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Incorrect 3 ms 364 KB Unexpected end of file - int32 expected

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 550 ms 12468 KB Output is correct
3 Correct 235 ms 12120 KB Output is correct
4 Correct 160 ms 3296 KB Output is correct
5 Correct 207 ms 11444 KB Output is correct
6 Incorrect 137 ms 876 KB Unexpected end of file - int32 expected
7 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

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