# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524438 | maks007 | Table Tennis (info1cup20_tabletennis) | C++14 | 3099 ms | 4596 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define break_it (1/0)
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector <int> a(n+k);
function <int(vector <int>)> check=[&](vector <int> s) {
for(int i = 0; i < n; i ++) {
int j = i + 1;
if(j >= n or n - i - 1 < 0 or n - j - 1 < 0) break;
if(s[i] + s[n-i-1] == s[j]+s[n-j-1]) continue;
return 0;
}
return 1;
};
for(int i = 0; i < n+k; i ++) cin >> a[i];
if(k == 1) {
for(int i = 0; i < n + k; i ++) {
vector <int> v;
for(int j = 0; j < n + k; j ++) {
if(i == j) continue;
v.push_back(a[j]);
}
if(check(v)){
for(auto i : v) cout << i << " ";
return false;
}
}
}else if(n+k<=18) {
for(int i = 0; i < n; i ++) cout << a[i] << " ";
}else {
break_it;
int l = 0, r = n+k-1;
while(1) {
if(a[l] + a[r] == a[l+1]+a[r-1]) {
}
}
}
return false;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |