제출 #690249

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
690249		Aiperiii	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	72 ms	3028 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,k;
    cin>>n>>k;
    vector <int> a(n+k);
    for(int i=0;i<n+k;i++){
        cin>>a[i];
    }
    sort(a.begin(),a.end());
    map <int,int> mp;
    for(int i=0;i<n+k-1;i++){
        mp[a[i+1]-a[i]]++;
    }
    int mx=0,dif;
    for(auto x : mp){
        if(x.second>mx){
            mx=x.second;
            dif=x.first;
        }
    }
    int cnt=0;
    for(auto x : mp){
        if(x.second==mx){
            cnt++;
        }
    }
    if(cnt==2){
        int id;
        for(int i=0;i<n+k-1;i++){
            if(a[i+1]-a[i]!=k){
                id=i+1;
                break;
            }
        }
        for(int i=0;i<n+k;i++){
            if(id!=i){
                cout<<a[i]<<" ";
            }
        }
        return 0;
    }
    if(a[1]-a[0]!=dif && a[2]-a[1]==dif){
        for(int i=1;i<n+k;i++){
            cout<<a[i]<<" ";
        }
    }
    else if(a[n+k-1]-a[n+k-2]!=dif && a[n+k-2]-a[n+k-3]==dif){
        for(int i=0;i<n+k-1;i++){
            cout<<a[i]<<" ";
        }
    }
    else{
        int id;
        for(int i=0;i<n+k-1;i++){
            if(a[i+1]-a[i]!=k){
                id=i+1;
                break;
            }
        }
        for(int i=0;i<n+k;i++){
            if(id!=i){
                cout<<a[i]<<" ";
            }
        }
    }
}

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

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:62:13: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
   62 |             if(id!=i){
      |             ^~
tabletennis.cpp:48:36: warning: 'dif' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |     else if(a[n+k-1]-a[n+k-2]!=dif && a[n+k-2]-a[n+k-3]==dif){
tabletennis.cpp:37:13: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |             if(id!=i){
      |             ^~

• Subtask 1: 0 / 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