oj.uz

Submission #555833

# Submission time Handle Problem Language Result Execution time Memory
555833 2022-05-01T16:09:04 Z colossal_pepe Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 301 ms 2976 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int n, m;
vector<int> v;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    v.resize(n + m);
    for (int i = 0; i < n + m; i++) {
        cin >> v[i];
    }
    vector<int> ans(n);
    for (int i = (n / 2) - 1; i <= (n / 2) - 1 + m; i++) {
        int s = v[i] + v[i + 1], l = 0, r = n + m - 1, j = 0;
        while (l < r and j < n / 2) {
            while (r > l and v[l] + v[r] > s) r--;
            if (l < r and v[l] + v[r] == s) {
                ans[j] = v[l], ans[n - j - 1] = v[r];
                j++;
            }
            l++;
        }
        if (j < n / 2) continue;
        for (int x : ans) {
            cout << x << ' ';
        }
        cout << '\n';
        break;
    }
    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 596 KB Output is correct
2 Correct 28 ms 2960 KB Output is correct
3 Correct 28 ms 2964 KB Output is correct
4 Correct 29 ms 2892 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 2960 KB Output is correct
2 Correct 45 ms 2892 KB Output is correct
3 Correct 29 ms 2976 KB Output is correct
4 Correct 33 ms 2868 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 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 1 ms 212 KB Output is correct
2 Correct 36 ms 2928 KB Output is correct
3 Correct 26 ms 2972 KB Output is correct
4 Correct 28 ms 2896 KB Output is correct
5 Correct 28 ms 2964 KB Output is correct
6 Correct 28 ms 2912 KB Output is correct
7 Correct 30 ms 2972 KB Output is correct
8 Correct 31 ms 2916 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 301 ms 2912 KB Output is correct
3 Correct 27 ms 2900 KB Output is correct
4 Correct 77 ms 2964 KB Output is correct
5 Correct 42 ms 2960 KB Output is correct
6 Correct 28 ms 2892 KB Output is correct
7 Correct 78 ms 2960 KB Output is correct
8 Correct 68 ms 2896 KB Output is correct