제출 #1312279

#제출 시각아이디문제언어결과실행 시간메모리
1312279yus1f_m이상한 기계 (APIO19_strange_device)C++20
0 / 100
685 ms589824 KiB
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=1000000,INF=1000000000;
using namespace std;
void solve()
{
    ll n,m,l,num1,num2,res1,res2,idx=0,Idx,ans=0;
    cin>>n>>m>>l;
    vector<pair<ll,ll>>res;
    for(int i=0;i<n;i++)
    {
        cin>>num1>>num2;
        for(int j=num1;j<=num2;j++)
        {
            res1=(j+j/l)%m,res2=j%l,res.pb({res1,res2});
        }
    }
    sort(all(res));
    while(idx<res.size())
    {
        ans++,Idx=idx;
        while(Idx<res.size() && res[idx]==res[Idx])
        {
            Idx++;
        }
        idx=Idx;
    }
    cout<<ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}
#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...