제출 #1319843

#제출 시각아이디문제언어결과실행 시간메모리
1319843lernTable Tennis (info1cup20_tabletennis)C++20
0 / 100
15 ms4048 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long signed main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n,k; cin>>n>>k; int a[n + k]; for (int i = 0; i < n + k; i++) { cin>>a[i]; } vector<pair<int,int>> q = {{0, -1}, {-1, n + k - 1}, {0, n + k - 1}}; for (auto i : q) { int q1 = i.first, q2 = i.second; vector<long long> b; for (int i = 0; i < n + k; i++) { if (i != q1 && i != q2) b.push_back(a[i]); } int l = 0, r = b.size()-1; bool ok = 1; int sum = b[l] + b[r]; while (l < r) { if((a[l] + a[r]) != sum){ ok = 0; break; } l++; r--; } if(ok){ for (int j = 0; j < b.size(); j++) { std::cout << b[j] << " "; } return 0; } } 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...