其他

A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25493 Accepted: 8686DescriptionBackground The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the

Children of the Candy CornTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8062 Accepted: 3529DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies,

棋盤問題Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18653 Accepted: 9256Description在一個給定形狀的棋盤（形狀可能是不規則的）上面擺放棋子，棋子沒有區別。要求擺放時任意的兩個棋子不能放在棋盤中的同一行或者同一列，請編程求解對於給定形狀和大小的棋盤，擺放k個棋子的所有可行的擺放方案C。Input輸入含有多組測試資料。 每組資料的第一行是兩個正整數，n

Max SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 108343    Accepted Submission(s): 24950Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum

11624 - Fire!Time limit: 1.000 seconds#include <cstdio>#include <cstring>const int MAXN = 1001;struct point{ int x, y,step; bool fire;// 迷宮搜尋到的位置是否著火} que[MAXN*MAXN];int r, c, fx, fy;int dx[4]= {1,-1,0,0};int dy[4]= {0,0,1,-1};char

Problem AAlmost Union-FindI hope you know the beautiful Union-Find structure. In this problem, you're to implement something similar, but not identical.The data structure you need to write is also a collection of disjoint sets, supporting 3

RescueTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9912    Accepted Submission(s): 3626Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is

#include<stdio.h>#include<string.h>typedef struct student{      char name[60];      int score;}ss;int main(){     int N,i,j,flag,flag1,flag2;     ss stu1[500],stu2[500];     char temp[60];     int tmp;     while(scanf("%d",&N)!=EOF)  

FDNY to the Rescue!Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2175 Accepted: 655DescriptionThe Fire Department of New York (FDNY) has always been proud of their response time to fires in New York City, but they want to make their

什麼是多重背包呢？        有N 種物品和一個容量為V 的背包。第i 種物品最多有Mi 件可用，每件耗費的空間是Ci，價值是Wi。求解將哪些物品裝入背包可使這些物品的耗費的空間總和不超過背包容量，且價值總和最大。         其中，如果Mi*Ci >= V，那麼這時多重背包等於完全背包問題。否則，將多重背包轉化為01背包做，但是要最佳化一下。（最佳化思想很巧妙，）。偽碼見下：下面是這道題的代碼：/*Poj 1014 Dividing DP 多重背包

    近期演算法課上，剛剛學習了 關於最近點對的相關知識，目前只是參看了大牛的思想 ，寫了個最基本的裸最近點對。下面是兩種方式    蠻力法：#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>using namespace std;struct p{ int x; int y;};double ClosestPoint1(int n,p a[],int

生日蛋糕Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12183 Accepted: 4302Description7月17日是Mr.W的生日，ACM-THU為此要製作一個體積為Nπ的M層生日蛋糕，每層都是一個圓柱體。 設從下往上數第i(1 <= i <= M)層蛋糕是半徑為Ri, 高度為Hi的圓柱。當i < M時，要求Ri > Ri+1且Hi >

Oil DepositsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6187    Accepted Submission(s): 3590Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting

A. Even Oddstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBeing a nonconformist, Volodya is displeased with the current state of things, particularly with the order of natural numbers (natural

ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12809 Accepted: 5414DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For

The DoorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5258 Accepted: 2140DescriptionYou are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 0, x = 10, y =

RaidTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7075 Accepted: 2098DescriptionAfter successive failures in the battles against the Union, the Empire retreated to its last stronghold. Depending on its powerful defense system, the Empire

文章目錄 3027 - Corporative Network 3027 - Corporative NetworkTime limit: 3.000 seconds#include<cstdio>#include<iostream>#include<algorithm>using namespace std;const int maxn=20050;int pre[maxn];int

Heavy CargoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2696 Accepted: 1498DescriptionBig Johnsson Trucks Inc. is a company specialized in manufacturing big trucks. Their latest model, the Godzilla V12, is so big that the amount of

Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23282 Accepted: 12738DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the