STL
Effervescence
OIer
展开
-
HDU 1043 Eight(经典八数码)(BFS+STL)
EightTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26254 Accepted Submission(s): 6980Special JudgeProblem Description The 15-puzzle has bee原创 2017-10-18 16:45:29 · 385 阅读 · 0 评论 -
Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) E.Buy Low Sell High
E.Buy Low Sell HighProblem Statement You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of原创 2017-10-02 17:09:32 · 1734 阅读 · 0 评论 -
Codeforces Round #438 (Div. 1 + Div. 2 combined) D. Huge Strings
D. Huge StringsProblem Statement You are given n strings s1s_1, s2s_2, …, sns_n consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings原创 2017-10-06 13:24:42 · 248 阅读 · 0 评论 -
Codeforces Round #443 (Div. 2) E. Tournament
E. TournamentProblem Statement Recently a tournament in k kinds of sports has begun in Berland. Vasya wants to make money on the bets. The scheme of the tournament is very mysteriou原创 2017-11-01 16:14:48 · 526 阅读 · 0 评论 -
[BZOJ5026][JSOI2010]排名(STL优先队列)
题目戳这:http://www.lydsy.com/JudgeOnline/upload/5026.pdf思路&&分析 其实..第一问有O(n)的做法而且很容易想到,但我就是第一第二问都写了优先队列来弄答案..第一问我是对于所有的i,如果a[i]不是0,那么将i向a[i]连一条边,然后对于没有入度的点开始拓扑,用一个大...原创 2018-02-28 16:28:29 · 393 阅读 · 0 评论 -
[BZOJ1058][ZJOI2007]报表统计(STL)
原题传送门分析 这题我们只要用一个multiset维护当前数字集合和相邻数字之差的集合就行了,因为他只有插入没有删除,且每次插入都是在一个块的结尾,所以我们只用记录每个块的开头和结尾就行了。Code#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>using n...原创 2018-09-10 15:44:58 · 281 阅读 · 0 评论 -
Educational Codeforces Round 51 (Rated for Div. 2)F. The Shortest Statement(技巧+最短路)
原题传送门题意 给出一个边比点数多至多20条的无向连通图,每条边有一个边权,多次询问两点间最短路。分析 首先我们选出其中n-1条边建出一颗树,然后将多余的m-n+1条边的两个端点取出来,对所有点跑最短路,由于m−n≤20m-n\leq20m−n≤20,那么我们取出的点最多不会超过2∗(m−n+1)≤422*(m-n+1)\leq422∗(m−n+1)≤42个,我们可以使用Fl...原创 2018-09-21 14:37:39 · 532 阅读 · 0 评论