摘要: 确定比赛名次 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22679 Accepted Submission(s): 9193 Problem 阅读全文
posted @ 2016-08-20 20:26 猪突猛进!!! 阅读(181) 评论(0) 推荐(0) 编辑
摘要: Problem Description Luxer is a really bad guy. He destroys everything he met. One day Luxer went to D-city. D-city has N D-points and M D-lines. Each 阅读全文
posted @ 2016-08-20 20:25 猪突猛进!!! 阅读(155) 评论(0) 推荐(0) 编辑
摘要: 。,。 还是待整理#include <stdio.h> const int max_num = 100000+10; typedef struct { int num,root,conn;//数据、根、入度 }Node; Node node[max_num]; void init() { for(i 阅读全文
posted @ 2016-08-20 16:34 猪突猛进!!! 阅读(181) 评论(0) 推荐(0) 编辑
摘要: 思路待整理#include<cstdio> #include<iostream> #include<vector> #include<queue> #define maxn 2005 using namespace std; string mapp[maxn]; int n,du[maxn]; ve 阅读全文
posted @ 2016-08-20 16:33 猪突猛进!!! 阅读(107) 评论(0) 推荐(0) 编辑
摘要: 小希的迷宫 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description 上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样, 阅读全文
posted @ 2016-08-20 10:59 猪突猛进!!! 阅读(141) 评论(0) 推荐(0) 编辑
摘要: #include<cstdio> #include<iostream> #include<cstdio> #define maxn 2000005 using namespace std; int pre[maxn<<1]; int find(int r) { if(pre[r]==r) retur 阅读全文
posted @ 2016-08-20 09:49 猪突猛进!!! 阅读(167) 评论(0) 推荐(0) 编辑