oj.uz

Submission #640170

# Submission time Handle Problem Language Result Execution time Memory
640170 2022-09-13T18:58:03 Z tvladm2009 Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 59 ms 4528 KB 
#include <bits/stdc++.h>
 
using ll = long long;

const int MAX_N = 15 * 1e4;
const int MAX_K = 400;

int a[1 + MAX_N + MAX_K], answer[1 + MAX_N];
 
int main() {
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(0);
  int n, k;
  std::cin >> n >> k;
  for (int i = 0; i < n + k; i++) {
    std::cin >> a[i];
  }
  for (int i = 0; i < k + 1; i++) {
    bool ok = false;
    for (int j = n + i - 1; j < n + k; j++) {
      int elim = j - (n + i - 1);
      int l = i, r = j;
      int sum = a[l] + a[r];
      answer[1] = a[l];
      answer[n] = a[r];
      l++;
      r--;
      int m = 1;
      while (l < r && elim >= 0) {
        if (a[l] + a[r] == sum) {
          m++;
          answer[m] = a[l];
          answer[n - m + 1] = a[r];
          l++;
          r--;
        } else if (a[l] + a[r] < sum) {
          l++;
          elim--;
        } else {
          r--;
          elim--;
        }
      }
      if (m == n / 2) {
        ok = true;
        break;
      }
    }
    if (ok) {
      break;
    }
  }
  for (int i = 1; i <= n; i++) {
    std::cout << answer[i] << " ";
  }
  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 660 KB Output is correct
2 Correct 26 ms 4368 KB Output is correct
3 Correct 25 ms 4312 KB Output is correct
4 Correct 27 ms 4300 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2892 KB Output is correct
2 Correct 29 ms 4424 KB Output is correct
3 Correct 29 ms 4404 KB Output is correct
4 Correct 26 ms 4384 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 340 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 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 360 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 364 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 31 ms 4400 KB Output is correct
3 Correct 26 ms 4328 KB Output is correct
4 Correct 26 ms 4320 KB Output is correct
5 Correct 25 ms 4384 KB Output is correct
6 Correct 26 ms 4376 KB Output is correct
7 Correct 25 ms 4432 KB Output is correct
8 Correct 26 ms 4300 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 42 ms 4528 KB Output is correct
3 Correct 26 ms 4300 KB Output is correct
4 Correct 36 ms 4364 KB Output is correct
5 Correct 31 ms 4288 KB Output is correct
6 Correct 27 ms 4424 KB Output is correct
7 Correct 59 ms 4484 KB Output is correct
8 Correct 25 ms 4304 KB Output is correct