제출 #480963

#제출 시각아이디문제언어결과실행 시간메모리
480963rk42745417Table Tennis (info1cup20_tabletennis)C++17
11 / 100
3076 ms4540 KiB
#include <bits/stdc++.h> using namespace std; #define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(0); using ll = int64_t; using uint = uint32_t; using ull = uint64_t; using ld = long double; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; const double EPS = 1e-8; const ll LINF = ll(1e18) + ll(1e15); static auto LamyIsCute = []() { EmiliaMyWife return 48763; }(); signed main() { int n, k; cin >> n >> k; assert(k == 1); vector<int> arr(n + k); for(int &x : arr) cin >> x; for(int i = 0; i < n + k; i++) { vector<int> x; for(int j = 0; j < n + k; j++) if(i != j) x.push_back(arr[j]); ll s = 0; for(int j = 0; j < n / 2; j++) { if(s == 0) s = x[j] + x[n - j - 1]; else if(s != x[j] + x[n - j - 1]) s = -1; } if(~s) { for(int a : x) cout << a << ' '; cout << '\n'; 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...