B. Train Seats Reservation You are given a list of train stations, say from the station 1 to the station 100. The passengers can order several tickets from one station to another before the train leaves the station one. We will issue one train from t

11月24号,我们经过26个小时的火车来到了广西南宁,一场漫长的过程. 24号晚到达南宁,做地铁到达学校,找到住的地方,南宁的天真是让人无奈. 25号,上午去广西大学体育馆报道,然后回去好好整理了一下,中午去学校吃了个饭,三点开始开幕式,在体育馆坐着等开幕式开始,这的天气让我感觉到了南方的温度真的好冷啊,三点开幕式开始,半个小时候热身赛开始了,第一题一道简单的循环查找,由于我跟队友传达题意的时候没有统一而错了两次,最后改了下A了,然后第二题的题意出来了,是道数学题,想了几种方法优化,但是时间都会

地址:https://nanti.jisuanke.com/t/17314 题目: Three circles C_{a}C​a​​, C_{b}C​b​​, and C_{c}C​c​​, all with radius RR and tangent to each other, are located in two-dimensional space as shown in Figure 11. A smaller circle C_{1}C​1​​ with radius R_{1}R​1

luogu 1327 数列排序 题意 给定一个数列\(\{an\}\),这个数列满足\(ai≠aj(i≠j)\),现在要求你把这个数列从小到大排序,每次允许你交换其中任意一对数,请问最少需要几次交换? 思路 找循环节.答案即为 (循环节的长度\(-1\)) 对所有循环节求和. 如果只能交换相邻两个,那么就是求逆序对个数.因为交换相邻两个数字的效果是使逆序对个数\(-1\). Code #include <bits/stdc++.h> #define maxn 100010 using name

02Train Seats Reservation 问答 只看题面 33.87% 1000ms 131072K You are given a list of train stations, say from the station 11 to the station 100100. The passengers can order several tickets from one station to another before the train leaves the station on

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

Let SS be a sequence of integers s_{1}s​1​​, s_{2}s​2​​, ......, s_{n}s​n​​Each integer is is associated with a weight by the following rules: (1) If is is negative, then its weight is 00. (2) If is is greater than or equal to 1000010000, then its we

There are nn 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 ex

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 nn, an n-dimensionaln−dimensionalstar graph, also referred to as S_{n}S​n​​, is an

You are given a list of train stations, say from the station 11 to the station 100100. 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 11 to the st

2017 ACM-ICPC 亚洲区(南宁赛区)网络赛  M. Frequent Subsets Problem 题意:给定N和α还有M个U={1,2,3,...N}的子集,求子集X个数,X满足:X是U的子集且出现在M个子集中的次数>=α*M. 题解:因为N<=20,所以U的子集个数最大不过2^20.所以采用二进制把每个子集M映射压缩成一个数,比如: M={1,4,8,10}==>2^(1-0)+2^(4-1)+2^(8-1)+2^(10-1)=1+8+128+512=649(映射记为f,

「ICPC2017 WF」Money for Nothing 传送门 我们可将生产商和消费商都看成二维平面上的点,其坐标分别为 \((d_i,p_i)\),\((e_i,q_i)\). 那么问题转变为: 给定平面上的 \(m\) 个 \(A\) 类点 \((d_i,p_i)\),以及 \(n\) 个 \(B\) 类点 \((e_i,q_i)\).求选择一个 \(A\) 类点作为矩形左下角,一个 \(B\) 类点作为矩形右上角所能得到的最大面积.若不存在这样的矩形就输出零. 考虑如下几种情况. 在

题目大意:给你一个n,然后从1~n隔一个选一个,挑出一个集合然后从集合中继续隔一个挑一个,直到只有一个数,问最后一个数是多少?2<=n<=1050 例如n=5,先选出2,4最后选择4.n=12,先选出2,4,6,8,10,12,再选出4,8,12在选出8. 可以发现这个数字一定是偶数,并且是比n小中被2除最多次的一个数,所以发现就是找一个2的幂次的小于n的最大的数.代码如下: #include<cstdio> #include<algorithm> #include&l

题意: 找出不能相互访问的点集的集合的元素数量. 思路: 偏序集最长反链裸题. 代码: #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

The designers have come up with a new simple game called “Rake It In”. Two players, Alice and Bob, initially select an integer k and initialize a score indicator. An 4 \times 44×4 board is created with 16 values placed on the board. Starting with pla

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

题目链接 题目翻译: 给出一个数n,和一个浮点数a,数n代表全集U = {1,2,...,n},然后给出 M个U的子集,如果一个集合B(是U的子集),M个集合中有至少M*a个集合包含B, 则B这个集合就是一个满足条件的集合,统计U的子集中B这种集合的个数. 对于N个数的集合,其子集,可以从N个里面挑1个,挑2个,...挑N个数构成. C(n,0)+ C(n,1) + C(n,2) + C(n,3) + ..... + C(n,n) = (1+1)^n = 2^n N个数子集共有2^n种状态,其中

2017-09-25 19:58:04 writer:pprp 题意看上去很难很难,但是耐心看看还是能看懂的,给你n位数字 你可以交换第一位和之后的某一位,问你采用最少的步数可以交换成目标 有五组数据 用BFS进行搜索,并进行剪枝,已经搜索过的点不再搜索 #include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <string> #