oj.uz

답안 #386562

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386562 2021-04-06T19:40:14 Z fadi57 Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 755 ms 5476 KB 
#include<bits/stdc++.h>
using namespace std;
const int mx=2e5+10;
typedef long long ll;
const int inf=1e9+3e5;
int a[mx];
map<int,int>mp;int n,k,z;
bool check(int s){

int l=0;int r=z-1;
int cnt=n/2;
while(l<r){

if(cnt==0){break;}
 if(((r-l+1)/2)<cnt){break;}
    if(a[l]+a[r]>s){r--;}
    else if(a[l]+a[r]<s){l++;} else{
            l++;
    r--;
    cnt--;
    }
}
if(cnt==0){return 1;}


return 0;
}

int main(){
 cin>>n>>k; z=n+k;


 for(int i=0;i<n+k;i++){
    cin>>a[i];
   

 }

 /*
 3 1
 1 1 1 1*/
 int teams=n/2;
 int aa;int bb;
 vector<int>v;
for(int i=0;i<=k;i++){


 for(int j=n-1;j<z;j++){
   v.push_back(a[i]+a[j]);

 }
}
sort(v.begin(),v.end());
int sum;
for(auto it:v){
   if(check(it)){
    sum=it;break;
   }
}//cout<<sum;
int l=0;int r=z-1;
int cnt=n/2;
vector<int>o;
while(l<r){

if(cnt==0){break;}

    if(a[l]+a[r]>sum){r--;}
    else if(a[l]+a[r]<sum){l++;} else{
           // cout<<a[l]<<" "<<a[r]<<" ";
            o.push_back(a[l]); o.push_back(a[r]);
            l++;
    r--;
    cnt--;
    }
}sort(o.begin(),o.end());
for(auto it:o){
        cout<<it<<" ";

}
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:42:6: warning: unused variable 'teams' [-Wunused-variable]
   42 |  int teams=n/2;
      |      ^~~~~
tabletennis.cpp:43:6: warning: unused variable 'aa' [-Wunused-variable]
   43 |  int aa;int bb;
      |      ^~
tabletennis.cpp:43:13: warning: unused variable 'bb' [-Wunused-variable]
   43 |  int aa;int bb;
      |             ^~
tabletennis.cpp:68:10: warning: 'sum' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |     else if(a[l]+a[r]<sum){l++;} else{
      |          ^~

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 13 ms 748 KB Output is correct
2 Correct 90 ms 3168 KB Output is correct
3 Correct 91 ms 3168 KB Output is correct
4 Correct 93 ms 3168 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 3168 KB Output is correct
2 Correct 92 ms 3168 KB Output is correct
3 Correct 91 ms 3252 KB Output is correct
4 Correct 92 ms 3296 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 3 ms 364 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

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 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 364 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 1 ms 364 KB Output is correct
2 Correct 92 ms 3168 KB Output is correct
3 Correct 92 ms 3168 KB Output is correct
4 Correct 94 ms 3168 KB Output is correct
5 Correct 90 ms 3168 KB Output is correct
6 Correct 90 ms 3296 KB Output is correct
7 Correct 91 ms 3296 KB Output is correct
8 Correct 90 ms 3076 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1508 KB Output is correct
2 Correct 201 ms 3848 KB Output is correct
3 Correct 110 ms 5304 KB Output is correct
4 Correct 138 ms 5220 KB Output is correct
5 Correct 755 ms 5232 KB Output is correct
6 Correct 103 ms 5476 KB Output is correct
7 Correct 183 ms 5220 KB Output is correct
8 Correct 139 ms 5248 KB Output is correct