题目链接 problem description 5 friends play LOL together . Every one should BAN one character and PICK one character . The enemy should BAN 55 characters and PICK 55 characters . All these 2020 heroes must be different . Every one can BAN any heroes by h

​    ​    ​     ​    ​ 南宁2017ICPC总结 第二次到南宁,高铁三个半小时好像没什么感觉了,广西的天气真的是又湿又冷,而且交通也及其不方面,所以对广西的印象也不是很好.这次承办的是广西大学,这次可能是第一次承办没什么经验,所以很多地方体验没有其他赛区的好,但是整体没出什么大差错表现还算是及格的. 有幸大二就参加了第一次acm的区域赛,最正式的感觉算是这次和上次杭州的ccpc,因为都是真正在一个体育馆里面做题,这种气氛比在机房的那些比赛好多了. 说说这次比赛,热身赛不算很

打了计蒜客上的银川重现赛,总体感觉难度上确实比平时区域赛要低上一些. 这里补一下F题和G题的思路和代码. upd:I题也补了,理解差不多都在注释里. F题        做法,玩一下n=10的样例就出来啦! 解释:显然a^x的反函数为logax,我们先固定外层的求和的a,然后看内层求和的b,b从a开始加到n,注意到对于后半个向上取整的logba,b>=a,所以始终都是1,而对于前半个式子,只有当b经过a^i时才增加,举个例子就是log22~log23向下取整都为1,log24~log27向下取整

2019ICPC银川 作为第一次打区域赛的我,心情异常激动,加上学校给坐飞机(事实上赶飞机很痛苦). 热身赛很难受,oj上不去,写AC自动机输入没写好.. 现场赛,开场直觉倒着看,发现签到.然后看B,先想到了正解,但是不知怎么就去想了另一种解,成功贡献罚时,然后突然就没了思路. 同时换给学长写I,下来和队友想B,这一搞就是一个小时....幸好第二发过了, 两题298名..瞬间自闭.然后队友改I,我跟榜看G,发现G就是个裸线段树. 学长I出现bug了,打印代码下来调,我上去搞G,搞了一半,学长说他

外面吵得风生水起,我校平静地在打比赛,丝毫不知道这次比赛的题目就是把2018银川邀请赛的题照搬过来了QAQ,主办方真牛逼.. A Maximum(思维) 题意:维护一个栈,支持入栈和出栈操作,并计算每次操作后的栈中最大值,得到最终结果. 思路: 这题真的是,我和hxc轮流做这道题,被坑惨了,一直以为使用数据结构来做,没想到点上去.思维题,每次保证栈顶为栈中最大元素.如果当前入栈的元素为x,当前栈顶元素为y,如果x>=y,这个没问题,直接入栈就行了; 如果x<y,我们相当于直接用y替换x,再入栈

目录 一.前言 二.10月19日热身赛 三.10月20日正式赛 四.结果 一.前言 比赛前我们队有ccpc厦门和icpc银川的名额,然而这两个地区的时间正好撞了,考虑到银川更容易拿奖,加上我们ACM协会参加了几年的icpc/ccpc,学校倒是挺支持的,次次报销,但始终没拿到成绩,我们也挺尴尬的,对学校领导也不好交待,没准哪天领导就不允许报销了,所以也算是破釜沉舟,一定要拿奖. 二.10月19日热身赛 热身赛锅挺多的,40分钟后才可以交题,A题是直接输出答案的超简单题目,C题AC自动机,赛前正好学

CS Course Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 593    Accepted Submission(s): 288 Problem Description Little A has come to college and majored in Computer and Science.Today he has lea

A Math Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 817    Accepted Submission(s): 344 Problem Description You are given a positive integer n, please count how many positive integers

题意: 找出不能相互访问的点集的集合的元素数量. 思路: 偏序集最长反链裸题. 代码: #include<iostream> #include<cstring> using namespace std; ; int g[maxn][maxn]; int uN,vN; int linker[maxn]; bool used[maxn]; bool dfs(int u) { ; v < vN; v++) if(g[u][v] && !used[v]) { used

In this problem, we will define a graph called star graph, and the question is to find the minimum distance between two given nodes in the star graph. Given an integer nnn, an n−dimensionaln-dimensionaln−dimensional star graph, also referred to as Sn

There are nnn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with each other, and the overlapped areas of these rectangles shall not be counted more than once. For e

Let SSS be a sequence of integers s1s_{1}s​1​​, s2s_{2}s​2​​, ........., sns_{n}s​n​​ Each integer is is associated with a weight by the following rules: (1) If is is negative, then its weight is 000. (2) If is is greater than or equal to 10000100001

You are given a list of train stations, say from the station 111 to the station 100100100. The passengers can order several tickets from one station to another before the train leaves the station one. We will issue one train from the station 111 to t

描述 You are given a list of integers a0, a1, …, a2^k-1. You need to support two types of queries: 1. Output Minx,y∈[l,r] {ax∙ay}. 2. Let ax=y. 输入 The first line is an integer T, indicating the number of test cases. (1≤T≤10). For each test case: The fi

描述 Ming is going to travel for n days and the date of these days can be represented by n integers: 0, 1, 2, …, n-1. He plans to spend m consecutive days(2 ≤ m ≤ n)in Beijing. During these m days, he intends to use the first day and another day to vis

A .Banana Bananas are the favoured food of monkeys. In the forest, there is a Banana Company that provides bananas from different places. The company has two lists. The first list records the types of bananas preferred by different monkeys, and the s

#1636 : Pangu and Stones 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 In Chinese mythology, Pangu is the first living being and the creator of the sky and the earth. He woke up from an egg and split the egg into two parts: the sky and the earth. At the begi

上一次写这种东西还是天梯赛,当时打完心里也是挺激动的,然后我们队也没有去参加省赛,但是过了一段时间我还是从那里面恢复了出来.因为我当时确实还是很菜的,当时连个暴力都不会,看着自己仅过的那些百度的题目确实还是有点难受的,所以去参加省赛大概也是浪费学校经费吧. 对于一个acmer最重要的是能去参加区域赛,中国赛,能拿到一个牌子,能和大佬同台竞技吧.(其实我是为了更好找工作 我当时也怀疑既然crq不让我参加省赛,那么区域赛我还有机会么,我们这种弱校参加的机会也不多,我可能要等到大三才能参加.恰巧我发现

题目 https://nanti.jisuanke.com/t/16958 题意 给定一个n(n<=500)个点的无向图,给每条边黑白染色,输出同色三角形最少的个数和对应的方案 分析 首先考虑给定一个染色完毕的无向图,如何求同色三角形的个数 同色三角形的个数=总的个数-异色三角形的个数 而一个异色三角形对应两个异色角,所以我们可以通过算异色角的个数来计算异色三角形的个数 而异色角是有一个固定的点i引出去的n-1条边所决定的 设某个点i有$x_i$条1边,有$n-1-x_i$条2边 可以发现异色角

XOR Consider an array AAA with n elements . Each of its element is A[i]A[i]A[i] (1≤i≤n)(1 \le i \le n)(1≤i≤n) . Then gives two integers QQQ, KKK, and QQQ queries follow . Each query , give you LLL, RRR, you can get ZZZ by the following rules. To get

题意: 给定一个数字串,每个位子都能向(i*i+1)%n的位子转移,输出路径上,字典序最大的,长度为n的串. 参考:https://www.cnblogs.com/mountaink/p/9541442.html 思路: BFS, 一个数字肯定是最高位越大,这个数字本身就越大,所以肯定第一位要取最大值,在这一位取最大值的时候后面每一位都要尽量最大,所以想到bfs. 但是bfs肯定要剪枝,怎么剪枝呢? 1.按照思路,我要取每一位尽可能大的值,所以某一个状态的某一位小于我当前以及有的解,这个状态肯定