Codeforces Round 361 (Div. 2) E. Mike and Geometry Problem(扫描线)

题意:

$给定N\le 2\times 10^5个线段,现任意选出K\le N个线段,求任意K个线段交点个数和$

分析:

$考虑每个点的贡献,问题就转换成了扫描线统计覆盖\ge K次的线段$
$对于每个这样的线段,对答案的贡献是C_n^k$
$时间复杂度O(nlogn)$

代码:

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
//
// Created by TaoSama on 2016-07-20
// Copyright (c) 2016 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:102400000,102400000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
using namespace std;
#define pr(x) cout << #x << " = " << x << " "
#define prln(x) cout << #x << " = " << x << endl
const int N = 2e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n, k;
int a[N];
typedef long long LL;
LL fact[N], finv[N];
LL quick(LL x, LL n) {
LL ret = 1;
for(; n; n >>= 1) {
if(n & 1) ret = ret * x % MOD;
x = x * x % MOD;
}
return ret;
}
LL C(int n, int m) {
return fact[n] * finv[m] % MOD * finv[n - m] % MOD;
}
int main() {
#ifdef LOCAL
freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
// freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
clock_t _ = clock();
fact[0] = finv[0] = 1;
for(int i = 1; i < N; ++i) {
fact[i] = fact[i - 1] * i % MOD;
finv[i] = quick(fact[i], MOD - 2);
}
while(scanf("%d%d", &n, &k) == 2) {
map<int, int> mp;
for(int i = 1; i <= n; ++i) {
int x, y; scanf("%d%d", &x, &y);
++mp[x];
--mp[y + 1];
}
int sum = 0, ans = 0;
int last = mp.begin()->first;
for(auto& p : mp) {
if(sum >= k) {
ans += C(sum, k) * (p.first - last) % MOD;
if(ans >= MOD) ans -= MOD;
}
sum += p.second;
last = p.first;
}
printf("%d\n", ans);
}
#ifdef LOCAL
printf("\nTime cost: %.2fs\n", 1.0 * (clock() - _) / CLOCKS_PER_SEC);
#endif
return 0;
}


1. 除非注明,本博文即为原创,转载请注明链接地址
2. 本博文只代表博主当时的观点或结论,请不要恶意攻击
3. 如果本文帮到了您,不妨点一下 下面分享到 按钮,让更多的人看到