oj.uz

Submission #889359

# Submission time Handle Problem Language Result Execution time Memory
889359 2023-12-19T13:21:49 Z aykhn Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 5844 KB 
#include <bits/stdc++.h>
 
// author: aykhn
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
 
#define OPT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(v) v.begin(), v.end()
#define mpr make_pair
#define eb emplace_back
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define ins insert
#define int ll
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount
 
int n, k;
int N;
vector<int> v;
 
bool solve(int l, int r, int u)
{
    l++;
    r--;
    if (l > r) return true;
 
    int pl = l - 1;
    int pr = r + 1;
    int cnt = 1;
 
    while (l < r)
    {
        if (v[pr] - v[r] < v[l] - v[pl])
        {
            r--;
            u++;
        }
        else if (v[pr] - v[r] > v[l] - v[pl])
        {
            l++;
            u++;
        }
        else
        {
            pl = l;
            pr = r;
            l++;
            r--;
            cnt++;
        }
    }
 
    if (cnt >= n/2) return true;
    return false;
}
 
void answer(int l, int r, int u)
{
    vector<int> res;
    res.pb(v[l]);
    res.pb(v[r]);
    l++;
    r--;
 
    int pl = l - 1;
    int pr = r + 1;
    int cnt = 1;
 
    while (l < r)
    {
        if (v[pr] - v[r] < v[l] - v[pl])
        {
            r--;
            u++;
        }
        else if (v[pr] - v[r] > v[l] - v[pl])
        {
            l++;
            u++;
        }
        else
        {
            res.pb(v[l]);
            res.pb(v[r]);
            pl = l;
            pr = r;
            l++;
            r--;
            cnt++;
        }
    }
    sort(all(res));
    for (int i = 0; i < n; i++)
    {
        cout << res[i] << " ";
    }
    cout << endl;
}
 
void _()
{
    cin >> n >> k;
    N = n + k;
    v.assign(N + 1, 0);
 
    for (int i = 1; i <= N; i++) cin >> v[i];
 
    for (int i = 0; i <= k; i++)
    {
        for (int j = 0; j + i <= k; j++)
        {
            if (solve(i + 1, N - j, i + j))
            {
                answer(i + 1, N - j, i + j);
                return;
            }
        }
    }
}
int32_t main()
{
    OPT;
    _();
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1248 KB Output is correct
2 Correct 28 ms 5832 KB Output is correct
3 Correct 26 ms 5832 KB Output is correct
4 Correct 26 ms 5832 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 5844 KB Output is correct
2 Correct 27 ms 5688 KB Output is correct
3 Correct 27 ms 5832 KB Output is correct
4 Correct 26 ms 5832 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 144 ms 5776 KB Output is correct
3 Correct 35 ms 5668 KB Output is correct
4 Correct 45 ms 5836 KB Output is correct
5 Correct 27 ms 5836 KB Output is correct
6 Correct 41 ms 5840 KB Output is correct
7 Correct 42 ms 5832 KB Output is correct
8 Correct 38 ms 5832 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Execution timed out 3082 ms 3036 KB Time limit exceeded
3 Halted 0 ms 0 KB -