2016年07月_无语_

原创暑假训练round 3 题解

今天做题运气出奇的好，除了几处小错误调试之后忘记改掉了……最后还AK了……虽然题目不难，学长也说是福利局，但是对个人的鼓励作用还是挺大的……至此暑假训练就结束了，也算没有遗憾……。题解如下：Problem A: 苦逼的MCATime Limits: 1000 MS Memory Limits: 65536 KB64-bit interger IO f

2016-07-31 21:41:30 615

原创 Educational Codeforces Round 15 C. Cellular Network（二分）

C. Cellular Networktime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n points on the straight

2016-07-31 11:36:03 713

原创 HDU 1044 Collect More Jewels（BFS+DFS）

Collect More JewelsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6713 Accepted Submission(s): 1558Problem DescriptionIt is

2016-07-29 18:00:45 512

原创 NBOJv2 Problem 1009 蛤玮的魔法（二分）

Problem 1009: 蛤玮的魔法Time Limits: 1000 MS Memory Limits: 65536 KB64-bit interger IO format: %lld Java class name: MainDescription为了成为魔法少女,蛤玮正在学习画魔法阵,他首先画了一个正n边形

2016-07-28 23:02:51 657

原创 HDU 1016 Prime Ring Problem（经典DFS+回溯）

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42600 Accepted Submission(s): 18885Problem DescriptionA rin

2016-07-27 17:57:02 441

原创 HDU 2181 哈密顿绕行世界问题（经典DFS+回溯）

哈密顿绕行世界问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3105 Accepted Submission(s): 1918Problem Description一个规则的实心十二面体，它的 2

2016-07-27 16:22:47 844

原创 OpenCV学习笔记——滑动条开关

由于opencv库中并没有专门为开关而设的函数，可以用滑动条做开关代码：#include#includeint g_switch_value = 0;IplImage *img;void switch_off_fcuntion();void switch_on_function();void switch_callback(int position){ if (!posit

2016-07-27 14:46:18 724

原创 POJ 3321 Apple Tree（DFS序+线段树单点修改区间查询）

Apple TreeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 25904 Accepted: 7682DescriptionThere is an apple tree outside of kaka's house. Every autumn,

2016-07-26 14:04:37 726

原创暑假训练round2 D: 好序列（Manacher）

Problem 1061: 好序列Time Limits: 1000 MS Memory Limits: 65536 KB64-bit interger IO format: %lld Java class name: MainDescription杨神觉得好的序列需要符合这两个条件1.这段序列可以平均分成三段

2016-07-25 15:24:55 662

原创 HDU 1698 Just a Hook（线段树区间替换）

Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27359 Accepted Submission(s): 13593Problem DescriptionIn the game

2016-07-25 14:22:46 486

原创 HDU 5521 Meeting（虚拟节点+最短路）

MeetingTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1358 Accepted Submission(s): 435Problem DescriptionBessie and her f

2016-07-24 17:57:52 566

原创 NBOJv2 1034 Salary Inequity（DFS序+线段树区间更新区间（最值）查询）

Problem 1034: Salary InequityTime Limits: 10000 MS Memory Limits: 200000 KB64-bit interger IO format: %lld Java class name: MainDescriptionThere is a large co

2016-07-22 17:46:11 531

原创 NBOJv2 1004 蛤玮打扫教室（线段树区间更新区间最值查询）

Problem 1004: 蛤玮打扫教室Time Limits: 1000 MS Memory Limits: 65536 KB64-bit interger IO format: %lld Java class name: MainDescription现在知道一共有n个机房,算上蛤玮一共有m个队员,教练做了m个

2016-07-21 16:26:04 613

原创 NBOJv2 1050 Just Go（线段树/树状数组区间更新单点查询）

Problem 1050: Just GoTime Limits: 3000 MS Memory Limits: 65536 KB64-bit interger IO format: %lld Java class name: MainDescriptionThere is a river, which conta

2016-07-19 12:35:02 723

原创 POJ 3468 A Simple Problem with Integers（线段树区间更新区间查询）

A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 92632 Accepted: 28818Case Time Limit: 2000MSDescriptionYou have N

2016-07-18 15:27:22 584

原创 HDU 1754 I Hate It（线段树单点更新区间最值查询）

I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 62944 Accepted Submission(s): 24440Problem Description很多学校流行一种比较的习惯。

2016-07-17 23:35:12 458

原创 HDU 1166敌兵布阵+NOJv2 1025: Hkhv love spent money（线段树单点更新区间查询）

敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 73866 Accepted Submission(s): 30997Problem DescriptionC国的死对头A国这段时间正在进行军事演

2016-07-17 15:04:19 570

原创 GDUT——1169: Krito的讨伐（优先队列BFS）

1169: Krito的讨伐Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 619 Solved: 102DescriptionKrito终于干掉了99层的boss，来到了第100层。第100层可以表示成一颗树，这棵树有n个节点（编号从0到n-1），树上每一个节点可能有很多只怪物。 Krito现在在0号节点，现在它想要

2016-07-16 15:22:10 483

原创 HDU——2444The Accomodation of Students（BFS判二分图+最大匹配裸题）

The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4915 Accepted Submission(s): 2260Problem Description

2016-07-16 11:19:19 429

原创 HDU——1045Fire Net（最大匹配）

Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9897 Accepted Submission(s): 5750Problem DescriptionSuppose that we h

2016-07-15 23:32:22 462

原创 OpenJ_Bailian——4115鸣人和佐助（带状态的A*）

鸣人和佐助Time Limit: 1000MSMemory Limit: 65536KB64bit IO Format: %I64d & %I64uSubmit StatusDescription佐助被大蛇丸诱骗走了，鸣人在多少时间内能追上他呢？已知一张地图（以二维矩阵的形式表示）以及佐助和鸣人的位置。地图上的每个位置

2016-07-13 11:52:57 890

原创 UVA——1600Patrol Robot（A*或普通BFS）

Patrol RobotTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluDescriptionA robot has to patrol around a rectangular area which is in a form o

2016-07-12 12:28:43 654

原创 POJ——2449Remmarguts' Date（A*+SPFA）

Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 26504 Accepted: 7203Description"Good man never makes girls wait or breaks an appointme

2016-07-11 11:12:02 511

原创暑假训练Round1——G: Hkhv的水题之二（字符串的最小表示）

Problem 1057: Hkhv的水题之二Time Limits: 1000 MS Memory Limits: 65536 KB64-bit interger IO format: %lld Java class name: MainDescription杨神喜欢字符串，于是他写程序随机生成了n个长度不大于1

2016-07-10 23:14:46 578

原创 Codeforces Round #354 (Div. 2)——C. Vasya and String（尺取）

C. Vasya and Stringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputHigh school student Vasya got a string o

2016-07-10 10:38:20 425

原创 NOJ——1628Alex’s Game(III)（DFS+回溯）

[1628] Alex’s Game(III)时间限制: 1000 ms　内存限制: 65535 K问题描述Alex likes to play with one and zero as you know .But Alex does’t have a girlfriend now because his girlfriend is trapped in Alc

2016-07-08 23:44:24 528

原创 Codeforces Round #361 (Div. 2)——B. Mike and Shortcuts（BFS+小坑）

B. Mike and Shortcutstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Mike was very busy with stu

2016-07-08 09:44:41 531

原创 Codeforces Round #360 (Div. 2)——C. NP-Hard Problem（BFS染色判二分图）

C. NP-Hard Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Pari and Arya did some researc

2016-07-07 20:15:58 588

原创 HDU——2955Robberies（小数背包）

RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19862 Accepted Submission(s): 7344Problem DescriptionThe aspiring Ro

2016-07-07 13:11:42 1437

原创 HDU——1059Dividing（母函数或多重背包）

DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23277 Accepted Submission(s): 6616Problem DescriptionMarsha and Bill

2016-07-06 22:01:26 445

原创 HDU——2082找单词（母函数）

找单词Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5957 Accepted Submission(s): 4185Problem Description 假设有x1个字母A， x2个字母B,….. x26个字母Z，同时假设字

2016-07-03 22:44:03 477

原创 HDU——3786找出直系亲属（DFS+回溯）

找出直系亲属Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1541 Accepted Submission(s): 621Problem Description如果A，B是C的父母亲，则A，B是C的p

2016-07-01 19:22:13 651

原创 HDU——2612Find a way（多起点多终点BFS）

Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9698 Accepted Submission(s): 3165Problem DescriptionPass a year lea

2016-07-01 16:28:05 750

原创 HDU——1242Rescue（BFS+优先队列求点图最短路）

RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25203 Accepted Submission(s): 8936Problem DescriptionAngel was caught b

2016-07-01 11:26:32 513

原创 NOJ——1642简单的图论问题?（BFS+优先队列）

[1642] 简单的图论问题?时间限制: 5000 ms　内存限制: 65535 K问题描述给一个 n 行 m 列的迷宫,每个格子要么是障碍物要么是空地。每个空地里都有一个权值。你的任务是从找一条(r1,c1)到(r2,c2)的路径,使得经过的空地的权值之和最小。每一步可以往上下左右四个方向之一移动一格,但不能斜着移动,也不能

2016-07-01 00:52:01 635

Frozen_Forest