Submission #684825

#	Time	Username	Problem	Language	Result	Execution time	Memory
684825		vovamr	Strange Device (APIO19_strange_device)	C++17	100 / 100	681 ms	51652 KiB

strange_device

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 4e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	ll n, a, b;
	cin >> n >> a >> b;

	ll T;

	ll g = gcd(a, b + 1);
	ll f = a / g;
	if (f > inf / b) T = inf;
	else T = f * b;

	ve<pll> ev;
	for (int i = 0; i < n; ++i) {
		ll l, r;
		cin >> l >> r;
		if (r - l + 1 >= T) {
			return void(cout << T);
		}

		l %= T, r %= T;

		if (l <= r) {
			ev.pb({l, +1});
			ev.pb({r + 1, -1});
		}
		else {
			ev.pb({0, +1});
			ev.pb({r + 1, -1});

			ev.pb({l, +1});
			ev.pb({T, -1});
		}
	}

	sort(all(ev));

	ll ans = 0, sum = 0;
	for (int i = 0; i < sz(ev); ) {
		int j = i;
		ll prev = (!i ? 0 : ev[i - 1].fi);
		if (sum > 0) ans += (ev[i].fi - prev);

		while (j < sz(ev) && ev[j].fi == ev[i].fi) {
			sum += ev[j].se;
			++j;
		}
		i = j;
	}

	cout << ans;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 20 / 20
• Subtask 7: 20 / 20
• Subtask 8: 30 / 30