oj.uz

답안 #365955

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365955 2021-02-12T15:13:15 Z Belal Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 258 ms 8044 KB 
#include <bits/stdc++.h>
using namespace std;
int arr[150405],arr2[150005],n,k;

bool fun(int idx,int x,int y,int sum){
    if(idx==n/2 && arr[x]+arr[y]==sum){
        arr2[idx-1]=arr[x];
        arr2[n-idx]=arr[y];
        return true;
    }
    if((x-idx+1+n-1-y-idx+1==k&&arr[x]+arr[y]!=sum)||y-1==x ||y==x){return false;}

    if(arr[x]+arr[y]==sum){
        if(fun(idx+1,x+1,y-1,sum)){
            arr2[idx-1]=arr[x];
            arr2[n-idx]=arr[y];
            return true;
        }
        else{return false;}
    }
    if(arr[x]+arr[y]>sum){return fun(idx,x,y-1,sum);}
    if(arr[x]+arr[y]<sum){return fun(idx,x+1,y,sum);}

}
int main() {
    cin>>n>>k;
    for(int i=0;i<n+k;i++){
        cin>>arr[i];
    }
    for(int i=0;i<=k;i++){
        for(int j=n+k-1;j>=i-1+n;j--){
            if(fun(1,i,j,arr[i]+arr[j])){
                cout<<arr2[0];
                for(int g=1;g<n;g++){
                    cout<<" "<<arr2[g];
                }
                return 0;
            }
        }
    }
    return 0;
}

Compilation message

tabletennis.cpp: In function 'bool fun(int, int, int, int)':
tabletennis.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^

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 1132 KB Output is correct
2 Correct 90 ms 8044 KB Output is correct
3 Correct 91 ms 7916 KB Output is correct
4 Correct 90 ms 7916 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 6508 KB Output is correct
2 Correct 90 ms 8044 KB Output is correct
3 Correct 89 ms 8044 KB Output is correct
4 Correct 88 ms 7916 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

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

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 91 ms 8044 KB Output is correct
3 Correct 92 ms 8044 KB Output is correct
4 Correct 90 ms 7916 KB Output is correct
5 Correct 89 ms 8044 KB Output is correct
6 Correct 89 ms 8044 KB Output is correct
7 Correct 91 ms 7916 KB Output is correct
8 Correct 90 ms 8044 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 396 KB Output is correct
2 Correct 258 ms 7972 KB Output is correct
3 Correct 90 ms 8044 KB Output is correct
4 Correct 157 ms 7916 KB Output is correct
5 Correct 93 ms 7916 KB Output is correct
6 Correct 98 ms 8044 KB Output is correct
7 Correct 183 ms 8044 KB Output is correct
8 Correct 88 ms 7916 KB Output is correct