제출 #910966

#제출 시각아이디문제언어결과실행 시간메모리
910966vjudge1Table Tennis (info1cup20_tabletennis)C++17
0 / 100
3092 ms2916 KiB
#include <iostream> #include <algorithm> using namespace std; #define MAXN 150000 #define MAXK 400 int v[MAXN+MAXK+1]; int sol[MAXN+1]; int main() { int n, k; cin>>n>>k; int i; long long sum; sum=0; for(i=1; i<=n+k; i++) { cin>>v[i]; sum+=v[i]; } int p, ok, csum, j; do { p=1; for(j=1; j<=n; j++) sol[p++]=v[j]; p=n; csum=sol[j]+sol[p]; p--; ok=1; for(j=2; j<=n/2; j++) { if(sol[j]+sol[p]==csum) ok++; p--; } if(ok==n/2) break; } while(next_permutation(v+1, v+n+k+1)); for(i=1; i<=n; i++) cout<<sol[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...