# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717307 | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3076 ms | 3844 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 int long long
#define endl '\n'
const int M = 3e6+5, MOD = 998244353;
int ar[M], ind[M];
signed main() {
cin.tie(0)->sync_with_stdio(0);
int n, k;
cin >> n >> k;
n += k;
vector<int> v(n);
for (int &i:v) cin >> i;
for (int i = 0; i < n; i++) ar[i] = v[i];
for (int i = 0; i < n; i++) ind[i] = i;
sort(ind, ind+n, [](int a, int b) {return ar[a] < ar[b];});
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
int x = v[i];
swap(v[i], v.back());
v.pop_back();
sort(v.begin(), v.end());
set<int> st;
for (int j = 0; 2*j < v.size(); j++) st.insert(v[j]+v[n-j-2]);
if (st.size() == 1) {
for (int j = 1; j <= n; j++) if (j != ind[i]+1) cout << j << ' '; cout << endl;
return 0;
}
v.push_back(x);
sort(v.begin(), v.end());
}
return 0;
}
/*
5 4
1 3 1
3 5 2
5 4 3
4 2 1
-1
2 2 2
*/
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... |