제출 #1144950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1144950		dobri_oke	Table Tennis (info1cup20_tabletennis)	C++20	9 / 100	9 ms	1608 KiB

tabletennis

//#pragma GCC target ("avx2")   
//#pragma GCC optimize ("Ofast")   
#include <bits/stdc++.h>   
using namespace std;  
#define int long long  
#define F first 
#define S second 
#define pb push_back 
const int N = 1e6, NN=26;
const int mod=1e9+7;
//int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); }
//int lcm(int a, int b) { return a / gcd(a, b) * b; }
//int binpow(int a,int b){if(!b)return 1; if(b&1)return a*binpow(a,b-1)%mod; int x=binpow(a,b/2); return x*x%mod;}
signed main(){   
    ios_base::sync_with_stdio(0);   
    cin.tie(0);   
    cout.tie(0);
    int n, k;
    cin >> n >> k;
    int a[n+k+1];
    if(n+k<=18){
        for(int i=0;i<n+k;i++) cin >> a[i];
        for(int mask=0;mask<(1<<(n+k));mask++){
            vector < int > v;
            for(int i=0;i<n+k;i++){
                if(((mask>>i)&1)) v.pb(a[i]);
            }
            if(n!=v.size()) continue;
            bool b=0;
            for(int i=0;i<v.size()/2;i++){
                if(v[i]!=v[v.size()-i-1]) b=1;
            }
            if(b==1){
                for(auto to : v) cout << to << ' ';
                return 0;
            }
        }
    }
    for(int i=1;i<=n+k;i++) cin >> a[i];
}

• 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