oj.uz

Submission #699672

# Submission time Handle Problem Language Result Execution time Memory
699672 2023-02-17T16:43:14 Z shmad Swimming competition (LMIO18_plaukimo_varzybos) C++17
100 / 100
 544 ms 30636 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvt = vt< vt<int> >;

const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e18 + 7, LIM = (1ll << 60);
const double eps = 1e-6;

int n, a, b;
ll t[N], dp[N], p[N];

bool check (ll x) {
	dp[0] = p[0] = 1;
	int j = 1;
	for (int i = 1; i <= n; i++) {
		p[i] = p[i - 1];
		dp[i] = 0;
		while (t[i] - t[j] > x) j++;
		if (i - a < 0) continue;
		if (j - 1 <= i - b) dp[i] |= ((i - b - 1 < 0 && p[i - a] != 0) || p[i - a] - p[i - b - 1] != 0);
		else if (j - 1 <= i - a) dp[i] |= (p[i - a] - (j - 2 >= 0 ? p[j - 2] : 0) != 0);
		p[i] += dp[i];
	}
	return dp[n];
}

void solve () {
	cin >> n >> a >> b;
	for (int i = 1; i <= n; i++) cin >> t[i];
	sort(t + 1, t + n + 1);
	ll l = 0, r = inf, ans = -1;  
	while (l <= r) {
		ll mid = l + r >> 1;
		if (check(mid)) ans = mid, r = mid - 1;
		else l = mid + 1;
	}
	assert(ans != -1);
	cout << ans;
	cout << '\n';
}

bool testcases = 0;

signed main() {
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Compilation message

plaukimo_varzybos.cpp: In function 'void solve()':
plaukimo_varzybos.cpp:49:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |   ll mid = l + r >> 1;
      |            ~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 27 ms 3264 KB Output is correct
3 Correct 5 ms 540 KB Output is correct
4 Correct 477 ms 30532 KB Output is correct
5 Correct 544 ms 30528 KB Output is correct
6 Correct 32 ms 3284 KB Output is correct
7 Correct 436 ms 27580 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 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 0 ms 332 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 27 ms 3264 KB Output is correct
3 Correct 5 ms 540 KB Output is correct
4 Correct 477 ms 30532 KB Output is correct
5 Correct 544 ms 30528 KB Output is correct
6 Correct 32 ms 3284 KB Output is correct
7 Correct 436 ms 27580 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 10 ms 1136 KB Output is correct
22 Correct 13 ms 1620 KB Output is correct
23 Correct 25 ms 2224 KB Output is correct
24 Correct 48 ms 2708 KB Output is correct
25 Correct 178 ms 18832 KB Output is correct
26 Correct 415 ms 24644 KB Output is correct
27 Correct 38 ms 2636 KB Output is correct
28 Correct 21 ms 2228 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 496 ms 30532 KB Output is correct
31 Correct 479 ms 30636 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 27 ms 3264 KB Output is correct
3 Correct 5 ms 540 KB Output is correct
4 Correct 477 ms 30532 KB Output is correct
5 Correct 544 ms 30528 KB Output is correct
6 Correct 32 ms 3284 KB Output is correct
7 Correct 436 ms 27580 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 10 ms 1136 KB Output is correct
12 Correct 13 ms 1620 KB Output is correct
13 Correct 25 ms 2224 KB Output is correct
14 Correct 48 ms 2708 KB Output is correct
15 Correct 178 ms 18832 KB Output is correct
16 Correct 415 ms 24644 KB Output is correct
17 Correct 38 ms 2636 KB Output is correct
18 Correct 21 ms 2228 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 496 ms 30532 KB Output is correct
21 Correct 479 ms 30636 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 18 ms 1960 KB Output is correct
33 Correct 195 ms 16712 KB Output is correct
34 Correct 183 ms 17260 KB Output is correct
35 Correct 502 ms 30424 KB Output is correct
36 Correct 482 ms 30548 KB Output is correct
37 Correct 439 ms 30596 KB Output is correct
38 Correct 223 ms 20428 KB Output is correct