oj.uz

Submission #729595

# Submission time Handle Problem Language Result Execution time Memory
729595 2023-04-24T09:32:35 Z danikoynov Strange Device (APIO19_strange_device) C++14
0 / 100
 5000 ms 524288 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 1e6 + 10;

int n;
ll l[maxn], r[maxn];
ll A, B;

bool tf = false;
ll check(ll a, ll b)
{
    ///cout << a << " " << b << endl;
    if (a < 1e9 && b < 1e9)
        return a * b;
    if (a > b)
        swap(a, b);
    if (b % 2 == 1)
    {
        ll s = check(a, b - 1);
        if (s + a > 1e18)
            tf = true;
        return s + a;
    }
    ll s = check(a, b / 2);
    if (s * 2 > (ll)1e18)
        tf = true;

    return s * 2;
}
void solve()
{
    cin >> n >> A >> B;
    for (int i = 1; i <= n; i ++)
    {
        cin >> l[i] >> r[i];
    }
    check(A, B);

    if (tf)
    {
        ll ans = 0;
        for (int i = 1; i <= n; i ++)
        {
            ans = ans + (r[i] - l[i] + 1);
        }
        cout << ans << endl;
        return;
    }
    unordered_set < ll > st;
    for (int i = 1; i <= n; i ++)
    {

        for (ll j = l[i]; j <= r[i]; j ++)
        {
            ///cout << x << " " << y << endl;
            st.insert({j % (A * B)});
        }
    }

    cout << st.size() << endl;
}

int main()
{
    solve();
    return 0;
}
/**
1  10000 3312452154131231
1 1
*/

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 29 ms 9904 KB Output is correct
3 Correct 33 ms 11952 KB Output is correct
4 Incorrect 1 ms 852 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 653 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 41 ms 21932 KB Output is correct
3 Correct 55 ms 21728 KB Output is correct
4 Correct 47 ms 20988 KB Output is correct
5 Execution timed out 5015 ms 58520 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1309 ms 58636 KB Output is correct
3 Runtime error 2021 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1309 ms 58636 KB Output is correct
3 Runtime error 2021 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1309 ms 58636 KB Output is correct
3 Runtime error 2021 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 905 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 29 ms 9904 KB Output is correct
3 Correct 33 ms 11952 KB Output is correct
4 Incorrect 1 ms 852 KB Output isn't correct
5 Halted 0 ms 0 KB -