Submission #1315534

#	Time	Username	Problem	Language	Result	Execution time	Memory
1315534		nikoloz-ch	Table Tennis (info1cup20_tabletennis)	C++20	9 / 100	3091 ms	1592 KiB

tabletennis

#include <bits/stdc++.h>
#define int int64_t
using namespace std;
bool dn = false; int n; vector<int> a;
void rec(int chk, int cnt, set<int> st){
    if(dn) return;
    if(cnt == n){
        for(auto &i : st) cout << a[i] << " ";
        cout << endl; dn = true;
        return;
    }
    for(int i = 0; i < a.size(); i++){
        if(st.find(i) != st.end()) continue;
        for(int j = 0; j < a.size(); j++){
            if(st.find(j) != st.end() or i == j or chk != a[i]+a[j]) continue;
            auto s = st;
            s.insert(i); s.insert(j);
            rec(chk,cnt+2,s);
        }
    }
}

inline void solve(){
    int k; cin >> n >> k; a.resize(n+k);
    for(auto &i : a) cin >> i;
    if(n <= 100 and k <= 100){
        for(int i = 0; i < a.size(); i++){
            for(int j = 0; j < a.size(); j++){
                if(i == j) continue;
                set<int> st; st.insert(i);st.insert(j);
                rec(a[i]+a[j],2,st);
            }
        }
        return;
    }
    cout << 67;
}

signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int _ = 1;// cin >> _; cout.tie(0);
    while(_--) solve();
}

• 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