제출 #667587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
667587		ThegeekKnight16	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	3099 ms	16716 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1.5e5 + 10;
int atual[MAXN];
int v[MAXN];
int resp[MAXN];
bool FoundResp = false;

void bt(int id, int N, int K, int g1, int g2, int nG, int sG1, int sG2)
{
    if (g1 > (N / 2) || g2 > (N / 2) || nG > K) return;
    if (FoundResp) return;

    if (id == N+K+1)
    {
        if (g1 != g2 || nG != K) return;
        if (sG1 != sG2) return;
        for (int i = 1; i <= N + K; i++) resp[i] = atual[i];
        FoundResp = true;
        return;
    }

    atual[id] = 1;
    bt(id+1, N, K, g1+1, g2, nG, sG1 + v[id], sG2);
    bt(id+1, N, K, g1, g2+1, nG, sG1, sG2 + v[id]);
    atual[id] = 0;
    bt(id+1, N, K, g1, g2, nG+1, sG1, sG2);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, K;
    cin >> N >> K;
    for (int i = 1; i <= N + K; i++) cin >> v[i];
    bt(1, N, K, 0, 0, 0, 0, 0);
    for (int i = 1; i <= N+K; i++) if (resp[i]) cout << v[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