oj.uz

Submission #690791

# Submission time Handle Problem Language Result Execution time Memory
690791 2023-01-30T12:15:57 Z andrei_iorgulescu Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 66 ms 2976 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")

using namespace std;

int n,k,a[150500];
int sol[150005];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    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 + k; j >= n - 1; j--)
        {
            int sum = a[i] + a[j];
            int st = i + 1,dr = j - 1;
            int sz = 1;
            sol[0] = a[i];
            sol[1] = a[j];
            while (st < dr and sz < n - 1 and sz + (dr - st + 1) >= n - 1)
            {
                if (a[st] + a[dr] == sum)
                {
                    sol[++sz] = a[st];
                    sol[++sz] = a[dr];
                    st++;
                    dr--;
                }
                else if (a[st] + a[dr] > sum)
                    dr--;
                else
                    st++;
            }
            if (sz == n - 1)
            {
                sort(sol, sol + n);
                for (int j = 0; j < n; j++)
                    cout << sol[j] << ' ';
                return 0;
            }
        }
    }
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 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 4 ms 684 KB Output is correct
2 Correct 30 ms 2912 KB Output is correct
3 Correct 31 ms 2892 KB Output is correct
4 Correct 34 ms 2952 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 2848 KB Output is correct
2 Correct 34 ms 2960 KB Output is correct
3 Correct 30 ms 2900 KB Output is correct
4 Correct 31 ms 2968 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 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 0 ms 212 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 340 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 0 ms 212 KB Output is correct
2 Correct 30 ms 2896 KB Output is correct
3 Correct 31 ms 2924 KB Output is correct
4 Correct 30 ms 2860 KB Output is correct
5 Correct 29 ms 2864 KB Output is correct
6 Correct 30 ms 2900 KB Output is correct
7 Correct 30 ms 2904 KB Output is correct
8 Correct 35 ms 2920 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 50 ms 2948 KB Output is correct
3 Correct 30 ms 2844 KB Output is correct
4 Correct 54 ms 2952 KB Output is correct
5 Correct 30 ms 2904 KB Output is correct
6 Correct 31 ms 2976 KB Output is correct
7 Correct 66 ms 2960 KB Output is correct
8 Correct 32 ms 2968 KB Output is correct