이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define SS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
//#define int long long
#define all(x) x.begin(),x.end()
#define F first
#define S second
using namespace std;
const int N = 501,mx=1025;
const long double eps = 1e-9;
int inf = 1e9, MOD = 998244353;
vector<pair<int,int>> g[N];
signed main() {
SS
int n,a,b;
cin>>n>>a>>b;
pair<int,int> p[n+1];
set<pair<int,int>> st;
for(int i=1;i<=n;i++){
cin>>p[i].F>>p[i].S;
}
for(auto [l,r]:p){
for(int i=l;i<=r;i++){
int x=(int)(i+floor((double)(i/b)))%a;
int y=i%b;
st.insert({x,y});
}
}
cout<<st.size();
}
# | 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... |