oj.uz

Submission #344506

# Submission time Handle Problem Language Result Execution time Memory
344506 2021-01-06T03:50:38 Z blue Strange Device (APIO19_strange_device) C++11
35 / 100
 1912 ms 17124 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

/*
Observations:

(1, b) = b

(b+1, b) = b

If a is even,      (a, 1) = a/2
Else if a is odd,  (a, 1) = a

b divides (a, b)

If b+1 divides a


If a and b+1 are coprime (a, b) = a*b

a*b / gcd(a, b+1) = ;

lcm(a, b+1) - a
*/

long long long_gcd(long long a, long long b)
{
    // cout << "gcd " << a << ' ' << b << '\n';
    if(a == b) return a;
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return long_gcd(a%b, b);
}

long long long_abs(long long x)
{
    if(x >= 0) return x;
    return -x;
}

long long long_sign(long long x)
{
    if(x > 0) return 1;
    return -1;
}

int main()
{
    int n;
    long long A, B;
    cin >> n >> A >> B;



    long long period = A * B / long_gcd(A, B+1);

    // cout << period << '\n';

    long long l, r;

    if(n == 1)
    {
        cin >> l >> r;

        if(r-l+1 >= period)
        {
            cout << period << '\n';
        }
        else if(l % period <= r % period)
        {
            cout << (r % period) - (l % period) + 1 << '\n';
        }
        else
        {
            cout << period - ((l % period) - (r % period) + 1) + 2 << '\n';
        }
        return 0;
    }

    vector<long long> endpoints;

    for(int i = 1; i <= n; i++)
    {
        cin >> l >> r;

        if(l % period <= r % period)
        {
            endpoints.push_back(l % period + 1);
            endpoints.push_back(-(r % period) - 1 - 1);
        }
        else
        {
            endpoints.push_back(l % period + 1);
            endpoints.push_back(-period - 1);

            endpoints.push_back(0 + 1);
            endpoints.push_back(-(r % period) - 1 - 1);
        }
    }


        // for(long long e: endpoints) cout << e << ' ';
        // cout << '\n';


    sort(endpoints.begin(), endpoints.end(), [] (long long p, long long q)
    {
        return long_abs(p) < long_abs(q);
    });

    // for(long long e: endpoints) cout << e << ' ';
    // cout << '\n';


    long long res = 0;

    long long count = 0;
    count += long_sign(endpoints[0]);
    for(int i = 1; i < endpoints.size(); i++)
    {
        // cout << count << ' ' << long_abs(endpoints[i]) - long_abs(endpoints[i-1]) << '\n';
        if(count > 0) res += long_abs(endpoints[i]) - long_abs(endpoints[i-1]);
        count += long_sign(endpoints[i]);
    }

    cout << res << '\n';
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:121:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |     for(int i = 1; i < endpoints.size(); i++)
      |                    ~~^~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 16 ms 748 KB Output is correct
3 Correct 17 ms 768 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 17 ms 748 KB Output is correct
17 Correct 205 ms 2568 KB Output is correct
18 Incorrect 0 ms 364 KB Output isn't correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 0 ms 364 KB Output isn't correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1094 ms 16964 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1671 ms 16840 KB Output is correct
3 Correct 1712 ms 16968 KB Output is correct
4 Correct 1667 ms 16840 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1671 ms 16840 KB Output is correct
3 Correct 1712 ms 16968 KB Output is correct
4 Correct 1667 ms 16840 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1731 ms 16840 KB Output is correct
7 Correct 1706 ms 17024 KB Output is correct
8 Correct 1684 ms 16968 KB Output is correct
9 Correct 1816 ms 16972 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1671 ms 16840 KB Output is correct
3 Correct 1712 ms 16968 KB Output is correct
4 Correct 1667 ms 16840 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 164 ms 2564 KB Output is correct
7 Correct 165 ms 2528 KB Output is correct
8 Correct 157 ms 2580 KB Output is correct
9 Correct 167 ms 2524 KB Output is correct
10 Correct 156 ms 2528 KB Output is correct
11 Correct 181 ms 2500 KB Output is correct
12 Correct 161 ms 2548 KB Output is correct
13 Correct 173 ms 2528 KB Output is correct
14 Correct 157 ms 2784 KB Output is correct
15 Correct 177 ms 2528 KB Output is correct
16 Correct 174 ms 2528 KB Output is correct
17 Correct 182 ms 2528 KB Output is correct
18 Correct 1695 ms 16840 KB Output is correct
19 Correct 1631 ms 17124 KB Output is correct
20 Correct 1855 ms 16940 KB Output is correct
21 Correct 178 ms 2528 KB Output is correct
22 Correct 151 ms 2460 KB Output is correct
23 Correct 499 ms 8660 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 171 ms 2656 KB Output is correct
3 Correct 175 ms 2532 KB Output is correct
4 Correct 1912 ms 16984 KB Output is correct
5 Correct 177 ms 2584 KB Output is correct
6 Correct 175 ms 2528 KB Output is correct
7 Correct 175 ms 2528 KB Output is correct
8 Correct 179 ms 2528 KB Output is correct
9 Correct 170 ms 2528 KB Output is correct
10 Correct 199 ms 2528 KB Output is correct
11 Correct 182 ms 2656 KB Output is correct
12 Correct 161 ms 2528 KB Output is correct
13 Correct 181 ms 2676 KB Output is correct
14 Correct 1858 ms 17004 KB Output is correct
15 Correct 178 ms 2528 KB Output is correct
16 Correct 1619 ms 17004 KB Output is correct
17 Correct 1675 ms 17096 KB Output is correct
18 Incorrect 0 ms 364 KB Output isn't correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 16 ms 748 KB Output is correct
3 Correct 17 ms 768 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 17 ms 748 KB Output is correct
17 Correct 205 ms 2568 KB Output is correct
18 Incorrect 0 ms 364 KB Output isn't correct