Submission #699672

#	Time	Username	Problem	Language	Result	Execution time	Memory
699672		shmad	Swimming competition (LMIO18_plaukimo_varzybos)	C++17	100 / 100	544 ms	30636 KiB

plaukimo_varzybos

#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 (stderr)

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 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40