제출 #423655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423655		pavement	Table Tennis (info1cup20_tabletennis)	C++17	87 / 100	2555 ms	1048580 KiB

tabletennis

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
//#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<iii, null_type, greater<iii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
int N, K, A[200005];
gp_hash_table<int, int> R;
 
main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> K;
	for (int i = 1; i <= N + K; i++) cin >> A[i], R[A[i]] = i;
	for (int i = 0; i <= K; i++)
		for (int j = 0; i + j <= K; j++) {
			int S = A[i + 1] + A[N + K - j], cnt = 0;
			for (int k = i + 1; k <= N + K - j; k++) {
				if (S - A[k] > A[k] && R[S - A[k]] && R[S - A[k]] <= N + K - j) {
					cnt += 2;
					if (cnt >= N) break;
				}
			}
			if (cnt >= N) {
				vector<int> tmp;
				for (int k = 1; k <= N + K; k++)
					if (R[S - A[k]]) {
						tmp.pb(A[k]);
						tmp.pb(S - A[k]);
						if (tmp.size() == N) break;
					}
				sort(tmp.begin(), tmp.end());
				for (int k : tmp) cout << k << ' ';
				cout << '\n';
				return 0;
			}
		}
}

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

tabletennis.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:51:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |       if (tmp.size() == N) break;
      |           ~~~~~~~~~~~^~~~

• 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: 15 / 15
• Subtask 8: 0 / 13