杂草园

226. Colored graphtime limit per test: 0.25 sec.memory limit per test: 4096 KBYou are given an oriented graph. Each edge of the graph is colored in one of the three colors. Your task is to find ...

F. Multicolored Markerstime limit per test: 3 secondsmemory limit per test: 256 megabytesinput: standard inputoutput: standard outputThere is an infinite board of square tiles. Initially all t...

E. Tree with Small Distancestime limit per test: 1 secondmemory limit per test: 256 megabytesinput: standard inputoutput: standard outputYou are given an undirected tree consisting of n vertic...

D. Concatenated Multiplestime limit per test: 2 secondsmemory limit per test: 256 megabytesinput: standard inputoutput: standard outputYou are given an array a, consisting of n positive intege...

Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:Copy All: You can copy all the characters present on the notepad (partial copy...

C. Maximal Intersectiontime limit per test: 3 secondsmemory limit per test: 256 megabytesinput: standard inputoutput: standard outputYou are given n segments on a number line; each endpoint of...

B. Creating the Contesttime limit per test: 1 secondmemory limit per test: 256 megabytesinput: standard inputoutput: standard outputYou are given a problemset consisting of n problems. The dif...

A. Many Equal Substringstime limit per test: 1 secondmemory limit per test: 256 megabytesinput: standard inputoutput: standard outputYou are given a string t consisting of n lowercase Latin le...

You are given K eggs, and you have access to a building with N floors from 1 to N. Each egg is identical in function, and if an egg breaks, you cannot drop it again.You know that there exists a f...

101. Dominotime limit per test: 0.25 sec. memory limit per test: 4096 KBDominoes – game played with small, rectangular blocks of wood or other material, each identified by a number of dots, or p...

概述    两个人在用一幅扑克牌比大小，给定牌，问第二个人最多能赢第一个人几张牌。 思路    乍一看是典型的二分匹配，实际无需繁琐的建图过程。    贪心策略是显而易见的：如果要选择一张牌赢或不赢，赢比不赢好，而且赢越大的牌越好。    因此对两组牌从大向小遍历即可。代码#include<bits\stdc++.h> typedef long long...

前言    杭州东站到杭电蛮近的。支付宝真是个好东西。    10月是杭州的旅游旺季，真的很难找到还不错的酒店住，建议提前3个月预定。比赛    竞赛前相关：https://www.ccf.org.cn/c/2018-10-16/653190.shtml    本次题目相关：https://git.thusaac.org/publish/CCSP2018    关于本次比赛...