oj.uz

Submission #1001110

# Submission time Handle Problem Language Result Execution time Memory
1001110 2024-06-18T14:47:20 Z kachim2 Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 6776 KB 
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <vector>
using namespace std;
vector<pair<int, int>> res; 
vector<pair<int, int>> &check_balanced(vector<int> in, int val) {
  
  res.resize(0);
  int j = in.size()-1;
  for (int i = 0; i < j; i++){
    while(in[i]+in[j]>val) j--;
    if(in[i]+in[j]==val) res.push_back({in[i], in[j]});
  }
  
  return res;

}
int main() {
  int N, K;
  cin >> N >> K;
  vector<int> input(N+K);
  for(int i = 0; i < N+K; i++){
    cin >> input[i];
  }
  sort(input.begin(), input.end());
  for(int i = 0; i <= K; i++){
    for(int j = 0; j + i <= K; j++){
      const int sp = N+K-j-1;
      auto a = check_balanced(input, input[i]+input[sp]);
      	if(a.size()>=N/2){
	  vector<int> out;
	  for(auto i : a){
	    out.push_back(i.first);
	    out.push_back(i.second);
	  }
	  sort(out.begin(), out.end());
	  for(int i = 0; i < N; i++){
	    cout << out[i] <<' ';
	  }
	  return 0;
	}
    }
  }
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:31:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |        if(a.size()>=N/2){
      |           ~~~~~~~~^~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 860 KB Output is correct
2 Correct 51 ms 5308 KB Output is correct
3 Correct 55 ms 5288 KB Output is correct
4 Correct 49 ms 5332 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 5128 KB Output is correct
2 Correct 51 ms 5240 KB Output is correct
3 Correct 52 ms 5160 KB Output is correct
4 Correct 56 ms 5284 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 162 ms 5276 KB Output is correct
3 Correct 62 ms 6564 KB Output is correct
4 Correct 68 ms 6660 KB Output is correct
5 Correct 56 ms 6776 KB Output is correct
6 Correct 66 ms 6664 KB Output is correct
7 Correct 72 ms 6660 KB Output is correct
8 Correct 74 ms 6660 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Execution timed out 3061 ms 1540 KB Time limit exceeded
3 Halted 0 ms 0 KB -