제출 #346802

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
346802		arnold518	Table Tennis (info1cup20_tabletennis)	C++14	72 / 100	3073 ms	10524 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 15e4;
const int MAXK = 400;

int N, K, A[MAXN+10];

int main()
{
	scanf("%d%d", &N, &K);
	for(int i=1; i<=N+K; i++) scanf("%d", &A[i]);

	vector<int> comp;
	for(int i=1; i<=N+K; i++)
	{
		int t=N+K-i+1;
		for(int j=max(i+1, t-K); j<=min(N+K, t+K); j++)
		{
			comp.push_back(A[i]+A[j]);
		}
	}

	sort(comp.begin(), comp.end());
	comp.erase(unique(comp.begin(), comp.end()), comp.end());
	vector<vector<pii>> M;
	M.resize(comp.size());

	for(int i=1; i<=N+K; i++)
	{
		int t=N+K-i+1;
		for(int j=max(i+1, t-K); j<=min(N+K, t+K); j++)
		{
			M[lower_bound(comp.begin(), comp.end(), A[i]+A[j])-comp.begin()].push_back({A[i], A[j]});
		}
	}

	for(auto it : M)
	{
		if(it.size()>=N/2)
		{	
			vector<int> V;
			for(int i=0; i<N/2; i++)
			{
				V.push_back(it[i].first);
				V.push_back(it[i].second);
			}
			sort(V.begin(), V.end());
			for(auto it : V) printf("%d ", it);
			return 0;
		}
	}
}

컴파일 시 표준 에러 (stderr) 메시지

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:44:15: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |   if(it.size()>=N/2)
      |      ~~~~~~~~~^~~~~
tabletennis.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |  scanf("%d%d", &N, &K);
      |  ~~~~~^~~~~~~~~~~~~~~~
tabletennis.cpp:16:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |  for(int i=1; i<=N+K; i++) scanf("%d", &A[i]);
      |                            ~~~~~^~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13