oj.uz

Submission #365385

# Submission time Handle Problem Language Result Execution time Memory
365385 2021-02-11T14:40:57 Z jasen_penchev Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 92 ms 4832 KB 
#include <algorithm>
#include <iostream>
#include <vector>
#define endl '\n'
using namespace std;

const int MAXN = 150000;
const int MAXK = 400;

int a[MAXN + MAXK + 5];

int main()
{
    ios :: sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int N, K;
    cin >> N >> K;

    for (int i = 1; i <= N + K; ++ i)
    {
        cin >> a[i];
    }

    for (int i = 1; i <= K + 1; ++ i)
    {
        for (int j = N; j <= N + K; ++ j)
        {
            int i0 = i, j0 = j, cnt = 0;
            vector<int> v1, v2;
            while (i0 < j0 and (j0 - i0 + 1) / 2 + cnt >= N / 2 and cnt < N / 2)
            {
                if (a[i0] + a[j0] == a[i] + a[j])
                {
                    v1.push_back(i0);
                    v2.push_back(j0);
                    i0++;
                    j0--;
                    cnt++;
                }
                else if (a[i0] + a[j0] < a[i] + a[j]) i0++;
                else j0--;
            }

            if (cnt == N / 2)
            {
                reverse(v2.begin(), v2.end());
                for (auto it : v1)
                {
                    cout << a[it] << " ";
                }
                for (auto it : v2)
                {
                    cout << a[it] << " ";
                }
                cout << endl;
                return 0;
            }
        }
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 956 KB Output is correct
2 Correct 34 ms 4704 KB Output is correct
3 Correct 34 ms 4704 KB Output is correct
4 Correct 35 ms 4704 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 4704 KB Output is correct
2 Correct 35 ms 4704 KB Output is correct
3 Correct 38 ms 4704 KB Output is correct
4 Correct 37 ms 4704 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 396 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 412 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 39 ms 4772 KB Output is correct
3 Correct 35 ms 4724 KB Output is correct
4 Correct 37 ms 4680 KB Output is correct
5 Correct 34 ms 4704 KB Output is correct
6 Correct 36 ms 4832 KB Output is correct
7 Correct 38 ms 4704 KB Output is correct
8 Correct 38 ms 4704 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 63 ms 4704 KB Output is correct
3 Correct 35 ms 4704 KB Output is correct
4 Correct 60 ms 4704 KB Output is correct
5 Correct 70 ms 4708 KB Output is correct
6 Correct 36 ms 4728 KB Output is correct
7 Correct 92 ms 4688 KB Output is correct
8 Correct 43 ms 4704 KB Output is correct