Submission #1045017

#	Time	Username	Problem	Language	Result	Execution time	Memory
1045017		Malix	Table Tennis (info1cup20_tabletennis)	C++14	9 / 100	130 ms	3192 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

int n,k;
vi a,ans;

bool solve(int x){
    int l=0,r=n+k-1;ans.clear();
    while(l<r&&ans.size()<n){
        while(l<r&&a[l]+a[r]>x)r--;
        if(l<r&&a[l]+a[r]==x){
            ans.PB(a[l]);ans.PB(a[r]);
        }
        l++;
        if(r-l+ans.size()<n)break;
    }
    sort(ans.begin(),ans.end());
    return ans.size()==n;
}

int main() {   
    cin>>n>>k;a.resize(n+k);
    REP(i,0,n+k)cin>>a[i];
    REP(i,0,k+1)REP(j,n-1,n+k)if(solve(a[i]+a[j])){
        for(auto u:ans)cout<<u<<" ";
        return 0;
    }
    return 0;
}

Compilation message (stderr)

tabletennis.cpp: In function 'bool solve(int)':
tabletennis.cpp:29:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |     while(l<r&&ans.size()<n){
      |                ~~~~~~~~~~^~
tabletennis.cpp:35:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |         if(r-l+ans.size()<n)break;
      |            ~~~~~~~~~~~~~~^~
tabletennis.cpp:38:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |     return ans.size()==n;
      |            ~~~~~~~~~~^~~

• 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