题目链接 problem 有\(n\)个人,每个人家有一只猫.每个人都认识一些猫(其中肯定包括自己家的猫).选出\(j\)个人和\(k\)只猫\((j,k\ge 1)\).使得\(j+k=n\)且选出的人和猫都互不认识. solution 一个显然但是重要的推论是: 每个人家都必须去一个人或者一只猫. 这样我们只需要枚举第一个人家去的是人还是猫,就可以根据他们之间的关系推出其他的人家是人还是猫.当无论第一家选择人还是选择猫,都会导致去\(n\)只猫或者\(n\)个人时无解. code #incl…

D. Catowice City In the Catowice city next weekend the cat contest will be held. However, the jury members and the contestants haven't been selected yet. There are…

CF1239B The World Is Just a Programming Task 题目描述 定义一个括号序列s是优秀的,当且仅当它是以下几种情况的一种: 1.|s|=0 2.s='('+t+')',其中t是优秀的 3.s=t1+t2,其中t1.t2都是优秀的 一个括号序列的价值为将它看成一个循环串,从多少个位置切开,能切出循环串. 给出一个长度为\(n\)的括号序列,你可以交换其中两个位置的括号(这两个位置可以相等),问最大价值及方案. 输出任意一种方案均正确.\(n\leq 3\tim…

CF1239D Catowice City 有 \(n\) 个人和 \(n\) 只猫.有 \(m\) 对人猫友谊,即第 \(u_i\) 个人认识第 \(v_i\) 只猫,保证第 \(i\) 个人和第 \(i\) 只猫认识.求 \(j\) 个人和 \(p\) 只猫使 \(j+p=n(1\le j,p<n)\),并且这些人和猫互不认识.\(t\) 组测试数据. 数据范围: \(1\le n\le m\le 10^6\),\(1\le \sum n,\sum m\le 10^6\). 首先这是个二分图…

传送门 如果选择 $i$ 当陪审团成员,那么 $i$ 认识的猫一定不能参加 又因为总人数和猫数要为 $n$ ,那么 $i$ 认识的猫 的主人也一定要当陪审团成员(不然总数不够) 所以可以考虑这样构图,对每个人 $i$ 向认识的所有猫的主人 $j$ 连边,那么如果选择 $i$ , $i$ 能到达的所有点都必须选择 所以对于一个点双,选其中任意一个就得选全部 如果这样构完图发现整个图只有一个点双,那么一定是 $\text{No}$ 否则考虑点双之间构成了一个 $DAG$ ,我们只要选择 $DAG$…

题意:1e6个人每人有一只猫 每个人认识自己的猫 现给出一些关系表示一个人认识某只猫 要选出一些人和一些猫 使得每个人都不认识选出来的猫 且人+猫=n 题解:答案肯定是 一个人的集合和一个猫的集合 那么对于某个人 他要么在这个答案集合中 要么不在 我们考虑第一个人 先考虑这个人在答案集合中 如果这个人认识某只猫 那么拥有这只猫的主人显然也应该放在答案集合中 所以不停把人放入队列进来 如果最后这个人的集合没有n个人 则是一种合法的方案 然后考虑第一个人不在答案集合中 那么逆向思维等于我们选了第一个…

目录 \(\bf {Round \ \#500 \ (Div. \ 1)}\) \(\bf {Round \ \#589 \ (Div. \ 2)}\) \(\bf {Avito \ Cool \ Challenge \ 2018}\) \(\bf {Round \ \#545 \ (Div. \ 1)}\) \(\bf {Round \ \#454 \ (Div. \ 1)}\) \(\bf {Round \ \#575 \ (Div. \ 3)}\) \(\bf Codefest \ 19\…

传送门 C. Ivan the Fool and the Probability Theory 题意: 给出一个\(n*m\)的方格,现在要给方格中的元素黑白染色,要求任一颜色最多有一个颜色相同的格子和它相邻.问多少种方案. 思路: 观察到若第一行含有两个相同的颜色相邻,那么之后所有格子的状态都可以确定: 若第一行不含有两个相同的颜色相邻,那么下一行至多有两种状态. 根据这两个观察,可以发现状态数其实不多,我们再推导一下: 对于第一种情况,假设第一个格子为白色,第二个格子有黑白两种选择:若选择白…

点此进入比赛 \(A\):Ivan the Fool and the Probability Theory(点此看题面) 大致题意: 给一个\(n\times m\)的矩阵\(01\)染色,使得不存在某个同色连通块大小超过\(2\). 这道题看似很神仙,实际上仔细想一想.推一推性质,还是比较简单的. 先考虑第一行,这是一个\(1\times m\)的矩阵,可以设\(f_{i,0/1}\)为第\(i\)个格子所填与上个格子不同/相同的方案数,则:\(f_{i,0}=f_{i-1,0}+f_{i-1…

Preface 这场CF真是细节多的爆炸,B,C,F都是大细节题,每道题都写了好久的说 CSP前的打的最后一场比赛了吧,瞬间凉意满满 希望CSP可以狗住冬令营啊(再狗不住真没了) A. Ivan the Fool and the Probability Theory 原谅我脑子不如陈指导好想不出来正解,然后打了个暴力3min找到规律做掉了... 然后讲一下正确的做法(陈指导教我的): 考虑我们用DP做出\(1\times m\)的矩阵的答案记为\(f_m\),考虑用它填了第一行 然后我们考虑第一…

CF1257F Make Them Similar $solution:$ 折半搜索后考虑如何维护两个数组的和,可以将 $A$ 中每个数减 $A_1$ ,$B$ 中每个数被减 $B_1$ ,$map$ 维护一下即可. #include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<map> #include<vector> using…

2001: [Hnoi2010]City 城市建设 Time Limit: 20 Sec  Memory Limit: 162 MBSubmit: 1132  Solved: 555[Submit][Status][Discuss] Description PS国是一个拥有诸多城市的大国,国王Louis为城市的交通建设可谓绞尽脑汁.Louis可以在某些城市之间修建道路,在不同的城市之间修建道路需要不同的花费.Louis希望建造最少的道路使得国内所有的城市连通.但是由于某些因素,城市之间修建道路需…

原文 Some fresh air After your time underground,you can return to ground level or maybe even a little higher at Kosciuszko Mound. The 34-meter hill is a memorial for a Polish military hero but also offers a panoramic view of surrounding city from top.…

原文 History lives on in this distinguished Polish city Though it may be ancient. KraKow, Poland, is alive and well as it celebrates and commemorates its meaningful history. Looking up When scaning the skies of Krakow,most agree that Wawel Castle cast…

时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 Little Hi gets lost in the city. He does not know where he is. He does not know which direction is north. Fortunately, Little Hi has a map of the city. The map can be considered as a grid of N*M blocks. Each blo…

Here is a brief outline of the steps needed to install GeoIP Legacy City on Linux/Unix. The installation on Windows is similar, just replace the tar command with WinZip or a similar ZIP program. Step 1 – Download database For GeoIP clients, go to the…

[POJ3277]City Horizon 试题描述 Farmer John has taken his cows on a trip to the city! As the sun sets, the cows gaze at the city horizon and observe the beautiful silhouettes formed by the rectangular buildings. The entire horizon is represented by a numb…

书名:the City of Ember(中文名:微光城市) 作者:Jeanne DuPrau 单词数:6.2万 不重复单词数:未知 首万词不重复单词数:未知 蓝思值:未知 阅读时间:2015年4月24日 – 4月28日 上一本<纳尼亚传奇I>读完后,想读一本与程序员相关的英文书籍,又不想找太专业的编程方面的书籍,看看以前的书单,已经忘了<Zen and the Art of Motorcycle Maintenance>这本书是哪位程序员大师推荐的了.我也非常奇怪,为什么程序员的…

POJ 3277 City Horizon Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18466 Accepted: 5077 Description Farmer John has taken his cows on a trip to the city! As the sun sets, the cows gaze at the city horizon and observe the beautiful silho…

F - City Game Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1505 Appoint description: Description Bob is a strategy game programming specialist. In his new city building game the gaming enviro…

The blocks in the city of Fishburg are of square form. N avenues running south to north and Mstreets running east to west bound them. A helicopter took off in the most southwestern crossroads and flew along the straight line to the most northeastern…

Bob is a strategy game programming specialist. In his new city building game the gaming environment is as follows: a city is built up by areas, in which there are streets, trees, factories and buildings. There is still some space in the area that is…

题意: 输入数据n,m.n代表工厂的数量,m代表城市的数量. 接下来n+m行为工厂和城市的坐标. 规定如图所示方向刮风,工厂的air会污染风向地区的air. 注意,工厂和城市的坐标表示的是从x到x+1从y到y+1之间小正方形都是工厂区域,规定如果只有一个coner的air被污染那么该地区视为无污染. 要求输出有多少不被污染的城市. 坑: 思考了很多问题.... 1.加入某城市的正下方是工厂怎么办...这个是否算污染. 2.假如有两个角被污染了怎么办...算污染吗. 坑了一整天.没办法找大神的代码…

1307: City Tour Time Limit: 1 Sec  Memory Limit: 128 MB [Submit][Status][Web Board] Description Alice想要从城市A出发到城市B,由于Alice最近比较穷(不像集训队陈兴老师是个rich second),所以只能选择做火车从A到B.不过Alice很讨厌坐火车,火车上人比较多,比较拥挤,所以Alice有很严格的要求:火车的相邻两站间的最大距离尽可能的短,这样Alice就可以在停站的时候下车休息一下.当…

题目连接 http://poj.org/problem?id=1840 Battle City Description Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now. What we are discussing is a simple edition of this game. Giv…

City Driving 题目连接: http://codeforces.com/gym/100015/attachments Description You recently started frequenting San Francisco in your free time and realized that driving in the city is a huge pain. There are only N locations in the city that interest yo…

Eliza Doolittle lyrics  Big City 歌词很好,现在还没有,以后添加进来.…

http://poj.org/problem?id=3277 City Horizon Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 15255   Accepted: 4111 Description Farmer John has taken his cows on a trip to the city! As the sun sets, the cows gaze at the city horizon and o…

1. create a project using city bars template in sencha architect 2. save your project name as CityBars 3. modify your controll code to: Ext.define('CityBars.controller.Business', { extend: 'Ext.app.Controller', config: { refs: { dataList: '#dataList'…

Wow! Such City! Time Limit: 15000/8000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others) Total Submission(s): 824    Accepted Submission(s): 310 Problem Description Doge, tired of being a popular image on internet, is considering moving…