이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define endl '\n'
#define ll long long
const int N = 1e6 + 5;
pair<ll, ll> c[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen("VLJUM.INP", "r", stdin);
//freopen("VLJUM.OUT", "w", stdout);
ll n, a, b;
cin >> n >> a >> b;
ll sum = 0;
for (int i = 1; i <= n; i++){
cin >> c[i].first >> c[i].second;
sum += c[i].second - c[i].first + 1;
}
if (sum <= 1000000){
set<pair<ll,ll>> mem;
for (int i = 1; i <= n; i++){
for (int j = c[i].first; j <= c[i].second; j++){
mem.insert({(j + j/b) % a, j % b});
}
}
cout << mem.size();
} else {
cout << 0;
}
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... |