# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717344 | 2023-04-01T21:14:22 Z | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 1048576 KB |
#include <bits/stdc++.h> #define endl '\n' #define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define int ll typedef long long ll; using namespace std; const int N = 15e4 + 10, mod = 1e9 + 7; int n, k, a[N]; map<int, vector<pair<int, int> > > vis; signed main() { FAST; cin >> n >> k; set<int> s; for(int i = 0; i < n + k; i++) cin >> a[i]; for(int i = 0; i < n + k - 1; i++) { for(int j = i + 1; j < n + k; j++) { vis[a[i] + a[j]].push_back({a[i], a[j]}); s.insert(a[i] + a[j]); } } int cur = 0, num = 0; for(auto it : s) { if(vis[it].size() > cur) { cur = vis[it].size(); num = it; } } vector<int> v; int i = 0; while(v.size() < n && i < vis[num].size()) { v.push_back(vis[num][i].first); v.push_back(vis[num][i].second); i++; } sort(v.begin(), v.end()); for(auto it : v) { cout << it << ' '; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1331 ms | 181576 KB | Output is correct |
2 | Correct | 205 ms | 42872 KB | Output is correct |
3 | Correct | 1661 ms | 233860 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3078 ms | 536136 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2958 ms | 1048576 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 1748 KB | Output is correct |
2 | Correct | 7 ms | 2636 KB | Output is correct |
3 | Correct | 11 ms | 2716 KB | Output is correct |
4 | Correct | 8 ms | 2756 KB | Output is correct |
5 | Correct | 9 ms | 2820 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 320 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 262 ms | 48944 KB | Output is correct |
3 | Correct | 2710 ms | 294696 KB | Output is correct |
4 | Correct | 1846 ms | 240168 KB | Output is correct |
5 | Correct | 248 ms | 48864 KB | Output is correct |
6 | Correct | 223 ms | 43924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Execution timed out | 3041 ms | 2444 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 78 ms | 14668 KB | Output is correct |
2 | Runtime error | 17 ms | 3788 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |