이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <set>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
ll calculate_x(ll t, ll A, ll B) {
return (t + t / B) % A;
}
void process_interval(ll l, ll r, ll A, ll B, set<pll>& distinct_pairs) {
for (ll t = l; t <= r; ++t) {
ll y = t % B;
ll x = calculate_x(t, A, B);
distinct_pairs.insert({x, y});
}
}
int main() {
int n;
ll A, B;
cin >> n >> A >> B;
set<pll> distinct_pairs;
for (int i = 0; i < n; ++i) {
ll li, ri;
cin >> li >> ri;
process_interval(li, ri, A, B, distinct_pairs);
}
cout << distinct_pairs.size() << endl;
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... |