oj.uz

답안 #365898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365898 2021-02-12T13:43:57 Z ahmedfouadnew Table Tennis (info1cup20_tabletennis) C++17
20 / 100
 96 ms 5152 KB 
#include<bits/stdc++.h>
using namespace std;
#define s second
#define f first
#define pb push_back
#define int long long
int n,k;
int a[200001];
void fun1(int s,int e,int bal)
{
    vector<int>v;
    int idx=0,idx2=n-1;
    for(int i=0;i<n/2;i++)
    {
        if(a[idx]+a[idx2]!=bal)
        {
           if(a[idx]+a[idx2-1]==bal)
                idx2--;
           else if(a[idx+1]+a[idx2]==bal)
                idx++;
           else return;
        }
         v.pb(a[idx]);
        v.pb(a[idx2]);
        idx++,idx2--;
    }
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
    {
        cout<<v[i]<<" \n"[i+1==v.size()];
    }
    exit(0);
}
void fun2(int s,int e,int bal)
{
    vector<int>v;
    for(int i=1;i<(n+1)/2;++i)
    {
        if(a[i]+a[n-i]!=bal)
        {
            return;
        }
        v.pb(a[i]);
        v.pb(a[n-i]);
    }
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
    {
        cout<<v[i]<<" \n"[i+1==v.size()];
    }
    exit(0);
}
void fun3(int s,int e,int bal)
{
    vector<int>v;
    for(int i=0;i<(n-1)/2;i++)
    {
        if(a[i]+a[n-2-i]!=bal)
        {
            return;
        }

        v.pb(a[i]);
        v.pb(a[n-i-2]);
    }
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
    {
        cout<<v[i]<<" \n"[i+1==v.size()];
    }
    exit(0);
}
signed main()
{
    cin>>n>>k;
    n+=k;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    fun1(1,n-2,a[0]+a[n-1]);
    fun3(1,n-1,a[0]+a[n-2]);
    fun2(1,n,a[1]+a[n-1]);
   return 0;
}

Compilation message

tabletennis.cpp: In function 'void fun1(long long int, long long int, long long int)':
tabletennis.cpp:28:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
tabletennis.cpp:30:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         cout<<v[i]<<" \n"[i+1==v.size()];
      |                           ~~~^~~~~~~~~~
tabletennis.cpp: In function 'void fun2(long long int, long long int, long long int)':
tabletennis.cpp:47:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
tabletennis.cpp:49:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         cout<<v[i]<<" \n"[i+1==v.size()];
      |                           ~~~^~~~~~~~~~
tabletennis.cpp: In function 'void fun3(long long int, long long int, long long int)':
tabletennis.cpp:67:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
tabletennis.cpp:69:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         cout<<v[i]<<" \n"[i+1==v.size()];
      |                           ~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1000 KB Output is correct
2 Correct 92 ms 5152 KB Output is correct
3 Correct 96 ms 5136 KB Output is correct
4 Correct 93 ms 4700 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 14.0

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

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

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