oj.uz

Submission #938933

# Submission time Handle Problem Language Result Execution time Memory
938933 2024-03-05T22:03:28 Z Andreibatman Strange Device (APIO19_strange_device) C++14
5 / 100
 436 ms 17040 KB 
#include <bits/stdc++.h>
using namespace std;
unsigned long long n,a,b,ans,i,t,k,pozst,lg,schema,ok,st,dr;
struct ceva
{
    unsigned long long l,r;
}v[5000010];
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';
    if(ULLONG_MAX/a<=b)
        k=1e18;
    else
        k=a*b;
    for(i=1;i<=n;i++)
    {
        cin>>v[i].l>>v[i].r;
        pozst=v[i].l%k;
        lg=v[i].r-v[i].l+1;
        if(lg>=k)
        {
            ok=1;
            v[i]={1,k};
            continue;
        }
        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,lg-2};
        }
        else
            v[i]={pozst,pozst+lg-1};
    }
    /*if(ok==1)
    {
        cout<<k;
        return 0;
    }*/
    n=n+schema;
    sort(v+1,v+n+1,cmp);
    //for(i=1;i<=n;i++)
    //    cout<<v[i].l<<" "<<v[i].r<<'\n';
    st=0;
    dr=0;
    for(i=1;i<=n;i++)
    {
        st=max(st,v[i].l);
        st=max(st,v[i-1].r+1);
        if(dr==v[i].r)
            continue;
        dr=v[i].r;
        st=max(st,v[i].l);
        st=max(st,v[i-1].r+1);
        ans=ans+dr-st+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 3 ms 600 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct

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 1 ms 348 KB Output is correct
2 Correct 332 ms 17036 KB Output is correct
3 Incorrect 364 ms 17040 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

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

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 332 ms 17036 KB Output is correct
3 Incorrect 364 ms 17040 KB Output isn't correct
4 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 Correct 36 ms 2652 KB Output is correct
3 Correct 35 ms 2652 KB Output is correct
4 Correct 436 ms 17020 KB Output is correct
5 Correct 36 ms 2652 KB Output is correct
6 Correct 36 ms 2652 KB Output is correct
7 Correct 36 ms 2648 KB Output is correct
8 Correct 41 ms 2672 KB Output is correct
9 Correct 35 ms 2676 KB Output is correct
10 Correct 44 ms 2676 KB Output is correct
11 Correct 35 ms 2648 KB Output is correct
12 Correct 30 ms 2648 KB Output is correct
13 Correct 36 ms 2648 KB Output is correct
14 Incorrect 385 ms 17032 KB Output isn't correct
15 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 3 ms 600 KB Output isn't correct
3 Halted 0 ms 0 KB -