oj.uz

Submission #938928

# Submission time Handle Problem Language Result Execution time Memory
938928 2024-03-05T21:49:31 Z Andreibatman Strange Device (APIO19_strange_device) C++14
0 / 100
 356 ms 53508 KB 
#include <bits/stdc++.h>
using namespace std;
long long n,a,b,ans,i,t,k,pozst,lg,schema,ok,st,dr;
struct ceva
{
    long long l,r;
}v[1000010];
bool cmp(ceva a,ceva b)
{
    return a.r<b.r || (a.r==b.r && a.l<b.l);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>a>>b;
    //for(t=1;t<=100;t++)
    //    cout<<(t%a+t/b%a)%a<<" "<<t%b<<" TIMPUL: "<<t<<'\n';
    for(i=1;i<=n;i++)
    {
        cin>>v[i].l>>v[i].r;
        k=a*b;
        pozst=v[i].l%k;
        lg=v[i].r-v[i].l+1;
        if(lg>=k)
        {
            ok=1;
            ans=k;
        }
        if(pozst==0)
        {
            v[n+(++schema)]={k,k};
            pozst=1;
            v[i].l=1;
            v[i].r=v[i].l+lg-2;
            lg--;
        }
        if(pozst+lg-1>k)
        {
            v[n+(++schema)]={pozst,k};
            v[i]={1,k-pozst-lg-1};
        }
        else
            v[i]={pozst,pozst+lg-1};
    }
    if(ok==1)
    {
        cout<<k;
        return 0;
    }
    n=n+schema;
    //for(i=1;i<=n;i++)
    //    cout<<v[i].l<<" "<<v[i].r<<'\n';
    sort(v+1,v+n+1,cmp);
    st=0;
    dr=0;
    for(i=1;i<=n;i++)
    {
        if(dr==v[i].r)
            continue;
        dr=v[i].r;
        st=max(st,v[i].l);
        ans=ans+v[i].r-v[i].l+1;
    }
    cout<<ans;
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 4 ms 856 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 356 ms 53508 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 356 ms 53508 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 356 ms 53508 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 37 ms 6236 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 4 ms 856 KB Output isn't correct
3 Halted 0 ms 0 KB -