这题简直蛋疼死。。。。。 A了一下午 #include<cstdio>#include<queue>#include<cstring>#include<algorithm>using namespace std;typedef long long LL;const int maxn = 200005;int h,w,n;int C1[maxn],C2[maxn];int
B题:Glass and Mug 标签:模拟题意:给定 G G G容量的玻璃杯和 M M M容量的马克杯,一开始两个杯子里面都没水,给定以下操作先后顺序,求 K K K次操作之后,两个杯子中各自的水量。( G < M G<M G<M) 如果玻璃杯装满水(即装满 G G G),倒掉玻璃杯中所有水。否则,如果马克杯是空的,装满水。否则,将马克杯中的水倒到玻璃杯中。 题解:按照题目要求模拟就好了
Leonid wants to become a glass carver (the person who creates beautiful artworks by cutting the glass). He already has a rectangular w mm × h mm sheet of glass, a diamond glass cutter and lots of