# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
216191 | 2020-03-26T21:29:08 Z | Pajaraja | Table Tennis (info1cup20_tabletennis) | C++17 | 626 ms | 5508 KB |
#include <bits/stdc++.h> #define MAXN 200007 #define MAXK 407 using namespace std; int a[MAXN],n,k,m; mt19937 rng(time(NULL)); bool check(int s) { int t1=1,t2=m; vector<pair<int,int> > p; while(t1<t2) { if(a[t1]+a[t2]==s) p.push_back({t1,t2}); if(a[t1]+a[t2]<=s) t1++; if(a[t1]+a[t2]>s) t2--; } if(p.size()<n/2) return false; for(int i=0;i<n/2;i++) printf("%d ",a[p[i].first]); for(int i=n/2-1;i>=0;i--) printf("%d ",a[p[i].second]); return true; } int main() { scanf("%d%d",&n,&k); m=n+k; for(int i=1;i<=m;i++) scanf("%d",&a[i]); if(n>k) { bool found=false; while(!found) { int x=rng()%m+1; for(int i=max(m+1-x-k,1);i<=min(m+1-x+k,m) && !found;i++) found=check(a[i]+a[x]); } } else { bool found=false; for(int i=1;i<=k+1 && !found;i++) for(int j=m;j>=m-k-1 && !found;j--) found=check(a[i]+a[j]); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 816 KB | Output is correct |
2 | Correct | 52 ms | 4772 KB | Output is correct |
3 | Correct | 46 ms | 4588 KB | Output is correct |
4 | Correct | 45 ms | 4588 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 44 ms | 3112 KB | Output is correct |
2 | Correct | 47 ms | 4588 KB | Output is correct |
3 | Correct | 47 ms | 4624 KB | Output is correct |
4 | Correct | 44 ms | 4588 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 8 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 6 ms | 384 KB | Output is correct |
5 | Correct | 4 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
3 | Correct | 4 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 5 ms | 384 KB | Output is correct |
5 | Correct | 5 ms | 384 KB | Output is correct |
6 | Correct | 5 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 256 KB | Output is correct |
2 | Correct | 69 ms | 4604 KB | Output is correct |
3 | Correct | 45 ms | 4588 KB | Output is correct |
4 | Correct | 50 ms | 4540 KB | Output is correct |
5 | Correct | 47 ms | 4636 KB | Output is correct |
6 | Correct | 55 ms | 5488 KB | Output is correct |
7 | Correct | 48 ms | 4588 KB | Output is correct |
8 | Correct | 49 ms | 4588 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 626 ms | 4584 KB | Output is correct |
3 | Correct | 44 ms | 4588 KB | Output is correct |
4 | Correct | 147 ms | 4588 KB | Output is correct |
5 | Correct | 160 ms | 4640 KB | Output is correct |
6 | Correct | 56 ms | 5508 KB | Output is correct |
7 | Correct | 141 ms | 4588 KB | Output is correct |
8 | Correct | 155 ms | 4588 KB | Output is correct |