# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
373334 | 2021-03-04T07:00:10 Z | ahmedfouadnew | Table Tennis (info1cup20_tabletennis) | C++17 | 500 ms | 42868 KB |
#include<bits/stdc++.h> using namespace std; #define s second #define f first #define pb push_back //#define int long long //#define double long double int n,k; int a[200005]; unordered_map<int,int>mp; unordered_map<int,int>mp2; int mx,mxi; bool okk; void fun(int ii,int s,int e) { if(okk) return; e=min(e,n+k-1); s=max(0,s); for(int i=s;i<=e;i++) { if(i==ii) continue; mp[a[ii]+a[i]]++; if(mp[a[ii]+a[i]]>mx) { mx=mp[a[ii]+a[i]]; mxi=a[ii]+a[i]; } if(mp[a[ii]+a[i]]>k*2) { okk=1; break; } } } signed main() { scanf("%d%d",&n,&k); for(int i=0;i<n+k;i++) { scanf("%d",a+i); mp2[a[i]]=1; } sort(a,a+n+k); for(int i=0;i<n+k;i++) { fun(i,(n+k-1-i)-k-1,(n+k-1-i)+k+1); } vector<int>ans; int cnt=n; int e=n+k-1; for(int i=0;i<n+k;i++) { if(mp2[mxi-a[i]]) { cnt-=2; ans.pb(a[i]); ans.pb(mxi-a[i]); } if(cnt==0) break; } sort(ans.begin(),ans.end()); for(int i=0;i<ans.size();i++) { if(i) printf(" "); printf("%d",ans[i]); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 492 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 1644 KB | Output not subsequence of input |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 125 ms | 12212 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 748 KB | Output is correct |
2 | Correct | 3 ms | 876 KB | Output is correct |
3 | Correct | 4 ms | 876 KB | Output is correct |
4 | Correct | 3 ms | 748 KB | Output is correct |
5 | Correct | 4 ms | 876 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 2 ms | 492 KB | Output not subsequence of input |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Correct | 110 ms | 10804 KB | Output is correct |
3 | Correct | 98 ms | 10804 KB | Output is correct |
4 | Incorrect | 135 ms | 15284 KB | Unexpected end of file - int32 expected |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 4240 KB | Output is correct |
2 | Correct | 500 ms | 42868 KB | Output is correct |
3 | Correct | 451 ms | 36400 KB | Output is correct |
4 | Correct | 389 ms | 37236 KB | Output is correct |
5 | Incorrect | 205 ms | 19272 KB | Unexpected end of file - int32 expected |
6 | Halted | 0 ms | 0 KB | - |