# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366565 | Nima_Naderi | Strange Device (APIO19_strange_device) | C++14 | 1161 ms | 108528 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///In the name of GOD
//#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 4e6 + 10;
const ll INF = 1e18;
ll n, A, B, g, k, m;
ll L[MXN], R[MXN], cnt[MXN];
vector<ll> Num;
vector<pair<ll, ll>> seg;
inline int GetId(ll x){
return lower_bound(Num.begin(), Num.end(), x) - Num.begin();
}
int main(){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
cin >> n >> A >> B;
g = __gcd(A, B + 1);
k = (A / g);
m = (k > (INF + B - 1) / B ? INF + 1 : k * B);
for(int i = 1; i <= n; i ++){
cin >> L[i] >> R[i];
if(R[i] - L[i] + 1 >= m) return cout << m, 0;
L[i] %= m, R[i] %= m;
Num.push_back(L[i]), Num.push_back(R[i]), Num.push_back(R[i] + 1);
if(R[i] < L[i]){
seg.push_back({L[i], m - 1});
seg.push_back({0, R[i]});
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |