제출 #529760

#제출 시각아이디문제언어결과실행 시간메모리
529760ammar2000이상한 기계 (APIO19_strange_device)C++17
0 / 100
5082 ms524292 KiB
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,a,b;
ll ans=0;
map <pair < ll,ll>,ll> mp;
int main()
{
   fast
   cin>>n>>a>>b;
   for (int i=0;i<n;i++)
   {
       ll l,r;
       cin>>l>>r;
       for (int u=l;u<=r;u++)
       {
           ll x=(u+u/b)%a,y=u%b;
           if (mp[{x,y}]==0) ans++;
           mp[{x,y}]++;
       }
   }
   cout <<ans <<"\n";
   // use scanf not cin
   return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...