# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
524640 | 2022-02-09T17:38:46 Z | amin | Table Tennis (info1cup20_tabletennis) | C++14 | 98 ms | 5720 KB |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long n,k; cin>>n>>k; long long a[n+k]; for(long i=0;i<n+k;i++) { cin>>a[i]; } long long sum; long long j=0; long long ans=0; long long p=0; long long l,r; for(long i=0;i<=k;i++) { for(long y=i+n-1;y<n+k;y++) { j=0; ans=0; p=0; sum=a[i]+a[y]; r=y-1; l=i+1; ans=2; while(l<r) { if(p>k) { break; } if(a[l]+a[r]>sum) { r--; p++; continue; } if(a[l]+a[r]<sum) { p++; l++; continue; } if(a[l]+a[r]==sum) { ans+=2; l++; r--; if(ans>=n) { j=1; break; } continue; } } if(j==1) { break; } } if(j==1) { break; } } l=0; r=n+k-1; ans=0; p=0; vector<long long>v; while(l<r) { if(a[l]+a[r]>sum) { r--; continue; } if(a[l]+a[r]<sum) { p++; l++; continue; } if(a[l]+a[r]==sum) { ans+=2; v.push_back(a[l]); v.push_back(a[r]); l++; r--; if(ans>=n) { j=1; break; } continue; } } sort(v.begin(),v.end()); for(long i=0;i<n;i++) { cout<<v[i]<<' '; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 848 KB | Output is correct |
2 | Correct | 35 ms | 4284 KB | Output is correct |
3 | Correct | 30 ms | 4152 KB | Output is correct |
4 | Correct | 30 ms | 4160 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 4160 KB | Output is correct |
2 | Correct | 32 ms | 4692 KB | Output is correct |
3 | Correct | 33 ms | 4748 KB | Output is correct |
4 | Correct | 32 ms | 4704 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 2 ms | 296 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 2 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 312 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 332 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 332 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 31 ms | 4284 KB | Output is correct |
3 | Correct | 31 ms | 5664 KB | Output is correct |
4 | Correct | 43 ms | 5692 KB | Output is correct |
5 | Correct | 32 ms | 5668 KB | Output is correct |
6 | Correct | 34 ms | 5720 KB | Output is correct |
7 | Correct | 31 ms | 5644 KB | Output is correct |
8 | Correct | 38 ms | 5664 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 98 ms | 4276 KB | Output is correct |
3 | Correct | 33 ms | 5668 KB | Output is correct |
4 | Correct | 58 ms | 5580 KB | Output is correct |
5 | Correct | 36 ms | 5660 KB | Output is correct |
6 | Correct | 39 ms | 5692 KB | Output is correct |
7 | Correct | 81 ms | 5716 KB | Output is correct |
8 | Correct | 35 ms | 5676 KB | Output is correct |