Submission #745790

#TimeUsernameProblemLanguageResultExecution timeMemory
745790vjudge1Table Tennis (info1cup20_tabletennis)C++17
0 / 100
3075 ms65940 KiB
#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;
    for (int i=0; i<n/2; i++){
        cout << square[i] << " ";
    }
    for (int i=0; i<n/2; i++){
        cout << sum - square[i] << " ";
    }
}

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;
            }
        }
    }
}

Compilation message (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;
      |         ~~~~~~~~~~~~~~^~~~~
tabletennis.cpp:9:17: warning: control reaches end of non-void function [-Wreturn-type]
    9 |     vector<int> square;
      |                 ^~~~~~
#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...