oj.uz

답안 #523373

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523373 2022-02-07T14:54:24 Z Ahmed2me Table Tennis (info1cup20_tabletennis) C++17
0 / 100
 16 ms 1484 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()
{
    scanf("%d",&n);scanf("%d",&m);map<long long,bool>mp;
    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++)
        {
            mp[(a[i]+a[j])]=true;
        }
    }
    for(auto I:mp){if(good(I.first)){print_ans(I.first);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]<<' ';}
      |                 ~^~~~~~~~~~~
tabletennis.cpp: In function 'void solve()':
tabletennis.cpp:39:13: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
   39 |     scanf("%d",&n);scanf("%d",&m);map<long long,bool>mp;
      |            ~^  ~~
      |             |  |
      |             |  long long int*
      |             int*
      |            %lld
tabletennis.cpp:39:28: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
   39 |     scanf("%d",&n);scanf("%d",&m);map<long long,bool>mp;
      |                           ~^  ~~
      |                            |  |
      |                            |  long long int*
      |                            int*
      |                           %lld
tabletennis.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     scanf("%d",&n);scanf("%d",&m);map<long long,bool>mp;
      |     ~~~~~^~~~~~~~~
tabletennis.cpp:39:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     scanf("%d",&n);scanf("%d",&m);map<long long,bool>mp;
      |                    ~~~~~^~~~~~~~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 460 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 1484 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -