제출 #481789

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481789		Yazan_Alattar	Table Tennis (info1cup20_tabletennis)	C++14	9 / 100	3068 ms	2376 KiB

tabletennis

#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

ll n, k, a[M], sum, ans;

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n + k; ++i) cin >> a[i];
    sort(a + 1, a + n + k + 1);
    for(int mask = 1; mask <= (1 << (n + k)); ++mask){
        vector <int> v;
        for(int i = 0; i < n + k; ++i) if((mask >> i) & 1) v.pb(a[i + 1]);
        if(v.size() != n) continue;
        int sum = v[0] + v.back(), wr = 0;
        for(int i = 0; i < n / 2; ++i) if(v[i] + v[n - i - 1] != sum) wr = 1;
        if(!wr){
            for(int i = 0; i < n + k; ++i) if((mask >> i) & 1) cout << a[i + 1] << " ";
            cout << endl;
            break;
        }
    }
    return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)

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

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:37:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   37 |         if(v.size() != n) continue;
      |            ~~~~~~~~~^~~~

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