제출 #745815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
745815		vjudge1	Table Tennis (info1cup20_tabletennis)	C++17	35 / 100	3081 ms	181500 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
map<int, int> m;
vector<int> scores;
int n, k;

bool possible(int a, int b){
    int sum = scores[a] + scores[b];
    vector<int> square;
    for (int i=a; i<n+k; i++){
        if (scores[i] * 2 < sum && m[sum - scores[i]]){
            square.push_back(scores[i]);
        }
    }
    if (square.size() < n/2) return false;
    sort(square.begin(), square.end());
    for (int i=0; i<n/2; i++){
        cout << square[i] << " ";
    }
    for (int i=n/2-1; i>=0; i--){
        cout << sum - square[i] << " ";
    }
    return true;
}

int main()
{
    cin >> n >> k;
    scores.resize(n+k);
    for (int i=0; i<n+k; i++){
        cin >> scores[i];
        m[scores[i]]++;
    }
    for (int i=0; i<=k; i++){
        for (int j=i+1; j<n+k; j++){
            if (possible(i, j)){
                return 0;
            }
        }
    }
}

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

tabletennis.cpp: In function 'bool possible(int, int)':
tabletennis.cpp:15:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |     if (square.size() < n/2) return false;
      |         ~~~~~~~~~~~~~~^~~~~

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