acwing 3115 bzoj2054 疯狂的馒头

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:38const 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;
}

acwing 3115 bzoj2054 疯狂的馒头相关推荐

bzoj2054疯狂的馒头（巧用非递归并查集）
www.cnblogs.com/shaokele/ bzoj2054:疯狂的馒头 Time Limit: 10 Sec Memory Limit: 162 MB Description Input 第 ...
bzoj2054 疯狂的馒头
bzoj上现在找不到这题,所以目前只是过了样例,没有测 2054: 疯狂的馒头 Time Limit: 10 Sec Memory Limit: 162 MB Submit: 715 Solved ...
BZOJ2054疯狂的馒头
2054: 疯狂的馒头 Time Limit: 10 Sec Memory Limit: 162 MB Submit: 634 Solved: 250 Description Input 第一行四个正 ...
BZOJ2054 疯狂的馒头并查集
2054: 疯狂的馒头 Time Limit: 10 Sec Memory Limit: 162 MB Submit: 974 Solved: 423 [Submit][Status][Discuss ...
BZOJ2054: 疯狂的馒头(并查集)
题意题目链接 Sol 直接倒着并查集一波就行了 #include<bits/stdc++.h> // #define int long long using namespace std; ...
疯狂的馒头（bzoj2054)
问题 G: 疯狂的馒头(bzoj2054) 时间限制: 1 Sec 内存限制: 128 MB 提交: 93 解决: 26 [提交][状态] 题目描述输入第一行四个正整数N,M,p,q 输出一共输 ...
【BZOJ 2054】疯狂的馒头
2054: 疯狂的馒头 Time Limit: 10 Sec Memory Limit: 162 MB Submit: 449 Solved: 175 [ Submit][ Status] D ...
【ACWing】3115. 疯狂的馒头
题目地址: https://www.acwing.com/problem/content/description/3118/ CQF十分喜欢吃馒头.兴奋之下他一下子买了NNN个馒头请所有认识他的人吃. ...
3115. 疯狂的馒头
CQF 十分喜欢吃馒头. 兴奋之下他一下子买了 N 个馒头请所有认识他的人吃. 但是 CQF 不喜欢白色,喜欢红色.黄色.绿色等鲜艳的颜色. 于是他把所有白色的馒头排成一列. 然后进行 M 次染色操作 ...

acwing 3115 bzoj2054 疯狂的馒头

acwing 3115 bzoj2054 疯狂的馒头相关推荐

最新文章

热门文章