제출 #679418

#제출 시각아이디문제언어결과실행 시간메모리
679418alexddTable Tennis (info1cup20_tabletennis)C++17
9 / 100
3106 ms329452 KiB
#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[150001];
vector<int> rez;
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);

    cin>>n>>k;
    mxm=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        fr1[a[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;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]<<" ";
    return 0;
}
/**

*/

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

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:33:60: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   33 |         if(a[i]<unde-a[i] && fr1[unde-a[i]]>0 && rez.size()<n)
      |                                                  ~~~~~~~~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...