# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717359 | 2023-04-01T21:37:26 Z | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 969948 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; void solve() { return; } signed main() { FAST; cin >> n >> k; int num = 0; for(int i = 0; i < n + k; i++) cin >> a[i]; if(k == 1) { solve(); return 0; } 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]}); if(vis[a[i] + a[j]].size() >= n / 2) num = a[i] + a[j]; } } 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 | Incorrect | 1 ms | 420 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 468 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3089 ms | 969948 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 1236 KB | Output is correct |
2 | Correct | 5 ms | 2004 KB | Output is correct |
3 | Correct | 6 ms | 2024 KB | Output is correct |
4 | Correct | 5 ms | 2004 KB | Output is correct |
5 | Correct | 6 ms | 2004 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 246 ms | 46604 KB | Output is correct |
3 | Correct | 1852 ms | 207436 KB | Output is correct |
4 | Correct | 1268 ms | 172004 KB | Output is correct |
5 | Correct | 215 ms | 46820 KB | Output is correct |
6 | Correct | 233 ms | 43140 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Execution timed out | 3049 ms | 1432 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 40 ms | 10288 KB | Output is correct |
2 | Runtime error | 16 ms | 2772 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |