제출 #1132799

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1132799		justintjitra	Table Tennis (info1cup20_tabletennis)	C++20	0 / 100	55 ms	4280 KiB

tabletennis

// Be Still, and Know That I Am God.
// Psalms 46:10
#include <bits/stdc++.h>
#include <iostream>
#define int long long
#define ld long double
#define fr first
#define sc second
#define pii pair<int, int>
#define tii tuple<int, int, int>
#define pb push_back
#define all(v) v.begin(), v.end()
using namespace std;

//Euler's
// const int MOD=1e9+7;

const int MOD=998244353;

int fastexpo(int a, int b){
    if(b==0) return 1;
    int ret = (fastexpo(a,b/2)%MOD);
    if(b%2){
        return (((ret*ret)%MOD*a%MOD)%MOD);
    }
    else{
        return ((ret*ret)%MOD);
    }
}

//sort by second element
bool comp(pair<int,int> &a, pair<int,int> &b){
    return (a.second<b.second);
}
bool sortbyCond(const pair<int, int>& a,
                const pair<int, int>& b)
{
    if (a.first != b.first)
        return (a.first > b.first);
    else
       return (a.second < b.second);
}

//Interactive
// char ask(int a, int b, int c, int d){
//     cout<<"? "<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
//     char s; cin>>s;
//     return s;
// }


const int N=1e5+5;
const int INF=1e9+2;


// int spf[N];
// void sieve()
// {
//     int MAXN = N;
//     spf[1] = 1;
//     for (int i=2; i<MAXN; i++){
//         spf[i] = i;
//     }
 
//     for (int i=4; i<MAXN; i+=2){
//         spf[i] = 2;
//     }
 
//     for (int i=3; i*i<MAXN; i++)
//     {
//         if (spf[i] == i)
//         {
//             for (int j=i*i; j<MAXN; j+=i){
 
//                 if (spf[j]==j)
//                     spf[j] = i;
//             }
//         }
//     }
// }



void solve(){
    int n,k; cin>>n>>k;
    int arr[n+k];
    for(int i=0;i<n+k;i++){
        cin>>arr[i];
    }
    for(int i=0;i<k;i++){
        for(int j=n;j<n+k;j++){
            if(i>=j)continue;
            vector<int>ans;
            int l=i,r=j;
            int sum=arr[l]+arr[r];
            while(l<=r){
                if(sum==arr[l]+arr[r]){
                    ans.push_back(arr[l]);
                    ans.push_back(arr[r]);
                    l++;
                    r--;
                    if(ans.size()==n){
                        sort(ans.begin(),ans.end());
                        for(int k=0;k<ans.size();k++){
                            cout<<ans[k]<<" ";
                        }
                        // cout<<i<<" "<<j<<endl;
                        // cout<<"bruh"<<endl;
                        return;
                    }   
                }
                else if(arr[l]+arr[r]>sum){
                    r--;
                }
                else if(arr[l]+arr[r]<sum){
                    l++;
                }
            }
            if(ans.size()==n){
                sort(ans.begin(),ans.end());
                for(int k=0;k<ans.size();k++){
                    cout<<ans[k]<<" ";
                }
                return;
            }
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cout.tie(NULL);
    cin.tie(NULL);
    int tc; 
    // sieve();
    tc=1;
    // cin>>tc;
    
    while (tc--) solve();
}

• 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