oj.uz

Submission #523368

# Submission time Handle Problem Language Result Execution time Memory
523368 2022-02-07T14:45:03 Z Ahmed2me Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 29484 KB 
#include <bits/stdc++.h>

using namespace std;

long long t=1,n,m,a[200020];

bool good(long long sum)
{
    long long i=1,j=n+m;
    long long cnt=false;
    while(i<j)
    {
        if(a[i]+a[j]==sum){cnt++;i++;j--;continue;}
        if(a[i]+a[j]>sum){j--;continue;}
        if(a[i]+a[j]<sum){i++;continue;}
    }
    return cnt>=(n/2);
}

void print_ans(long long sum)
{
    long long i=1;long long j=n+m;
    vector<long long>ans;
    long long counter=false;
    while(i<j)
    {
        if(counter>=(n/2)){break;}
        if(a[i]+a[j]==sum){counter++;ans.push_back(a[i]);ans.push_back(a[j]);i++;j--;continue;}
        if(a[i]+a[j]>sum){j--;continue;}
        if(a[i]+a[j]<sum){i++;continue;}
    }
    sort(ans.begin(),ans.end());
    for(int i=0;i<ans.size();i++){cout<<ans[i]<<' ';}
    return;
}

void solve()
{
    cin>>n>>m;set<int>st;
    for(int i=1;i<=n+m;i++){cin>>a[i];}
    for(int i=1;i<=min(n,2*m);i++)
    {
        for(int j=max(1ll,(n-m+1));j<=n+m;j++)
        {
            st.insert(a[i]+a[j]);
        }
    }
    for(auto I:st){if(good(I)){print_ans(I);return;}}
}

int main()
{
  ios::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
  while(t--){solve();}return 0;
}

Compilation message

tabletennis.cpp: In function 'void print_ans(long long int)':
tabletennis.cpp:33:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i=0;i<ans.size();i++){cout<<ans[i]<<' ';}
      |                 ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 976 KB Output is correct
2 Correct 32 ms 4204 KB Output is correct
3 Correct 39 ms 4212 KB Output is correct
4 Correct 33 ms 4284 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 4292 KB Output is correct
2 Correct 29 ms 4220 KB Output is correct
3 Correct 31 ms 4264 KB Output is correct
4 Correct 36 ms 4180 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 8 ms 952 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 5 ms 844 KB Output is correct
5 Correct 2 ms 716 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 827 ms 4764 KB Output is correct
3 Correct 37 ms 4272 KB Output is correct
4 Correct 67 ms 4192 KB Output is correct
5 Correct 37 ms 4172 KB Output is correct
6 Correct 69 ms 4304 KB Output is correct
7 Correct 80 ms 4308 KB Output is correct
8 Correct 68 ms 4180 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Execution timed out 3029 ms 29484 KB Time limit exceeded
3 Halted 0 ms 0 KB -