oj.uz

Submission #818565

# Submission time Handle Problem Language Result Execution time Memory
818565 2023-08-10T05:28:50 Z Soumya1 Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 263 ms 33740 KB 
#include <bits/stdc++.h>
#ifdef __LOCAL__
  #include <debug_local.h>
#endif
using namespace std;
void testCase() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n + k);
  for (int &i : a) cin >> i;
  sort(a.begin(), a.end());
  int N = n + k;
  auto check = [&](int s) {
    int i = 0, j = N - 1;
    vector<int> v;
    while (i < j) {
      if (a[i] + a[j] == s) {
        v.push_back(a[i]);
        v.push_back(a[j]);
        i++, j--;
      } else if (a[i] + a[j] > s) {
        j--;
      } else {
        i++;
      }
      if (v.size() == n) {
        sort(v.begin(), v.end());
        for (int i : v) cout << i << " ";
        cout << "\n";
        exit(0);
      }
    }
  };
  if (4 * k >= n) {
    for (int i = 0; i < k + 1; i++) {
      for (int j = N - 1; j >= N - k - 1; j--) {
        check(a[i] + a[j]);
      }
    }
  } else {
    map<int, int> cnt;
    for (int i = 0; i < 2 * k; i++) {
      for (int j = N - 1; j >= N - 2 * k; j--) {
        cnt[a[i] + a[j]]++;
      }
    }
    for (auto [x, y] : cnt) {
      if (y >= k) check(x);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Compilation message

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

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 896 KB Output is correct
2 Correct 38 ms 4604 KB Output is correct
3 Correct 29 ms 4548 KB Output is correct
4 Correct 27 ms 4552 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 4516 KB Output is correct
2 Correct 30 ms 4548 KB Output is correct
3 Correct 32 ms 4516 KB Output is correct
4 Correct 27 ms 4568 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 4 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 320 KB Output is correct
5 Correct 0 ms 316 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 320 KB Output is correct
3 Correct 1 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 468 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 336 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 28 ms 4568 KB Output is correct
3 Correct 31 ms 4524 KB Output is correct
4 Correct 35 ms 4460 KB Output is correct
5 Correct 36 ms 4516 KB Output is correct
6 Correct 31 ms 5456 KB Output is correct
7 Correct 30 ms 4544 KB Output is correct
8 Correct 31 ms 4512 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 263 ms 32192 KB Output is correct
3 Correct 189 ms 33740 KB Output is correct
4 Correct 148 ms 29692 KB Output is correct
5 Correct 126 ms 11348 KB Output is correct
6 Correct 50 ms 5748 KB Output is correct
7 Correct 146 ms 26492 KB Output is correct
8 Correct 139 ms 28704 KB Output is correct