제출 #679452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
679452		alexdd	Table Tennis (info1cup20_tabletennis)	C++17	72 / 100	3089 ms	329392 KiB

tabletennis

#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
//#define int long long
int n,k;
unordered_map<int,int> fr;
unordered_map<int,int> fr1;
int mxm,unde;
int a[160001];
vector<int> rez;
void npat()
{
    for(int i=1;i<=n+k;i++)
    {
        for(int j=1;j<i;j++)
        {
            fr[a[i]+a[j]]++;
            if(fr[a[i]+a[j]] > mxm)
            {
                mxm = fr[a[i]+a[j]];
                unde = a[i]+a[j];
            }
        }
    }
    for(int i=1;i<=n+k;i++)
    {
        if(a[i]<unde-a[i] && fr1[unde-a[i]]>0 && rez.size()<n)
        {
            rez.push_back(a[i]);
            rez.push_back(unde-a[i]);
        }
    }
    sort(rez.begin(),rez.end());
    for(int i=0;i<n;i++)
        cout<<rez[i]<<" ";
}
unordered_map<int,bool> ver;
bool verif(int unde)
{
    if(ver[unde]==1)
        return 0;
    ver[unde]=1;
    int cnt=0;
    for(int i=1;i<=n+k;i++)
    {
        if(a[i]<unde-a[i] && fr1[unde-a[i]]>0)
        {
            cnt+=2;
        }
        if(a[i]>unde/2)
            break;
    }
    if(cnt>=n)
        return 1;
    return 0;
}
void afiseaza(int unde)
{
    for(int i=1;i<=n+k;i++)
    {
        if(a[i]<unde-a[i] && fr1[unde-a[i]]>0 && rez.size()<n)
        {
            rez.push_back(a[i]);
            rez.push_back(unde-a[i]);
        }
    }
    sort(rez.begin(),rez.end());
    for(int i=0;i<n;i++)
        cout<<rez[i]<<" ";
}
int vec1[401];
int vec2[401];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);

    cin>>n>>k;
    for(int i=1;i<=n+k;i++)
    {
        cin>>a[i];
        fr1[a[i]]++;
    }
    if(n<=1000)
        npat();
    else
    {
        sort(a+1,a+1+n+k);
        for(int i=0;i<=k;i++)
        {
            vec1[i]=i;
            vec2[i]=i;
        }
        random_shuffle(vec1,vec1+1+k);
        random_shuffle(vec2,vec2+1+k);
        for(int i=k;i>=0;i--)
        {
            for(int j=0;j<=k;j++)
            {
                if(vec1[i]+vec2[j]>k)
                    continue;
                if(verif(a[vec1[i]+1]+a[n+k-vec2[j]]))
                {
                    afiseaza(a[vec1[i]+1]+a[n+k-vec2[j]]);
                    return 0;
                }
            }
        }
    }
    return 0;
}
/**

*/

컴파일 시 표준 에러 (stderr) 메시지

tabletennis.cpp: In function 'void npat()':
tabletennis.cpp:27:60: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |         if(a[i]<unde-a[i] && fr1[unde-a[i]]>0 && rez.size()<n)
      |                                                  ~~~~~~~~~~^~
tabletennis.cpp: In function 'void afiseaza(int)':
tabletennis.cpp:61:60: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   61 |         if(a[i]<unde-a[i] && fr1[unde-a[i]]>0 && rez.size()<n)
      |                                                  ~~~~~~~~~~^~

• 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