제출 #845516

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

tabletennis

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a,b) for (int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()

const int max_N = 160005;
ll n = 0, k = 0;
ll sum = 0;
ll A[max_N];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> k;
    rep(i,n+k) cin >> A[i];

    if (n+k <= 18)
    {
        for (int i = 1; i < (1 << (n+k)); ++i)
        {
            vector<int> V;
            rep(j,n+k)
            {
                auto b = (1 << j) & i;
                if (b) V.pb(A[j]);
            }
            if (V.size() != n) continue;
            int S = V[0] + V.back();
            bool czy_OK = true;
            for (int j = 1; j < n/2; ++j) if (V[j] + V[n-j-1] != S) czy_OK = false;
            if (czy_OK == true)
            {
                rep(j,n+k)
                {
                    auto b = (1 << j) & i;
                    if (b) cout << A[j] << ' ';
                }
                cout << '\n';
                return 0;
            }
        }
        return 0;
    }
    rep(i,n) sum += A[i];
    rep(i,n+k)
    {
        ll il = sum - A[i];
        if (il % (ll)(n/2) == 0)
        {
            ll szukana = sum / n;
            bool czy_OK = true;
            vector<ll> V;
            rep(j,n+k) if (i != j) V.pb(A[j]);
            rep(j,n/2) if (V[j] + V[j+n/2] != szukana)
            {
                czy_OK = false;
                break;
            }
            if (czy_OK == true)
            {
                rep(j,n+k) if (i != j) cout << A[j] << ' ';
                return 0;
            }
        }
    }
    return 0;
}

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

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:32:26: 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]
   32 |             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