CF755D PolandBall and Polygon（树状数组）

题目描述

PolandBall has such a convex polygon with nn veritces that no three of its diagonals intersect at the same point. PolandBall decided to improve it and draw some red segments.

He chose a number kk such that $gcd(n,k)=1$ . Vertices of the polygon are numbered from $1$ to $n$ in a clockwise way. PolandBall repeats the following process $n$ times, starting from the vertex $1$ :

Assume you’ve ended last operation in vertex $x$ (consider $x=1$ if it is the first operation). Draw a new segment from vertex x$ to k$ -th next vertex in clockwise direction. This is a vertex $x+k$ or $x+k-n$ depending on which of these is a valid index of polygon’s vertex.

Your task is to calculate number of polygon’s sections after each drawing. A section is a clear area inside the polygon bounded with drawn diagonals or the polygon’s sides.

输入格式

There are only two numbers in the input: $n,k$( $5<=n<=10^6$, $2<=k<=n-2$ , $gcd(n,k)=1$ ).

输出格式

You should print $n$ values separated by spaces. The $i-th$ value should represent number of polygon’s sections after drawing first $i$ lines.

题意翻译

给出一个$n$边形，和距离$k$。 第一次连接$1$和 $k+1$，第二次连接$k+1$和$(k+1+k)$，依次进行$n$次，每次结束后输出$n$边形被分割成了几个区域。

输入输出样例

输入 #1

5 2

输出 #1

2 3 5 8 11 

输入 #2

10 3

输出 #2

2 3 4 6 9 12 16 21 26 31 

说明/提示

The greatest common divisor (gcd) of two integers aa and bb is the largest positive integer that divides both aa and bb without a remainder.

For the first sample testcase, you should output “$235811$”. Pictures below correspond to situations after drawing lines.

题解

• 对于本题，我们可以发现每多一条线它对答案的贡献是它与其他的线的交点$+1$。
• 所以我们只需统计交点即可。
  线段可以被看作有两个点的集合，当我们新加入一条线段时，我们只需将对应两个端点的权值++，即可代表我们加入了这条线段。
• 所以统计交线的个数也就很$easy$了。假设我们要从$l$连向$r$，我们只需计算$sum(r-1)-sum(l)$，即我们只需计算$l,r$中间点的权值和即可。 但是如果$r$的编号超过了$n$，我们就需要对$r$进行取模，这时r有可能会小于$l$，那么我们只需计算$sum(n)+sum(r-1)-sum(l)$。（对照样例的图理解一下吧）
• 注意$k$应该取$min(k,n-k)$以及要开$longlong$

code

#include <bits/stdc++.h> 
using namespace std; 
const int maxn = 1e6 + 1000; 
typedef long long LL; 

int n, k; 
LL c[maxn]; 

inline int lowbit(int x) { return x & (-x); }

inline void add(int x, int val ) {
	for (; x <= n; x += lowbit(x)) c[x] += val; 
}

inline LL query(int x) {
	LL ret = 0; 
	for (; x; x -= lowbit(x)) {
		ret += c[x]; 
	}
	return ret; 
}

int main() {
	scanf("%d%d", &n, &k); 
	k = min(k, n - k); 
	LL ans = 1; int now = 1, to; 
	for (int i = 1; i <= n; ++i) {
		to = now + k; ++ans; 
		if (to > n) {
			to -= n; 
			ans += query(n) + query(to - 1) - query(now); 
		}
		else {
			ans += query(to - 1) - query(now); 
		}
		add(now, 1); add(to, 1); 
		now = to; 
		printf("%lld ", ans); 
	}
	return 0; 
}