Submission #1302001

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302001		yus1f_m	Table Tennis (info1cup20_tabletennis)	C++20	11 / 100	3095 ms	20508 KiB

tabletennis

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int sz=1000000,INF=1000000000;
using namespace std;
bool f(vector<ll>nums)
{
    ll sum=0;
    bool flag1=false,flag2=false,flag3=false;
    set<ll>Nums;
    map<ll,ll>counts;
    for(int i=0;i<nums.size();i++)
    {
        sum+=nums[i];
    }
    if(sum%(nums.size()/2)==0)
    {
        for(int i=0;i<nums.size();i++)
        {
            if(nums[i]>sum/(nums.size()/2))
            {
                flag1=true;
                break;
            }
        }
        if(!flag1)
        {
            for(int i=0;i<nums.size();i++)
            {
                Nums.in(nums[i]);
            }
            for(auto num:Nums)
            {
                if(Nums.find(sum/(nums.size()/2)-num)==Nums.end())
                {
                    flag2=true;
                    break;
                }
            }
            if(!flag2)
            {
                for(int i=0;i<nums.size();i++)
                {
                    counts[nums[i]]++;
                }
                for(int i=0;i<nums.size();i++)
                {
                    if(nums[i]!=sum/(nums.size()/2)-nums[i])
                    {
                        if(counts[nums[i]]!=counts[sum/(nums.size()/2)-nums[i]])
                        {
                            flag3=true;
                            break;
                        }
                    }
                    else
                    {
                        if(counts[nums[i]]%2!=0)
                        {
                            flag3=true;
                            break;
                        }
                    }
                }
                if(!flag3)
                {
                    return true;
                }
                else
                {
                    return false;
                }
            }
            else
            {
                return false;
            }
        }
        else
        {
            return false;
        }
    }
    else
    {
        return false;
    }
}
void solve()
{
    ll n,m,num;
    cin>>n>>m;
    vector<ll>nums,res,ans;
    for(int i=0;i<n+m;i++)
    {
        cin>>num;
        nums.pb(num);
    }
    sort(all(nums));
    for(int i=0;i<nums.size();i++)
    {
        res.clear();
        for(int j=0;j<nums.size();j++)
        {
            if(i!=j)
            {
                res.pb(nums[j]);
            }
        }
        if(f(res))
        {
            ans=res;
            break;
        }
    }
    for(int i=0;i<ans.size();i++)
    {
        cout<<ans[i]<<" ";
    }
}
int main()
{
    fastIO;
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

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