oj.uz

Submission #418195

# Submission time Handle Problem Language Result Execution time Memory
418195 2021-06-05T08:07:49 Z dolphingarlic Table Tennis (info1cup20_tabletennis) C++14
72 / 100
 3000 ms 4592 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int n, k, a[150401];

void check(int pref, int suff) {
    vector<int> res;
    int lptr = pref + 1, rptr = suff - 1;
    int target = a[lptr] + a[rptr];
    while (lptr < rptr) {
        int sm = a[lptr] + a[rptr];
        if (sm == target) {
            res.push_back(lptr), res.push_back(rptr);
            lptr++, rptr--;
        } else if (sm < target) lptr++;
        else rptr++;
    }
    if (res.size() == n) {
        sort(res.begin(), res.end());
        for (int i : res) cout << a[i] << ' ';
        exit(0);
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;
    for (int i = 1; i <= n + k; i++) cin >> a[i];
    for (int i = 0; i <= k; i++)
        for (int j = 0; j <= k - i; j++)
            check(i, n + k + 1 - j);
    return 0;
}

Compilation message

tabletennis.cpp: In function 'void check(int, int)':
tabletennis.cpp:19:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |     if (res.size() == n) {
      |         ~~~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 964 KB Output is correct
2 Correct 42 ms 4544 KB Output is correct
3 Correct 42 ms 4504 KB Output is correct
4 Correct 41 ms 4472 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 4544 KB Output is correct
2 Correct 42 ms 4592 KB Output is correct
3 Correct 42 ms 4544 KB Output is correct
4 Correct 42 ms 4544 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 204 KB Output is correct
2 Correct 1574 ms 296 KB Output is correct
3 Correct 32 ms 204 KB Output is correct
4 Correct 1291 ms 304 KB Output is correct
5 Correct 37 ms 204 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 204 KB Output is correct
2 Correct 56 ms 332 KB Output is correct
3 Correct 7 ms 332 KB Output is correct
4 Correct 31 ms 332 KB Output is correct
5 Correct 9 ms 336 KB Output is correct
6 Correct 2 ms 332 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 204 KB Output is correct
2 Incorrect 63 ms 3156 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 204 KB Output is correct
2 Execution timed out 3059 ms 2348 KB Time limit exceeded
3 Halted 0 ms 0 KB -