# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685686 | heeheeheehaaw | Table Tennis (info1cup20_tabletennis) | C++17 | 162 ms | 5580 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 <iostream>
#include <algorithm>
#define int long long
using namespace std;
//ifstream cin("test.in");
//ofstream cout("test.out");
int n, k;
int v[200005];
pair<int, int> rez[200005];
bool possible(int sum)
{
int st = 0, dr = n + k - 1, cnt = 0;
while (st < dr && cnt < n / 2 && (dr - st + 1) / 2 + cnt >= n / 2) {
if (v[st] + v[dr] == sum)
rez[cnt++] = {st++, dr--};
else if (v[st] + v[dr] < sum)
st++;
else dr--;
}
return cnt >= n / 2;
}
void solve()
{
bool ok = false;
# | 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... |