제출 #1145618

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1145618		dobri_oke	Table Tennis (info1cup20_tabletennis)	C++20	100 / 100	46 ms	3192 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 = 2e5+100, NN=19;
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];
    for(int i=1;i<=n+k;i++) cin >> a[i];
    for(int i=1;i<=k+1;i++){
        for(int j=n+k;j>=n;j--){
            int sum=a[i]+a[j], kk=i-1+(n+k-j);
            int l=i, r=j;
            while(l<r && kk<=k){
                if(a[l]+a[r]>sum){
                    kk++;
                    r--;
                }
                else if(a[l]+a[r]<sum){
                    kk++;
                    l++;
                }
                else{
                    l++;
                    r--;
                }
            }
            if(kk<=k){
                int l=i, r=j;
                vector < int > v;
                while(v.size()<n && l<r){
                    if(a[l]+a[r]>sum){
                        kk++;
                        r--;
                    }
                    else if(a[l]+a[r]<sum){
                        kk++;
                        l++;
                    }
                    else{
                        v.pb(l); v.pb(r);
                        l++;
                        r--;
                    }
                }
                sort(v.begin(), v.end());
                for(auto to : v) cout << a[to] << ' ';
                return 0;
            }
        }
    }
}

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 15 / 15
• Subtask 8: 13 / 13