樱花满地集于我心，楪舞纷飞祈愿相随

ParatroopersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8516 Accepted: 2573DescriptionIt is year 2500 A.D. and there is a terrible war between the

PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20521 Accepted: 9362DescriptionMirko works on a pig farm that consists of M locked pig-houses and

ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7143 Accepted: 2533 Special JudgeDescriptionAs you know, all the computers use

Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 27258 Accepted: 14171DescriptionA power network consists of nodes (power stations, consum

Sightseeing tourTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9250 Accepted: 3908DescriptionThe city executive board in Lund wants to construct a si

Task ScheduleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8495    Accepted Submission(s): 2600Problem DescriptionOur geometry

方格取数(1)Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8656    Accepted Submission(s): 3299Problem Description给你一个n*n的格子的棋盘，每个格

In the vast waters far far away, there are many islands. People are living on the islands, and all the transport among the islands relies on the ships. 　　You have a transportation company there. Som

这个题就是求包含最少边数的最小割。比赛的时候想到的是把第一次最大流跑出来的割边集流量置1，其余的无穷大，然后再跑一次最大流，发现一直wa。 然后网上原来还有另外一种方法，那就是初始流量先乘上一个比边数大的数，然后加一，然后跑一次最大流，最后对乘上的这个数取模，得出来的就是答案。#include <bits/stdc++.h>using namespace std;const int MAXN =