이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second
const ll N = 1000005;
const ll M = 1e9 + 7;
ll T, n, a, b, l[N], r[N];
map <pair<ll,ll>, bool> m;
int main(){
ios::sync_with_stdio(false); cin.tie(0);
cin >> n >> a >> b;
int ans = 0;
for(int i = 1; i <= n; i++){
cin >> l[i] >> r[i];
for(ll j = l[i]; j <= r[i]; j++){
ll x = (j + (j/b))%a, y = (j%b);
if(m.find({x,y}) == m.end()){
m[{x,y}] = 1;
ans++;
}
}
}
cout << ans;
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... |