oj.uz

Submission #752220

# Submission time Handle Problem Language Result Execution time Memory
752220 2023-06-02T14:12:05 Z AliHasanli Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 62 ms 5776 KB 
#include <bits/stdc++.h>
 
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 && u <= k)
    {
        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 && u <= k)
    {
        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 352 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1104 KB Output is correct
2 Correct 35 ms 5688 KB Output is correct
3 Correct 35 ms 5692 KB Output is correct
4 Correct 35 ms 5660 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 5696 KB Output is correct
2 Correct 32 ms 5692 KB Output is correct
3 Correct 32 ms 5752 KB Output is correct
4 Correct 31 ms 5700 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 34 ms 5704 KB Output is correct
3 Correct 32 ms 5644 KB Output is correct
4 Correct 34 ms 5696 KB Output is correct
5 Correct 33 ms 5700 KB Output is correct
6 Correct 36 ms 5776 KB Output is correct
7 Correct 32 ms 5676 KB Output is correct
8 Correct 33 ms 5704 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 45 ms 5632 KB Output is correct
3 Correct 34 ms 5612 KB Output is correct
4 Correct 47 ms 5704 KB Output is correct
5 Correct 36 ms 5600 KB Output is correct
6 Correct 44 ms 5700 KB Output is correct
7 Correct 62 ms 5680 KB Output is correct
8 Correct 31 ms 5700 KB Output is correct