oj.uz

답안 #299635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
299635 2020-09-15T11:14:41 Z E869120 Table Tennis (info1cup20_tabletennis) C++14
87 / 100
 3000 ms 4720 KB 
#include <bits/stdc++.h>
using namespace std;

int N, K;
int A[1 << 18];
bool used[1 << 18];

bool solve(int border) {
	for (int i = 0; i < N + K; i++) used[i] = false;
	
	int cl = 0, cr = N + K - 1, cnt = 0;
	while (cl < cr && cnt < (N / 2)) {
		if (A[cl] + A[cr] > border) cr--;
		else if (A[cl] + A[cr] < border) cl++;
		else {
			used[cl] = true;
			used[cr] = true;
			cl += 1;
			cr -= 1;
			cnt += 1;
		}
	}
	
	if (cnt == (N / 2)) return true;
	return false;
}

int main() {
	// Step #1. Input
	scanf("%d%d", &N, &K);
	for (int i = 0; i < N + K; i++) scanf("%d", &A[i]);
	sort(A, A + (N + K));
	
	// Step #2. BruteForce
	vector<long long> Cand;
	for (int i = 0; i <= K; i++) {
		for (int j = 0; j <= K - i; j++) {
			Cand.push_back(A[i] + A[N + K - 1 - j]);
		}
	}
	sort(Cand.begin(), Cand.end());
	Cand.erase(unique(Cand.begin(), Cand.end()), Cand.end());
	
	// Step #3. Tansaku
	for (int i = 0; i < Cand.size(); i++) {
		bool I = solve(Cand[i]);
		if (I == false) continue;
		vector<int> vec;
		for (int j = 0; j < N + K; j++) {
			if (used[j] == true) vec.push_back(A[j]);
		}
		for (int j = 0; j < vec.size(); j++) {
			if (j) printf(" ");
			printf("%d", vec[j]);
		}
		printf("\n");
		return 0;
	}
	return 0;
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:45:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for (int i = 0; i < Cand.size(); i++) {
      |                  ~~^~~~~~~~~~~~~
tabletennis.cpp:52:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   for (int j = 0; j < vec.size(); j++) {
      |                   ~~^~~~~~~~~~~~
tabletennis.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |  scanf("%d%d", &N, &K);
      |  ~~~~~^~~~~~~~~~~~~~~~
tabletennis.cpp:31:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |  for (int i = 0; i < N + K; i++) scanf("%d", &A[i]);
      |                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1024 KB Output is correct
2 Correct 56 ms 4720 KB Output is correct
3 Correct 54 ms 4716 KB Output is correct
4 Correct 55 ms 4716 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 4716 KB Output is correct
2 Correct 61 ms 4716 KB Output is correct
3 Correct 55 ms 4716 KB Output is correct
4 Correct 55 ms 4716 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

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

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 196 ms 4716 KB Output is correct
3 Correct 57 ms 4720 KB Output is correct
4 Correct 65 ms 4712 KB Output is correct
5 Correct 57 ms 4716 KB Output is correct
6 Correct 74 ms 4716 KB Output is correct
7 Correct 82 ms 4720 KB Output is correct
8 Correct 74 ms 4716 KB Output is correct

Subtask #8
0 / 13.0

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