Submission #3380848

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>     //pair
#include <utility> //sort

using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> Pll;

Pll input(ll size);

ll maxWork(pair<ll, ll> p, Pll work)
{
    ll start = p.first, end = p.second;
    ll left = start, result = 0;

    for (ll i = 0; i < work.size(); i++)
    {
        if (work[i].first < start || work[i].second > end)
        {
            continue;
        }
        else if (work[i].first < left)
        {
            continue;
        }
        else
        {
            result++;
            left = work[i].second;
        }
    }
    return result;
}

int main()
{
    ll N, Q;
    cin >> N >> Q;
    Pll work(N);
    Pll people(Q);

    work = input(N);
    sort(work.begin(), work.end());
    people = input(Q);

    for (int i = 0; i < Q; ++i)
    {
        /* ここで people(Q)の出来る最大の仕事をカウント */
        cout << maxWork(people[i], work) << endl;
    }
}

//---------------------------------------------

Pll input(ll size)
{
    Pll v(size);
    for (ll i = 0; i < size; ++i)
    {
        ll left, right;
        cin >> left >> right;
        v[i] = make_pair(left, right);
    }
    return v;
}

Submission Info

Judge Result