oj.uz

Submission #1001105

# Submission time Handle Problem Language Result Execution time Memory
1001105 2024-06-18T14:37:32 Z kachim2 Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 10164 KB 
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <vector>
using namespace std;
vector<pair<int, int>> check_balanced(vector<int> in, int val) {
  set<int> s;
  for (int i : in){
    s.insert(i);
  }
  vector<pair<int, int>> res;
  for (int i : in){
    if(s.count(val-i) && s.count(i) && i!=val-i){
      s.erase(i);
      s.erase(val-i);
      res.emplace_back(i, val-i);
    }
  }
  
  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:35: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]
   35 |        if(a.size()>=N/2){
      |           ~~~~~~~~^~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1532 KB Output is correct
2 Correct 146 ms 9992 KB Output is correct
3 Correct 123 ms 9912 KB Output is correct
4 Correct 123 ms 10164 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 9992 KB Output is correct
2 Correct 140 ms 9988 KB Output is correct
3 Correct 247 ms 9992 KB Output is correct
4 Correct 147 ms 9904 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 48 ms 416 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 35 ms 416 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 39 ms 540 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 25 ms 548 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 16 ms 544 KB Output is correct

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 596 KB Output is correct
2 Execution timed out 3079 ms 8604 KB Time limit exceeded
3 Halted 0 ms 0 KB -