模拟
不可知论大祭司
Know how to solve every problem that has been solved.
展开
-
【CF1478C】Nezzar and Symmetric Array
code#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <queue>#include <set>#include <map>#include <cstring>using namespace std;typedef long long ll;int n;void sol原创 2021-01-29 10:46:28 · 253 阅读 · 2 评论 -
【CF1463C】Busy Robot
链接传送门code果然这个数据范围会爆int#include <cstdio>#include <algorithm>#include <cstring>#include <cctype>#include <vector>#define int long longusing namespace std;inline int read(){ int x = 0, op = 1; char ch = getchar()原创 2021-01-21 10:16:18 · 144 阅读 · 0 评论 -
【CF467C】Sequence Transformation
链接代码#include <iostream>#include <algorithm>#include <map>using namespace std;const int N = 2e5 + 10;map<int, int> mp;void solve(){ mp.clear(); int n; int a[N] = {0}; cin >> n; for (int i = 1; i &.原创 2021-01-18 15:40:54 · 83 阅读 · 0 评论 -
【LuoguP3611 】[USACO17JAN]Cow Dance Show S 优先队列
二分 + 优先队列链接概述思路代码链接传送门概述经过几个月的排练,奶牛们基本准备好展出她们的年度舞蹈表演。今年她们要表演的是著名的奶牛芭蕾——“cowpelia”。表演唯一有待决定的是舞台的尺寸。一个大小为K的舞台可以支持K头牛同时在舞台上跳舞。在牛群中的N头牛(1<=N<=10,000)按照她们必须出现在舞蹈中的顺序方便地编号为1…N。第i头牛计划跳d[i]的特定持续时间。一开始,第1…K头牛出现在舞台上并开始跳舞。当这些牛中的某一头牛首先完成了她的部分,她会马上离开舞台并且第K+原创 2020-12-26 12:47:17 · 396 阅读 · 0 评论 -
【CF913B】Christmas Spruce
链接传送门代码#include <iostream>#include <algorithm>using namespace std;const int N = 1e4 + 10;int n;int out[N], par[N], son[N];int main() { ios::sync_with_stdio(false); cin.tie(), cout.tie(); cin >> n; for (int i = 2原创 2020-12-16 07:54:45 · 155 阅读 · 0 评论 -
【CF1188A1】Add On A tree
这里写目录标题一级目录二级目录三级目录一级目录二级目录三级目录#include <iostream>#include <algorithm>using namespace std;const int N = 2e5 + 10;int rud[N], n;int main() { ios::sync_with_stdio(false); cin.tie(), cout.tie(); cin >> n; for (int i原创 2020-12-10 07:12:25 · 191 阅读 · 0 评论 -
【CF1304C】Air Conditioner
Air Conditioner题目描述题目大意题目链接代码1代码2题目描述Gildong owns a bulgogi restaurant. The restaurant has a lot of customers, so many of them like to make a reservation before visiting it.Gildong tries so hard to satisfy the customers that he even memorized all custom原创 2020-12-08 19:34:06 · 290 阅读 · 0 评论