snowy_smile的博客

应岛娘邀请，自费机票回国打比赛。队名——友谊是魔法。最终榜单如下——https://ccpc.io/post/187这题是场上的L题。一年多不写题也不想题情况下遇上了这场比赛的L题。是个贪心题，所以恰好撞我枪口上了。不夸张地哦，读完题后三分钟内我就会做啦！但是我们读到这道题太晚了，加上当时队友 岛娘 也 大概会做了（噗哈哈>__<），然后题意读得略有误，...

Guan DanTime Limit: 2 Seconds      Memory Limit: 65536 KBBob is playing a poker game called GuanDan. The rules are similar to PaoDeKuai and DouDiZhu. Basically, the game is played on two decks

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre() { freopen("c://test//input.in", "r", stdin); freope

E. Out of Controlstime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputYou are given a complete undirected graph

Appleman and a Sheet of Papertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAppleman has a very big sheet

Bear and Up-Downtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe life goes up and down, just like nice

New Year Book Readingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNew Year is coming, and Jaehyun decid

Beautiful Paintingstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n pictures delivered for the n

H. A + B Strikes Backtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA + B is often used as an example of t

G. On a planetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInputThe first line contains a single intege

F. 000001time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInputThe input contains a single integer a (1 ≤ 

B. z-sorttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA student of z-school found a kind of sorting call

C. Foe Pairstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a permutation p of length n. Al

Vertex CoverTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 131    Accepted Submission(s): 48Special JudgeProblem DescriptionA

Independent SetTime Limit: 1 Second      Memory Limit: 65536 KB      Special JudgeChiaki has a positive integer m and she would like to construct a tree with at most 15 vertices in such a mann

Backpack on TreeTime Limit: 9000/4500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 43    Accepted Submission(s): 14Problem DescriptionThere is a rooted

Mission PossibleTime Limit: 36000/18000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 100    Accepted Submission(s): 16Problem DescriptionMr. Frog loves

Keep In Touch  Accepts: 22  Submissions: 280 Time Limit: 4000/2000 MS (Java/Others)  Memory Limit: 262144/131072 K (Java/Others)问题描述在Byteland一共有nn个城市，编号依次为11到nn，同时有mm条单向道路连接着

Memento MoriTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 132    Accepted Submission(s): 46Problem DescriptionProfessor Zhang has

EurekaTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2448    Accepted Submission(s): 718Problem DescriptionProfessor Zhang draws n 

D. Fix a Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tree is an undirected connected graph witho

#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre() { freopen("c://test//input.in", "r", stdin

Modulo QueryTime Limit: 2 Seconds      Memory Limit: 65536 KB One day, Peter came across a function which looks like:F(1, X) = X mod A1.F(i, X) = F(i - 1, X) mod Ai, 2 ≤ i ≤ N.Where

C. Magnum Opustime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSalve, mi amice.Et tu quidem de lapis philo

A. The Great Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo teams meet in The Game World Champions

C. Table Decorationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have r red, g green and b blue ball

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

SubtreesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 98    Accepted Submission(s): 55Problem DescriptionThere is a complete bin

D. Lazy Studenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudent Vladislav came to his programming exa

#include #include#define MS(x,y) memset(x,y,sizeof(x))typedef long long LL;const int N=1e5+10,M=0,Z=1e9+7,ms63=1061109567;char a[N],b[N];int c[128];void fre(){ freopen("concatenation.in","r",

#include #include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(

#include #include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(

头文件识别+特殊关键词法：#include #include#include#include#include#include#include#include#include#include#include#include#include#include#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memc

D. Once Again...time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array of positive integers a

H. Tourist Guidetime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputIt is not that easy to create a tourist guide as one might expect. A good tourist guide should properly distribute flow of tourists a

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

C. Sorting Railway Carstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn infinitely long railway has a trai

E. Startup Fundingtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn e-commerce startup pitches to the investors to

E. Marblestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the spirit of the holidays, Saitama has given G

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c: