oj.uz

Submission #423677

# Submission time Handle Problem Language Result Execution time Memory
423677 2021-06-11T11:09:29 Z pavement Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 3168 KB 
#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];
set<int> seen;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> K;
	for (int i = 1; i <= N + K; i++) cin >> A[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], r = N + K - j, cnt = 0;
			if (seen.count(S)) continue;
			seen.insert(S);
			for (int k = i + 1; k < r; k++) {
				while (k < r && A[k] + A[r] > S) r--;
				if (A[k] + A[r] == S) cnt += 2;
			}
			if (cnt >= N) {
				r = N + K - j;
				vector<int> tmp;
				for (int k = i + 1; k < r; k++) {
					while (k < r && A[k] + A[r] > S) r--;
					if (A[k] + A[r] == S) {
						tmp.pb(A[k]);
						tmp.pb(A[r]);
						if (tmp.size() == N) break;
					}
				}
				sort(tmp.begin(), tmp.end());
				for (int k : tmp) cout << k << ' ';
				cout << '\n';
				return 0;
			}
		}
}

Compilation message

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:53:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |       if (tmp.size() == N) break;
      |           ~~~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 716 KB Output is correct
2 Correct 42 ms 3080 KB Output is correct
3 Correct 41 ms 2992 KB Output is correct
4 Correct 42 ms 3076 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 3036 KB Output is correct
2 Correct 46 ms 3136 KB Output is correct
3 Correct 41 ms 3052 KB Output is correct
4 Correct 43 ms 3048 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 184 ms 3040 KB Output is correct
3 Correct 44 ms 3052 KB Output is correct
4 Correct 68 ms 3168 KB Output is correct
5 Correct 43 ms 3032 KB Output is correct
6 Correct 49 ms 3132 KB Output is correct
7 Correct 61 ms 3076 KB Output is correct
8 Correct 41 ms 3044 KB Output is correct

Subtask #8
0 / 13.0

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