NKBUS - Bus

Tác giả: ladpro98

Ngôn ngữ: C++

#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <ctime>
#include <memory.h>
#include <cassert>
#include <climits>
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, a, b) for(int i = (a); i <=(b); i++)
#define FORD(i, a, b) for(int i = (a); i > (b); i--)
#define REPD(i, a, b) for(int i = (a); i >=(b); i--)
#define TR(it, a) for(typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define RESET(a, v) memset((a), (v), sizeof((a)))
#define SZ(a) (int((a).size()))
#define ALL(a) (a).begin(), (a).end()
#define PB push_back
#define MP make_pair
#define LL long long
#define LD long double
#define II pair<int, int>
#define X first
#define Y second
#define VI vector<int>

const int N = 202020;

using namespace std;

int delayTime[N]; LL sumDelay;
VI people[N]; int totalPeople;
int n, m;

int cnt(LL delay) {
    int ret = 0, now = delay;
    FOR(i, 0, n) {
        TR(it, people[i])
            ret += *it <= now;
        now += delayTime[i];
    }
    return ret;
}

int main() {
    ios :: sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    int k;
    FOR(i, 0, n) {
        cin >> delayTime[i] >> k;
        people[i] = VI(k);
        FOR(j, 0, k) cin >> people[i][j];
        totalPeople += k;
        sumDelay += delayTime[i];
    }
    int maxCarry = min(totalPeople, m);
    LL l = 0, r = INT_MAX, ans;
    while (l <= r) {
        LL mid = (l + r) >> 1;
        if (cnt(mid) >= maxCarry) {
            ans = mid; r = mid - 1;
        }
        else
            l = mid + 1;
    }
    cout << ans + sumDelay;
    return 0;
}

Download