Submission #742729

#	Time	Username	Problem	Language	Result	Execution time	Memory
742729		speedyArda	Strange Device (APIO19_strange_device)	C++14	5 / 100	2425 ms	183864 KiB

strange_device

#include "bits/stdc++.h"

using namespace std;
using ll = long long;
const int MAXN = 2e6+5;
map<ll, bool> visited;
vector< pair<ll, ll> > imp;
ll n, a, b;

int main() 
{
    cin >> n >> a >> b;
    ll sum = 0;
    ll big = 1;
    bool add = false;
    if(1e18 / b < a)
        add = true;
    else
        big = a * b;
    for(int i = 1; i <= n; i++)
    {

        ll f, s;
        cin >> f >> s;
        if(add)
            sum = s - f;
        else 
        {
            if(s - f >= big)
            {
                imp.push_back({0, 1});
                imp.push_back({big - 1, 2});
            } else 
            {
                if(f % big <= s % big)
                {
                    imp.push_back({f % big, 1});
                    imp.push_back({s % big, 2});
                } else 
                {
                    imp.push_back({0, 1});
                    imp.push_back({s % big, 2});
                    imp.push_back({f % big, 1});
                    imp.push_back({big - 1, 2});
                }

            }
            
        }

       
    }

    if(add)
    {
        cout << sum << "\n";
        return 0;
    }
   // cout << seg[0].sum << "\n";
    sort(imp.begin(), imp.end());
        int cnt = 0;
        ll ans = 0;
        ll last = -1;
        for(pair<ll, ll> e : imp)
        {
            //cout << ans << " " << cnt << " " << last << "\n";
            if(last != -1 && cnt > 0)
            {
                ans += e.first - last;
                if(!visited[last])
                {
                    ans++;
                    visited[last] = true;
                }
                visited[e.first] = true;
            }
            if(e.second == 1)
            {
                cnt++;
                last = e.first;
            } else 
            {   
                cnt--;
                last = e.first;
            }   
        }
        cout << ans << "\n";
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 5
• Subtask 3: 5 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 30