oj.uz

Submission #962126

# Submission time Handle Problem Language Result Execution time Memory
962126 2024-04-13T07:18:00 Z Amr Strange Device (APIO19_strange_device) C++17
5 / 100
 769 ms 45460 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define S second
#define F first
#define all(x) (x).begin(),(x).end()
#define sz size()
#define Yes cout << "YES" << endl
#define No cout << "NO" << endl
#define pb(x) push_back(x);
#define endl '\n'
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N=4e7;
ll INF=INT_MAX,mod=1e9+7;
int TT=1;
ll power(ll x, unsigned int y)
{
    ll res = 1;
    x = x; // % mod;
    if (x == 0) return 0;
    while (y > 0)
    {
        if (y & 1) res = (res*x)  ; // % mod;
        y = y>>1;
        x = (x*x) ; // % mod;
    }
    return res;
}
typedef unsigned long long ull;
ll lo(ll x)
{
    ll cnt = 0;
    while(x) cnt++,x/=10;
    return cnt-1;
}
ll f(ll x, ll y)
{
    ll m = (x/power(10,lo(x)))*(y/power(10,lo(y)));
    return (lo(x)+lo(y)+lo(m)>=19||(x*y)>1e18);
}
ll k = 1;
ll seg[N];
bool qu[N];
int L[N],R[N];
ll siz = 2e6;
ll get(ll l ,ll r, ll x = 0, ll lx = 0, ll rx = siz)
{
    if(lx>=r||rx<=l) return 0;
    if(lx>=l&&rx<=r)
    {
        return seg[x];
    }
    ll mid = (lx+rx)/2;
    L[x] = 2*x+1 , R[x] = 2*x+2;
    ll s1 = get(l,r,L[x],lx,mid);
    ll s2 = get(l,r,R[x],mid,rx);
    return max(s1+s2,qu[x]*(min(rx,r)-max(lx,l)));
}
void update(ll l , ll r, ll x = 0, ll lx = 0, ll rx = siz)
{
    if(lx>=r||rx<=l) return;

    if(lx>=l&&rx<=r)
    {
        qu[x] = 1;
        seg[x] = (rx-lx);
        return;
    }
    ll mid = (lx+rx)/2;
    L[x] = 2*x+1 , R[x] = 2*x+2;
    update(l,r,L[x],lx,mid);
    update(l,r,R[x],mid,rx);
    //cout << lx << " " << rx << " ";
    seg[x] = max(seg[L[x]]+seg[R[x]],qu[x]*(rx-lx));
   //cout << x << seg[x] << qu[x] << endl;
}
void solve()
{
    ll n;
    ull a , b;
    cin >> n >> a >> b;
    ll mgcd = __gcd(a,b+1);
    a/=mgcd;
    ull cntans = 0;

    if(f(a,b))
    {
        for(int i = 1; i <= n; i++)
        {
        ull l , r; cin >> l >> r;
        cntans+=(r-l+1);
        }
        cout << cntans << endl;
        return;
    }
    a*=b;
    ull ab = a;
    //cout << ab << endl;

    ll ans = 0;
    for(int i = 1; i <= n; i++)
    {
        ull l , r; cin >> l >> r;
        //cout << min(a,r-l+1) << endl;
        l--,r--;
        if(r>=l+ab) r = l+ab-1;

        if(l%ab<=r%ab)
        {

            ans+=r-l+1-get(l%ab,r%ab+1);
            update(l%ab,r%ab+1);
        }
        else
        {

            ans+=r%ab+1-get(0,r%ab+1);
            ans+=ab-l%ab-get(l%ab,ab);
            update(0,r%ab+1);
            update(l%ab,ab);
        }
        //cout << 'h' << endl;
    }
    cout << ans << endl;
}
int main(){
    //freopen("friday.in","r",stdin);
    //freopen("friday.out","w",stdout);
    fast;
    while(TT--)
        solve();

    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Incorrect 7 ms 24668 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 2 ms 14684 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 10844 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 7 ms 28504 KB Output is correct
3 Correct 8 ms 26460 KB Output is correct
4 Correct 8 ms 23644 KB Output is correct
5 Incorrect 769 ms 14984 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 604 ms 45460 KB Output is correct
3 Incorrect 237 ms 33984 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 604 ms 45460 KB Output is correct
3 Incorrect 237 ms 33984 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 604 ms 45460 KB Output is correct
3 Incorrect 237 ms 33984 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

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

Subtask #8
0 / 30.0

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