oj.uz

Submission #691817

# Submission time Handle Problem Language Result Execution time Memory
691817 2023-01-31T15:42:43 Z Lextyle Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 153 ms 4420 KB 
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma warning(disable : 6031)
#define USACO freopen("moocast.in", "r", stdin); freopen("moocast.out", "w+", stdout)
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ll long long
using namespace std;

ll binpow(ll a, ll x, ll m) {
	ll ans = 1, md = a % m;
	for (int i = 0; i < 63; i++) {
		if (x & ((ll)1 << i)) ans = (ans * md) % m;
		md = (md * md) % m;
	}
	return ans;
}

vector<ll> gcd(ll a, ll b) {
	if (b == 0) {
		return { a, 1, 0 };
	}
	vector<ll> d = gcd(b, a % b);
	return { d[0], d[2], d[1] - d[2] * (a / b) };
}

ll lcm(ll a, ll b) {
	return a * b / gcd(a, b)[0];
}
int a[200000], ans[150000];

void solve() {
	int n, k;
	cin >> k >> n;
	n += k;
	for (int i = 0; i < n; i++) cin >> a[i];
	for (int i = 0; i < n; i++) {
		for (int j = i + k - 1; j < n; j++) {
			int cnt = 0;
			for (int l = i, r = j; 2 * cnt < k; l++) {
				while (r > l && a[j] - a[r] < a[l] - a[i]) r--;
				if (r <= l) break;
				if (r - l + 1 < k - 2 * cnt) break;
				if (a[j] - a[r] == a[l] - a[i]) {
					ans[cnt] = a[l];
					ans[k - 1 - cnt] = a[r];
					cnt++;
					r--;
				}
			}
			if (2 * cnt == k) {
				for (int c = 0; c < k; c++) cout << ans[c] << " ";
				return;
			}
		}
	}
}

int main() {
	//USACO;
	fastIO;
	solve();
}

Compilation message

tabletennis.cpp:2: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    2 | #pragma warning(disable : 4996)
      | 
tabletennis.cpp:3: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    3 | #pragma warning(disable : 6031)
      |

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 596 KB Output is correct
2 Correct 29 ms 2916 KB Output is correct
3 Correct 28 ms 2920 KB Output is correct
4 Correct 28 ms 2892 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2892 KB Output is correct
2 Correct 29 ms 2996 KB Output is correct
3 Correct 28 ms 3004 KB Output is correct
4 Correct 30 ms 2892 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 31 ms 2964 KB Output is correct
3 Correct 28 ms 2872 KB Output is correct
4 Correct 29 ms 2876 KB Output is correct
5 Correct 27 ms 2896 KB Output is correct
6 Correct 34 ms 2956 KB Output is correct
7 Correct 28 ms 2972 KB Output is correct
8 Correct 28 ms 2936 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 51 ms 2868 KB Output is correct
3 Correct 32 ms 4296 KB Output is correct
4 Correct 60 ms 4316 KB Output is correct
5 Correct 39 ms 4300 KB Output is correct
6 Correct 153 ms 4420 KB Output is correct
7 Correct 65 ms 4364 KB Output is correct
8 Correct 29 ms 4392 KB Output is correct