Submission #365979

#	Time	Username	Problem	Language	Result	Execution time	Memory
365979		ahmedfouadnew	Table Tennis (info1cup20_tabletennis)	C++17	72 / 100	3086 ms	251368 KiB

tabletennis

#include<bits/stdc++.h>
using namespace std;
#define s second
#define f first
#define pb push_back
//#define int long long
int n,a[200001],k;
unordered_map<int,int>mp;
void fun(int bal)
{
    vector<int>v;
    for(int i=0;i<n+k;i++)
    {
        if(mp[bal-a[i]])
        {
            v.pb(a[i]);
        }
    }
    if(v.size()!=n) return;
    for(int i=0;i<v.size();i++)
    {
        if(i) printf(" ");
        printf("%d",v[i]);

    }
    exit(0);
}
signed main()
{
    scanf("%d%d",&n,&k);
    for(int i=0;i<n+k;i++)
    {
        scanf("%d",a+i);
        mp[a[i]]=1;
    }
    for(int i=0;i<=k+1;i++)
    {
        int cnt=100;
        while(cnt--)
        {
        int drgn=rand()%(k+1);
            fun(a[i]+a[n+k-1-drgn]);
        }
    }

   return 0;
}

Compilation message (stderr)

tabletennis.cpp: In function 'void fun(int)':
tabletennis.cpp:19:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |     if(v.size()!=n) return;
      |        ~~~~~~~~^~~
tabletennis.cpp:20:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
tabletennis.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |         scanf("%d",a+i);
      |         ~~~~~^~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13