oj.uz

답안 #1001107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001107 2024-06-18T14:38:21 Z kachim2 Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 10028 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) {
  unordered_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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1372 KB Output is correct
2 Correct 110 ms 9520 KB Output is correct
3 Correct 95 ms 9032 KB Output is correct
4 Correct 93 ms 9008 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 9004 KB Output is correct
2 Correct 103 ms 9512 KB Output is correct
3 Correct 145 ms 9168 KB Output is correct
4 Correct 103 ms 10028 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 51 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 33 ms 444 KB Output is correct
5 Correct 1 ms 344 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 21 ms 532 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 18 ms 532 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 8 ms 532 KB Output is correct

Subtask #7
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 3046 ms 7576 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 348 KB Output is correct
2 Execution timed out 3077 ms 7624 KB Time limit exceeded
3 Halted 0 ms 0 KB -