https://www.acwing.com/problem/content/3118/
做法:并查集
逆序枚举,因为最后染色的就是最后的颜色。
find(f[i])表示为右边第一个没有被染色的点,通过f数组跳过已经被染色的区间。
#include <bits/stdc++.h>
using namespace std;
//Filename: 3115.cpp
//
//Author: dezhonger - csdisassembly@gmail.com
//Create: 2021-05-03 00:12:30
//Last modified: 2021-05-03 00:19:38
const int N = 1000010;
int n, m, p, q;
int f[N], a[N];
int find(int x) {
if (f[x] == x) return x;
return f[x] = find(f[x]);
}
int main() {
scanf("%d%d%d%d", &n, &m, &p, &q);
cin >> n >> m >> p >> q;
for (int i = 1; i <= n + 1; i++) f[i] = i;
for (int i = m; i >= 1; i--) {
int x = (i * p + q) % n + 1;
int y = (i * q + p) % n + 1;
if (x > y) swap(x, y);
for (int k = find(x); k <= y; k = find(k)) {
f[k] = k + 1;
a[k] = i;
}
}
for (int i = 1; i <= n; i++) printf("%d\n", a[i]);
return 0;
}