# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
718177 | 2023-04-03T14:30:52 Z | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 351568 KB |
#include "bits/stdc++.h" #define ll long long #define pb push_back #define endl '\n' #define fi first #define sec second using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); ll n,k; cin>>n>>k; map<ll,vector<ll>>mp; ll arr[n+k]; ll cnt=0,mx=0; for(int i=0;i<n+k;i++) { cin>>arr[i]; if(i) for(int j=0;j<i;j++) { mp[arr[i]+arr[j]].pb(arr[i]); mp[arr[i]+arr[j]].pb(arr[j]); if(mp[arr[i]+arr[j]].size()>mx) { mx=mp[arr[i]+arr[j]].size(); cnt=arr[i]+arr[j]; } } } vector<ll>ans; for(auto u:mp[cnt])ans.pb(u); sort(ans.begin(),ans.end()); for(auto u:ans)cout<<u<<' '; return 0; } /* */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1031 ms | 133060 KB | Output is correct |
2 | Correct | 303 ms | 42404 KB | Output is correct |
3 | Correct | 1397 ms | 167548 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3085 ms | 290080 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3093 ms | 338128 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 1236 KB | Output is correct |
2 | Correct | 7 ms | 2004 KB | Output is correct |
3 | Correct | 8 ms | 2104 KB | Output is correct |
4 | Correct | 7 ms | 1980 KB | Output is correct |
5 | Correct | 7 ms | 2004 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 320 KB | Output is correct |
3 | Correct | 1 ms | 316 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 370 ms | 46800 KB | Output is correct |
3 | Correct | 2335 ms | 207344 KB | Output is correct |
4 | Correct | 1653 ms | 172012 KB | Output is correct |
5 | Correct | 309 ms | 46664 KB | Output is correct |
6 | Incorrect | 345 ms | 42776 KB | Extra information in the output file |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Execution timed out | 3066 ms | 304192 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 48 ms | 10316 KB | Output is correct |
2 | Execution timed out | 3101 ms | 351568 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |