oj.uz

Submission #344184

# Submission time Handle Problem Language Result Execution time Memory
344184 2021-01-05T08:40:50 Z blue Strange Device (APIO19_strange_device) C++11
35 / 100
 1871 ms 17204 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

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 - ((r % period) - (l % 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:99:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for(int i = 1; i < endpoints.size(); i++)
      |                    ~~^~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 17 ms 748 KB Output is correct
3 Correct 17 ms 748 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 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 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 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 18 ms 748 KB Output is correct
17 Correct 192 ms 2528 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 0 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 1 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 1102 ms 16848 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 1690 ms 16972 KB Output is correct
3 Correct 1708 ms 16968 KB Output is correct
4 Correct 1675 ms 16968 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 1690 ms 16972 KB Output is correct
3 Correct 1708 ms 16968 KB Output is correct
4 Correct 1675 ms 16968 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1741 ms 16968 KB Output is correct
7 Correct 1649 ms 16976 KB Output is correct
8 Correct 1756 ms 17052 KB Output is correct
9 Correct 1836 ms 17024 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 1690 ms 16972 KB Output is correct
3 Correct 1708 ms 16968 KB Output is correct
4 Correct 1675 ms 16968 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 159 ms 2528 KB Output is correct
7 Correct 169 ms 2528 KB Output is correct
8 Correct 156 ms 2656 KB Output is correct
9 Correct 165 ms 2560 KB Output is correct
10 Correct 157 ms 2656 KB Output is correct
11 Correct 164 ms 2528 KB Output is correct
12 Correct 166 ms 2528 KB Output is correct
13 Correct 175 ms 2528 KB Output is correct
14 Correct 155 ms 2528 KB Output is correct
15 Correct 197 ms 2528 KB Output is correct
16 Correct 179 ms 2528 KB Output is correct
17 Correct 158 ms 2528 KB Output is correct
18 Correct 1684 ms 17204 KB Output is correct
19 Correct 1676 ms 16952 KB Output is correct
20 Correct 1871 ms 16840 KB Output is correct
21 Correct 202 ms 2568 KB Output is correct
22 Correct 153 ms 2528 KB Output is correct
23 Correct 500 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 188 ms 2528 KB Output is correct
3 Correct 177 ms 2536 KB Output is correct
4 Correct 1861 ms 16968 KB Output is correct
5 Correct 182 ms 2528 KB Output is correct
6 Correct 171 ms 2552 KB Output is correct
7 Correct 175 ms 2528 KB Output is correct
8 Correct 176 ms 2528 KB Output is correct
9 Correct 169 ms 2528 KB Output is correct
10 Correct 179 ms 2664 KB Output is correct
11 Correct 172 ms 2528 KB Output is correct
12 Correct 161 ms 2528 KB Output is correct
13 Correct 182 ms 2528 KB Output is correct
14 Correct 1843 ms 16968 KB Output is correct
15 Correct 181 ms 2656 KB Output is correct
16 Correct 1644 ms 17032 KB Output is correct
17 Correct 1640 ms 16840 KB Output is correct
18 Incorrect 1 ms 364 KB Output isn't correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 17 ms 748 KB Output is correct
3 Correct 17 ms 748 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 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 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 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 18 ms 748 KB Output is correct
17 Correct 192 ms 2528 KB Output is correct
18 Incorrect 0 ms 364 KB Output isn't correct