oj.uz

Submission #423605

# Submission time Handle Problem Language Result Execution time Memory
423605 2021-06-11T10:16:30 Z pavement Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 371632 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];
map<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++) {
			vector<int> ans;
			int S = A[i + 1] + A[N + K - j];
			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) {
					ans.pb(k);
					ans.pb(R[S - A[k]]);
				}
			}
			if (ans.size() >= N) {
				vector<int> tmp;
				for (int i = 0; i < N; i++) tmp.pb(A[ans[i]]);
				sort(tmp.begin(), tmp.end());
				for (int i : tmp) cout << i << ' ';
				cout << '\n';
				return 0;
			}
		}
	//assert(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:46:19: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   46 |    if (ans.size() >= N) {
      |        ~~~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2332 KB Output is correct
2 Correct 158 ms 24404 KB Output is correct
3 Correct 142 ms 23944 KB Output is correct
4 Correct 143 ms 23672 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 40244 KB Output is correct
2 Correct 149 ms 26220 KB Output is correct
3 Correct 189 ms 36420 KB Output is correct
4 Correct 160 ms 29432 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 114 ms 17664 KB Output is correct
3 Correct 3 ms 1116 KB Output is correct
4 Correct 99 ms 23428 KB Output is correct
5 Correct 3 ms 1088 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 332 KB Output is correct
2 Correct 52 ms 12740 KB Output is correct
3 Correct 10 ms 3024 KB Output is correct
4 Correct 46 ms 15400 KB Output is correct
5 Correct 10 ms 2996 KB Output is correct
6 Correct 3 ms 588 KB Output is correct

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3532 KB Output is correct
2 Execution timed out 3120 ms 335284 KB Time limit exceeded
3 Halted 0 ms 0 KB -