# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
373319 | 2021-03-04T06:24:36 Z | ahmedfouadnew | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 126120 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]]>=n) { 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 | Correct | 2 ms | 492 KB | Output is correct |
2 | Correct | 2 ms | 492 KB | Output is correct |
3 | Correct | 2 ms | 492 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 1644 KB | Output is correct |
2 | Correct | 165 ms | 11828 KB | Output is correct |
3 | Correct | 160 ms | 11828 KB | Output is correct |
4 | Correct | 155 ms | 11828 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 162 ms | 10804 KB | Output is correct |
2 | Correct | 155 ms | 11316 KB | Output is correct |
3 | Correct | 158 ms | 10804 KB | Output is correct |
4 | Correct | 167 ms | 11316 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Correct | 3 ms | 876 KB | Output is correct |
3 | Correct | 2 ms | 748 KB | Output is correct |
4 | Correct | 3 ms | 748 KB | Output is correct |
5 | Correct | 3 ms | 748 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 | Correct | 6 ms | 492 KB | Output is correct |
3 | Correct | 11 ms | 2156 KB | Output is correct |
4 | Correct | 7 ms | 620 KB | Output is correct |
5 | Correct | 6 ms | 492 KB | Output is correct |
6 | Correct | 5 ms | 492 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1241 ms | 19004 KB | Output is correct |
3 | Correct | 490 ms | 18824 KB | Output is correct |
4 | Correct | 385 ms | 11060 KB | Output is correct |
5 | Correct | 461 ms | 18120 KB | Output is correct |
6 | Correct | 360 ms | 10804 KB | Output is correct |
7 | Correct | 369 ms | 10932 KB | Output is correct |
8 | Correct | 370 ms | 10904 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 876 KB | Output is correct |
2 | Execution timed out | 3088 ms | 126120 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |