이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
vector <pair <ll, ll>> vec;
int main(){
ios_base::sync_with_stdio(false);
cout.precision(10);
cout<<fixed;
int n;
cin >> n;
ll a, b;
cin >> a >> b;
a /= __gcd(a, b+1);
if(a <= 2000000000000000000LL/b) a *= b;
while(n--){
ll l, r;
cin >> l >> r;
if(r-l+1 >= a){
cout << a << "\n";
return 0;
}
l %= a;
r %= a;
if(l > r){
vec.push_back({0, 1});
vec.push_back({r+1, -1});
vec.push_back({l, 1});
vec.push_back({a, -1});
}
else{
vec.push_back({l, 1});
vec.push_back({r+1, -1});
}
}
sort(vec.begin(), vec.end());
n = vec.size();
ll res = 0;
ll tren = 0;
for(int i=0; i<n; i++){
ll val = vec[i].first;
if(i > 0) val -= vec[i-1].first;
if(tren) res += val;
tren += vec[i].second;
}
cout << res;
return 0;
}
# | 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... |