제출 #1204334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1204334		friendiks	이상한 기계 (APIO19_strange_device)	C++20	0 / 100	3374 ms	589824 KiB

strange_device

#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Wpedantic"
#endif

#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;

auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(52);
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename V>
using table = gp_hash_table<T, V>;

using i128 = __int128;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;

const ll INF = 2e18;
const int inf = 2e9;
const int maxn = 1e5;
const int MOD = 988244353;
const ld pi = acos(-1);
const int P = 5167;
const int L = 26;
const ld EPS = 1e-7;

template<typename T, typename V>
void fill(T &container, V value) {
    for (auto &c: container)
        c = value;
}

#define int ll

void solve() {
    int n, a, b;
    cin >> n >> a >> b;
    i128 x = a / gcd(a, b + 1);
    x *= b;
    ll X = 0;
    if (x > 5e18) X = 5e18;
    else X = (ll) x;
    vector<int> l(n), r(n);
    for (int i = 0; i < n; ++i) {
        cin >> l[i] >> r[i];
        l[i] = max(l[i], r[i] - X + 1);
        int curr = l[i];
        l[i] %= X;
        r[i] -= curr - l[i];
    }
    vector<pair<int, int> > res(n);
    for (int i = 0; i < n; ++i) res[i] = {l[i], r[i]};
    sort(res.begin(), res.end());
    set<int> st;
    for (auto c: res) {
        for (int t = c.first; t <= c.second; ++t) {
            st.insert(t);
        }
    }
    cout << st.size();
}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(4);
    int t = 1;
    //cin >> t;
    while (t--) solve();
    //stress();
}

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