Submission #756214

#	Time	Username	Problem	Language	Result	Execution time	Memory
756214		Alkarat	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	19 ms	2260 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,k,a[N];
vector<int>g;
map<int,int>ck;
bool check(int l,int r)
{
    int sum=a[l]+a[r];
    g.clear();
    while(l<r)
    {
        if(a[l]+a[r]==sum) 
        {
            g.push_back(a[l]);
            g.push_back(a[r]);
            l++;
            r--;
        }
        else if(a[l]+a[r]>sum) r--;
        else l++;
    }
    if(g.size()==n)
    {
        sort(g.begin(),g.end());
        for(int e:g) cout<<e<<" ";
        exit(0);
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    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>=i+n-1; j--) check(i,j);
}

Compilation message (stderr)

tabletennis.cpp: In function 'bool check(int, int)':
tabletennis.cpp:23:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |     if(g.size()==n)
      |        ~~~~~~~~^~~
tabletennis.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
   29 | }
      | ^

• 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