Schedule

Posted on | In , ,

题目链接

题意

有若干个项目，时间冲突的项目不能在同一台机器上完成，问最少要多少台机器，这时最少要多少总时间。

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[33;1m" << #x << "->" ; err(x);} while (0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x){for (auto v: a) cout << v << ' '; err(x...);}
template<typename T, typename... A>
void err(T a, A... x){cout << a << ' '; err(x...);}
#else
#define dbg(...)
#endif
#define inf 1ll << 50
const int N = 1e5 + 5;

vector<int> des;
int t_sum[2 * N];

int st[N], ed[N];
int mac_st[N], mac_ed[N];

int get_id(int v)
{
	return lower_bound(des.begin(), des.end(), v) - des.begin() + 1;
}
template<class T>
void read(T& ret)
{
	ret = 0;
	char c;
	while ((c = getchar()) > '9' || c < '0');
	while (c >= '0' && c <= '9')
	{
		ret = ret * 10 + c - '0';
		c = getchar();
	}
}
int main()
{
	int T;
	read(T);
	while (T--)
	{
		int n;
		read(n);
		des.clear();
		for (int i = 1; i <= n; i++)
		{
			read(st[i]);
			read(ed[i]);
			des.push_back(st[i]);
			des.push_back(ed[i]);
		}
		sort(des.begin(), des.end());
		des.erase(unique(des.begin(), des.end()), des.end());
		for (int i = 1; i <= n; i++)
		{
			int p = get_id(st[i]);
			t_sum[p]++;
			p = get_id(ed[i]);
			t_sum[p]--;
		}
		int k = 0, cur = 0;;
		for (int i = 0; i <= des.size(); i++)
		{
			if (i > 0)
				t_sum[i] += t_sum[i - 1];
			if (t_sum[i] > k)
			{
				while (k < t_sum[i])
					mac_st[++k] = i;
			}
		}
		cur = 0;
		int kk = 0;
		for (int i = des.size(); i >= 0; i--)
		{
			while (kk < t_sum[i])
			{
				mac_ed[++kk] = i + 1;
			}
		}
		ll ans = 0;
		for (int i = 1; i <= k; i++)
			ans += des[mac_ed[i] - 1] - des[mac_st[i] - 1];
		printf("%d %lld\n", k, ans);
		for (int i = 0; i <= des.size() + 1; i++)
			t_sum[i] = 0;
	}
	return 0;
}
0%