# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522967 | Farhan_HY | Table Tennis (info1cup20_tabletennis) | C++14 | 3072 ms | 1396 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>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(); cin.tie(0); cout.tie(0);
using namespace std;
const int inf = 8e18;
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
int a[N];
int n, m;
main()
{
cin >> n >> m;
if (m > 1) return 0;
for(int i = 0; i < n + m; i++)
cin >> a[i];
sort(a, a + n + m);
int ans = 0;
for(int i = 0; i < n + m; i++)
{
int l = 0, r = n + m - 1;
bool ok = true;
int x = a[n + m - 1] + a[0];
while(l < r)
{
if (l == i) l++;
if (r == i) r--;
ok &= (a[l++] + a[r--] == x);
}
if (ok) ans = i;
}
for(int i = 0; i < n + m; i++)
{
if (i != ans) cout << a[i] << ' ';
}
}
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... |