思维构造
文章平均质量分 70
tdmtdm
tomjobs
别慌,慌也没用
展开
-
Codeforces-1496 E. Garden of the Sun(构造,机智)
There are many sunflowers in the Garden of the Sun.Garden of the Sun is a rectangular table with ???? rows and ???? columns, where the cells of the table are farmlands. All of the cells grow a sunflower on it. Unfortunately, one night, the lightning strok原创 2021-03-12 20:41:10 · 325 阅读 · 0 评论 -
Codeforces-1491 D. Zookeeper and The Infinite Zoo(二进制,思维)
There is a new attraction in Singapore Zoo: The Infinite Zoo.The Infinite Zoo can be represented by a graph with an infinite number of vertices labeled 1,2,3,…. There is a directed edge from vertex ???? to vertex ????+???? if and only if ????&????=???原创 2021-03-01 14:24:49 · 372 阅读 · 1 评论 -
Codeforces-1492 C. Maximum width(构造)
思路:存下sss字符串中每个字母的位置;从前往后考虑,对于ttt字符串的每个位置依次寻找这个字母最近的大于上一次的位置。这样得到一个可行的ppp序列。我们要求最大间隔,所以可以从后往前考虑,找到ttt中每个位置最后一个小于下一次的位置,然后算出当前和之前的差值,就是对于iii这个位置能得到的p[i]−p[i−1]p[i]-p[i-1]p[i]−p[i−1]最大值。#include <cstdio>#include <algorithm>#include <cstr.原创 2021-02-24 00:10:46 · 395 阅读 · 0 评论 -
Codeforces-1492 D. Genius‘s Gambit(二进制,构造)
思路:特殊的情况是k=0k=0k=0的时候,此时直接输出即可。其他情况,很明显最后构造成这样:1xxxxx1xxx01xxxxx0xxx1要求k<a+b−2k<a+b-2k<a+b−2,并且a≥1,b≥2a≥1,b≥2a≥1,b≥2#include <cstdio>#include <algorithm>#include <cstring>#include <iostream>#include <vector>.原创 2021-02-24 00:06:53 · 257 阅读 · 0 评论 -
Codeforces-1487 C. Minimum Ties(构造)
思路:赛中写的复杂些(也过了),这个代码我是参考了别人的,但都没想通证明。不过很明显的是,当nnn为奇数的时候,可以没有平局,只要每个人赢n2\frac{n}{2}2n场就好了。当nnn为偶数的时候,每个人赢n2−1\frac{n}{2}-12n−1场,剩下的场次平局。PS:感觉CF的C题怎么越来越难了,就是那种,可以写,但是很乱搞证明不了。#include <cstdio>#include <cstring>#include <algorithm>#.原创 2021-02-16 16:00:52 · 469 阅读 · 0 评论 -
C - Dancing Queen Gym - 102911D(构造)
As their act for their school’s variety show, Alice and Bob are going to perform their own remix of the classic disco song Dancing Queen! Aside from the chorus, their remix has N different verses to be sung by the two of them.The verses are labeled 1,2,3,原创 2021-01-26 23:00:37 · 214 阅读 · 0 评论 -
Codeforces-1474 E. What Is It?(思维,排列)
Lunar rover finally reached planet X. After landing, he met an obstacle, that contains permutation ???? of length ????. Scientists found out, that to overcome an obstacle, the robot should make ???? an identity permutation (make ????????=???? for all ????)原创 2021-01-20 16:13:39 · 502 阅读 · 1 评论 -
Codeforces-1473 E - Strange Shuffle(交互,巧妙)
This is an interactive problem.???? people sitting in a circle are trying to shuffle a deck of cards. The players are numbered from 1 to ????, so that players ???? and ????+1 are neighbours (as well as players 1 and ????). Each of them has exactly ???? ca原创 2021-01-17 18:01:23 · 388 阅读 · 0 评论 -
2020济南ICPC J.Tree Constructer(二分图,构造)
思路:能想到二分图就感觉挺简单的了。将树染色成二分图,然后取数目较小的那一部分(保证数目不大于50)。对于第一种颜色:将第iii个节点染色成(1<<60)−1−(1<<59)−(1<<i)(1<<60)-1-(1<<59)-(1<<i)(1<<60)−1−(1<<59)−(1<<i),这样保证同色或运算结果不会是(1<<60)−1(1<<60)-1(1<<6.原创 2021-01-11 23:03:27 · 354 阅读 · 0 评论 -
Codeforce-1459 E. Latin Square(置换,有意思的构造)
题意:如图6种操作,求最终序列思路:将数组的变换转换为三元组的变换设三元组初始为(i,j,a[i][j])(i,j,a[i][j])(i,j,a[i][j])则(i,j,a[i][j])(i,j,a[i][j])(i,j,a[i][j])在进行下面的操作后变换为L:(i,j−1,a[i][j])L:(i,j-1,a[i][j])L:(i,j−1,a[i][j])R:(i,j+1,a[i][j])R:(i,j+1,a[i][j])R:(i,j+1,a[i][j])U:(i−1,j,a[i][原创 2020-12-26 16:26:43 · 353 阅读 · 1 评论 -
I - Marbelous Meena Gym - 101864I(gcd,数学)
题意:nnn堆石头。每次可以选择一堆石头移动一些到另外一堆石头上。要求被移动的石堆结果为之前的两倍。求能否将nnn堆石头合成一堆。不行的话,问要给几个石堆增加数目才可行。思路:结论是nnn堆石头的和为SUMSUMSUM,gcdgcdgcd为GCDGCDGCD。如果SUM/GCDSUM/GCDSUM/GCD是2的次幂数,那就可以,否则就不行,并且最多只需要给一个石堆增加数目达到这个要求。证明:SUM=M∗2kSUM=M*2^kSUM=M∗2k,则MMM是一个奇数。合并完成以后肯定剩下一个数目为SUM原创 2020-11-21 19:56:19 · 191 阅读 · 1 评论 -
AtCoder Regular Contest 107 E - Mex Mat(规律)
思路:在i≥4,j≥4i≥4,j≥4i≥4,j≥4的时候,满足a[i][j]=a[i−1][j−1]a[i][j]=a[i-1][j-1]a[i][j]=a[i−1][j−1]。。。mexmexmex真是神奇,刚刚试了一下,对于仅有0,1,2,3的时候也满足这个规律。#include <cstdio>#include <cstring>#include <vector>#include <algorithm>#include <queue.原创 2020-11-14 21:24:05 · 278 阅读 · 0 评论 -
Codeforces 1421 D. Hexagons(推结论)
Lindsey Buckingham told Stevie Nicks “Go your own way”. Nicks is now sad and wants to go away as quickly as possible, but she lives in a 2D hexagonal world.Consider a hexagonal tiling of the plane as on the picture below.Nicks wishes to go from the cell原创 2020-10-24 12:16:28 · 233 阅读 · 0 评论 -
G - Game Design Gym - 102452G(构造)
Tower defence games are the best games to kill time. In this kind of games, the player needs to build towers at certain candidate locations to defend a base building from monsters. The difficulty lies in that the budget for building towers is usually quite原创 2020-10-10 11:16:06 · 423 阅读 · 0 评论 -
B - Boss Battle Gym - 101623B(思维)
题意:有n个位置,敌人可能在任意一个位置。你可以扔一个炸弹,炸掉连续3个位置,之后敌人可以移动到相邻位置或者不动。要求最坏情况下最少要多少炸弹。思路:因为要求最坏情况下的最优值,所以我们要求我们的炸弹可以覆盖所有范围,且炸弹数最少。最优策略就是炸完一个位置,到这个位置下面继续炸。如炸了 1,那么1 2 3都被炸,然后继续炸3,3 4 5被炸,继续炸5以此类推。因为假设你两次爆炸区域之间没有相交,上次爆炸的区间就都成了不安全区域了。第一次:爆炸前:不安全区域为n,安全区域为0。爆炸后:不安.原创 2020-10-09 21:16:43 · 205 阅读 · 2 评论 -
Codeforces 1408 F. Two Different(二进制)
You are given an integer ????.You should find a list of pairs (????1,????1), (????2,????2), …, (????????,????????) (1≤????????,????????≤????) satisfying the following condition.Let’s consider some function ????:ℕ×ℕ→ℕ (we define ℕ as the set of positive i原创 2020-10-02 20:17:12 · 211 阅读 · 0 评论 -
Codeforces 1408 E. Avoid Rainbow Cycles(最大生成树,思维)
You are given ???? sets of integers ????1,????2,…,????????; elements of these sets are integers between 1 and ????, inclusive.There are two arrays of positive integers ????1,????2,…,???????? and ????1,????2,…,????????.In one operation you can delete an e原创 2020-10-02 20:13:58 · 280 阅读 · 0 评论 -
杭电多校第10场 HDU6879 Mine Sweeper(构造)
题意:扫雷游戏,要求你构造最多25*25大的棋盘,合理的放置雷,使得每个位置的权值和为n(n≤1000)。每个位置的权值为周围8个位置雷的数量,雷的权值为0。思路:考虑依次间隔的放雷,那么每个雷的贡献就是8。那么最后可以弄成8x+y的形式。我们依次的凑,可以在全图里凑出这些3 5 6 7 9这几个数。在部分图里凑出1 2 3 4 5 6 7这几个数。当n≤7的时候,按照部分图的样子直接输出。当n≥8的时候,表示成n=8x+y,按照余数分配一下就好了#include <cstd.原创 2020-09-25 22:17:04 · 232 阅读 · 0 评论 -
Codeforces 1388C. Uncle Bogdan and Country Happiness(构造)
Uncle Bogdan is in captain Flint’s crew for a long time and sometimes gets nostalgic for his homeland. Today he told you how his country introduced a happiness index.There are ???? cities and ????−1 undirected roads connecting pairs of cities. Citizens of原创 2020-08-17 00:39:05 · 287 阅读 · 0 评论 -
XOR Tree AtCoder - apc001_f(链变点,状压)
题意:一棵树,每次可以将一个路径上所有边异或x。求最少多少次操作使得所有边为0。思路:和牛客多校那道题很像,都是将链转换到点。https://blog.csdn.net/tomjobs/article/details/107922058考虑链很难搞,想到要转换为考虑点。可以将一个点的点权设置为所有出边的异或值,这样每次修改一条链,相当于把链两边点点权异或x。结果等价于把所有点权变成0。所以可以算出所有点的点权,一开始的时候肯定将点权相同的点搞完。最后剩下的点点权都不同,这个过程可以状压DP.原创 2020-08-16 13:04:30 · 272 阅读 · 0 评论 -
牛客多校第十场 Tournament(构造)
链接:https://ac.nowcoder.com/acm/contest/5675/I来源:牛客网题目描述You are scheduling a tournament. There are n teams. There are \frac{n(n-1)}{2}2n(n−1) competitions against every pair of teams. You can schedule a competition each day. For each team, it will a原创 2020-08-12 10:57:54 · 413 阅读 · 0 评论 -
杭电多校第七场 Increasing and Decreasing(构造)
Problem DescriptionNotice:Don’t output extra spaces at the end of one line.Given n,x,y, please construct a permutation of length n, satisfying that:The length of LIS(Longest Increasing Subsequence) is equal to x.The length of LDS(Longest Decreasing Su原创 2020-08-12 00:14:08 · 283 阅读 · 0 评论 -
牛客多校第十场 Decrement on the Tree(树形DP,思维)
链接:https://ac.nowcoder.com/acm/contest/5675/C来源:牛客网题目描述You are given a tree. There are n vertices and n-1 edges. There is a non-negative weight for each edge in the tree. Every time, you can select two different vertices u, v, and subtract the weight of原创 2020-08-10 22:05:01 · 313 阅读 · 0 评论 -
牛客多校第六场 Grid Coloring(染色,构造)
题意:n∗nn*nn∗n的格子,kkk种颜色。给每条边染色,要求不存在一行或一列颜色相同不存在同色环各种颜色使用的数目相同思路:特判一下无解的情况n==1∣∣k==1∣∣2∗(n+1)∗nmod k !=0n == 1 || k == 1 || 2 * (n + 1) * n \mod k\; != 0n==1∣∣k==1∣∣2∗(n+1)∗nmodk!=0其他情况有解。每一行从左到右顺序染色,从左到右对竖边染色,从上到下执行这个过程。这样可以保证每一行不相同,左右相邻两竖边颜.原创 2020-07-28 21:37:51 · 558 阅读 · 0 评论 -
牛客多校第六场 Easy Construction(构造)
题意:求一个n排列,使得存在i∈[1,n]i∈[1,n]i∈[1,n],连续iii个数的和%n以后的值为k思路:当i=ni=ni=n的时候,%n的值是确定的,所以可以确定kkk的值。之后你按照下面的方式排列,即可满足题意n,k,n−1,1,n−2,2,n−3,3...n,k,n-1,1,n-2,2,n-3,3...n,k,n−1,1,n−2,2,n−3,3...#include <cstdio>#include <cstring>#include <algor.原创 2020-07-28 20:21:39 · 268 阅读 · 0 评论 -
Leetcode周赛 1529. 灯泡开关 IV(翻转)
房间中有 n 个灯泡,编号从 0 到 n-1 ,自左向右排成一行。最开始的时候,所有的灯泡都是 关 着的。请你设法使得灯泡的开关状态和 target 描述的状态一致,其中 target[i] 等于 1 第 i 个灯泡是开着的,等于 0 意味着第 i 个灯是关着的。有一个开关可以用于翻转灯泡的状态,翻转操作定义如下:选择当前配置下的任意一个灯泡(下标为 i )翻转下标从 i 到 n-1 的每个灯泡翻转时,如果灯泡的状态为 0 就变为 1,为 1 就变为 0 。返回达成 target 描述的状态所需原创 2020-07-28 01:05:25 · 577 阅读 · 0 评论 -
Codeforces 1382C2. Prefix Flip (Hard Version)(翻转)
This is the hard version of the problem. The difference between the versions is the constraint on ???? and the required number of operations. You can make hacks only if all versions of the problem are solved.There are two binary strings ???? and ???? of l原创 2020-07-22 10:51:40 · 306 阅读 · 0 评论 -
牛客多校第四场 H.Harder Gcd Problem(构造,素数)
因为题解还没发,严谨的证法不知道,先口胡一下。思路:比较直观的思路就是按照最小素因子分组,然后同一组的两两匹配,最后会有一些落单。最后把落单的单独匹配。但是关键就是这里,怎么匹配落单的。不妨假设你找到了这样的最优匹配方法,分别为(s2,s3)(s2,s3)(s2,s3),(s5,s7)(s5,s7)(s5,s7),(s11,s17)(s11,s17)(s11,s17)…其中sisisi代表中代表最小素因子为iii对应的组。注意到s2s2s2的数目为n/2n/2n/2那么我们完全可以构造出一.原创 2020-07-20 21:03:55 · 313 阅读 · 0 评论 -
Face The Right Way POJ - 3276(翻转)
Farmer John has arranged his N (1 ≤ N ≤ 5,000) cows in a row and many of them are facing forward, like good cows. Some of them are facing backward, though, and he needs them all to face forward to make his life perfect.Fortunately, FJ recently bought an a原创 2020-07-17 21:08:56 · 203 阅读 · 0 评论 -
Highest Tower Gym - 101550H(建图,思路)
题意: n个矩形,要求使得上面矩形宽度严格小于下面矩形,问能够得到的最大高度。思路:很巧妙的思路。首先题目保证一定有解。考虑将每个矩形的边(u,v)设置双向边u->v与v->u,u->v代表选择u为宽,v为高。那么可以建出一张图,这个图可以分出很多连通分量,不同连通分量意味着每个边都是不同的,那么可以在两个连通分量内分别堆成最高的矩形,然后将两者合并,结果仍然最优。所以对连通分量可以分别考虑假设连通分量内有n个点,m条边,代表可以堆m个矩形,最多有n个宽度可以用。要满足题意,.原创 2020-06-14 18:41:54 · 293 阅读 · 0 评论 -
F. Fake Algorithm(构造)2020 年 “联想杯”全国高校程序设计在线邀请赛暨第三届上海理工大学程序设计竞赛
题意: 题中贪心算法用来求划分成一些组,使得组内元素均互质。要求你设计一组数据使得按照题意的贪心算法来跑的结果为X,你的结果为Y。使得Y-X=k。思路:重复题中样例k次即可。。。#include <ctime>#include <iostream>#include <assert.h>#include <vector>#include <queue>#include <cstdio>#include <alg..原创 2020-05-31 00:28:50 · 388 阅读 · 0 评论 -
2019湖南省赛 4 Buttons(推公式)
4 ButtonsBobo lives in an infinite chessboard. Initially he locates at (0,0)(0, 0)(0,0). There are 444 buttons.When the first button is pressed, Bobo moves right for at most aaa cells.When the seco...原创 2020-03-03 22:02:45 · 494 阅读 · 0 评论 -
2019湖南省赛 全 1 子矩阵
全 1 子矩阵Bobo 写了一个 nnn 行 mmm 列的矩阵 Ai,jA_{i, j}Ai,j.首先,他把所有元素 Ai,jA_{i, j}Ai,j (1≤i≤n,1≤j≤m1 \leq i \leq n, 1 \leq j \leq m1≤i≤n,1≤j≤m) 设为 0.然后,他选了 444 个整数 x1,x2,y1,y2x_1, x_2, y_1, y_2x1,x2,y1,y...原创 2020-03-03 21:36:26 · 502 阅读 · 0 评论 -
C1671 [Wannafly冬令营2018Day4]小小马(思维)
题目描述wlswls 有一张 nn 行 mm 列的国际象棋棋盘,上面有一匹马。现在 wlswls 想知道存不存在一条从起点到终点的路径,使得经过的白点和黑点一样多(起点和终点也会计算在内)?马只能走马步,假设马现在在 (x,y)(x,y) 上,它只能跳到 (x-2,y-1)(x−2,y−1), (x-2,y+1)(x−2,y+1), (x-1,y-2)(x−1,y−2), (x-1,y+2)...原创 2019-12-13 19:50:42 · 251 阅读 · 0 评论 -
C1668 [Wannafly冬令营2018Day4]最小边覆盖
题目描述给定一个无向连通简单图 GG(简单图的意思是无自环无重边),它的一个边覆盖是 GG 的边集 EE 的子集 SS,使得 GG 的点集 VV 中的任意一个点都出现在SS中的至少一条边中。这个边覆盖的大小定义为 SS 包含的边数。如果 SS 是所有 GG 的边覆盖中最小的,则称 SS 是图 GG 的最小边覆盖。Gallai 证明了对任意无向连通简单图,它的最大匹配的大小加上最小边覆盖的大小一...原创 2019-12-13 17:17:25 · 193 阅读 · 0 评论 -
D - Soldier and Number Game CodeForces - 546D(素因子+前缀和+读题转化)
D. Soldier and Number Gametime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo soldiers are playing a game. At the beginning first of them ch...原创 2019-03-26 16:05:23 · 257 阅读 · 0 评论 -
C - Mike and Frog CodeForces - 548C(循环节,暴力)
Mike has a frog and a flower. His frog is named Xaniar and his flower is named Abol. Initially(at time 0), height of Xaniar is h1 and height of Abol is h2. Each second, Mike waters Abol and Xaniar.So...原创 2019-03-28 20:47:12 · 264 阅读 · 0 评论 -
B - Wrath CodeForces - 892B(思维,水题)
Hands that shed innocent blood!There are n guilty people in a line, the i-th of them holds a claw with length Li. The bell rings and every person kills some of people in front of him. All people kill...原创 2019-03-28 14:28:14 · 338 阅读 · 0 评论 -
B - Save the problem! CodeForces - 867B
Attention: we lost all the test cases for this problem, so instead of solving the problem, we need you to generate test cases. We’re going to give you the answer, and you need to print a test case tha...原创 2019-08-24 18:05:10 · 222 阅读 · 0 评论 -
B - Arpa and an exam about geometry CodeForces - 851B(几何,构造)
Arpa is taking a geometry exam. Here is the last problem of the exam.You are given three points a, b, c.Find a point and an angle such that if we rotate the page around the point by the angle, the n...原创 2019-08-22 16:11:04 · 278 阅读 · 0 评论