이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define vi std::vector<ll>
#define si set<ll>
#define INF 100000000
#define pb push_back
#define mod 1000000007
ll solve(){
ll n,a,b;
cin >> n >> a >>b;
si t;
for (int i = 0; i < n; ++i)
{
ll l,r;
cin >> l >> r;
for (int j = l; j <= r; ++j){
t.insert(j);
}
}
set<pair <ll, ll> > ans;
ll sum = 0;
for(auto c: t){
ll x = (c/b);
x += c;
x %= a;
ll y= c%b;
ans.insert(make_pair(x,y));
// cout << x << " " << y << "\n";
sum ++;
}
// cout << "\n";
// for(auto x: ans){
// cout << x.first << " " << x.second << "\n";
// }
cout << ans.size();
return 0;
}
int main(){
fastio;
ll t = 1;
// freopen("div7.in","r",stdin);
// freopen("div7.out","w",stdout);
// cin >> t;
for (int i = 0; i < t; ++i){
// cout << "Case #" << i+1 << ": ";
solve();
cout << "\n";
}
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... |