Submission #1197922

#TimeUsernameProblemLanguageResultExecution timeMemory
1197922ezzzayTable Tennis (info1cup20_tabletennis)C++20
0 / 100
3090 ms1928 KiB
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
int a[N];
signed main(){
    int n,k;
    cin>>n>>k;
    for(int i=0;i<n+k;i++){
        cin>>a[i];
    }
    for(int i=0;i<(1<<(n+k));i++){
        vector< pair<int,int> >v;
        for(int j=0;j<n+k;j++){
            if(i & (1<<j)){
                v.pb({a[j],j});
            }
        }
        sort(v.begin(),v.end());
        if(v.size()==n){
            set<int>st;
            for(int j=0;j<n/2;j++){
                st.insert(a[j]+a[n-j-1]);
            }
            if(st.size()==1){
               for(int j=0;j<n+k;j++){
                    if(i & (1<<j)){
                        
                        cout<<j+1<<" ";
                    }
                }
                return 0;
            }
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...