Submission #1232174

#TimeUsernameProblemLanguageResultExecution timeMemory
1232174durdonaTable Tennis (info1cup20_tabletennis)C++17
0 / 100
32 ms836 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> arr(n + k); for (int i = 0; i < n + k; i++) { cin >> arr[i]; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); while (true) { int s=rng()%(n+k)+1, l=max(1, n+1-s), r=min(n+k, n+k*2+1-s); vector<int> ja; while (l < r && ja.size() < n) { if (arr[l] + arr[r] < s) { l++; } else if (arr[l] + arr[r] > s) { r--; } else { ja.push_back(arr[l]); ja.push_back(arr[r]); l++; r--; } } sort(ja.begin(), ja.end()); for (int x : ja) cout << x << ' '; break; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...