제출 #523383

#제출 시각아이디문제언어결과실행 시간메모리
523383Ahmed2meTable Tennis (info1cup20_tabletennis)C++17
87 / 100
3090 ms28340 KiB
#include <bits/stdc++.h> using namespace std; int t=1,n,m; int a[200020]; bool good(int sum) { int i=1,j=n+m; int 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(int sum) { int i=1;int j=n+m; vector<int>ans; int 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++){printf("%d%c",ans[i],' ');} return; } void solve() { scanf("%d",&n);scanf("%d",&m);set<int>st; for(int i=1;i<=n+m;i++){scanf("%d",&a[i]);} for(int i=1;i<=min(n,2*m);i++) { for(int j=max(1,(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() { while(t--){solve();}return 0; }

컴파일 시 표준 에러 (stderr) 메시지

tabletennis.cpp: In function 'void print_ans(int)':
tabletennis.cpp:34:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i=0;i<ans.size();i++){printf("%d%c",ans[i],' ');}
      |                 ~^~~~~~~~~~~
tabletennis.cpp: In function 'void solve()':
tabletennis.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     scanf("%d",&n);scanf("%d",&m);set<int>st;
      |     ~~~~~^~~~~~~~~
tabletennis.cpp:40:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     scanf("%d",&n);scanf("%d",&m);set<int>st;
      |                    ~~~~~^~~~~~~~~
tabletennis.cpp:41:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     for(int i=1;i<=n+m;i++){scanf("%d",&a[i]);}
      |                             ~~~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...