2008 Asia Regional Beijing

Pro.ID Title Source (AC/Submit)Ratio
2485 Destroying the bus stations 2008 Asia Regional Beijing (760/2381)31.92%
2486 A simple stone game 2008 Asia Regional Beijing (222/422)52.61%
2487 Ugly Windows 2008 Asia Regional Beijing (588/1474)39.89%
2488 Tornado 2008 Asia Regional Beijing (53/256)20.70%
2489 Minimal Ratio Tree 2008 Asia Regional Beijing (999/3305)30.23%
2490 Parade 2008 Asia Regional Beijing (392/898)43.65%
2491 Priest John‘s Busiest Day 2008 Asia Regional Beijing (478/1733)27.58%
2492 Ping pong 2008 Asia Regional Beijing (1681/4589)36.63%
2493 Timer 2008 Asia Regional Beijing (97/460)21.09%
2494 Elevator 2008 Asia Regional Beijing (56/368)15.22%
时间: 2024-11-11 14:52:52

2008 Asia Regional Beijing的相关文章

2014 ACM/ICPC Asia Regional Beijing Site

1001 A Curious Matt 1002 Black And White 1003 Collision 1004 Dire Wolf 1005 Everlasting L 1006 Fluorescent 1007 GRE Words Once More! 1008 Happy Matt Friends 1009 Intersection 1010 Just A Mistake 1011 K.Bro Sorting

2017 ACM/ICPC Asia Regional Beijing Online

A Visiting Peking University 直接模拟 B Reverse Suffix Array unsolved C Matrix 预处理每列前缀和以及每个每个行区间的每列的最小值,枚举行的所有区间,求最长连续字段和. D Agent Communication unsolved E Territorial Dispute n=1,2时不行 n=3时必须三点共线 n>3一定可以,任意找四个点判断即可. 好像也可以跑凸包,不在凸包上的点单独分开,如果全部在凸包上,找两个不相邻的点

2014 ACM/ICPC Asia Regional Beijing Online HDU 5040 Instrusive 优先队列

WA到死的一道题目. 一个人从起点走到目标点.这个过程中有摄像头,摄像头的照射范围为两个单位长度,包括摄像头自己的位置.为了避免被照射到,可以有两种选择. 在一个位置等待1S,或者坐在盒子里过去(花费3S),走一步花费1S.摄像头每秒顺时针转一次. 1.4S有一个循环,所以每个位置vis[r][c][sec] 四种情况的最优解 2.不用显示构图, 每个摄像头都记录一下四种情况 3.使用优先队列,判断 RE,TLE,WA,AC..... 刚开始每个摄像头旋转的时候没有判断是否在范围内,一直RE,起

2015 ACM/ICPC Asia Regional Beijing Online

A The Cats' Feeding Spots B Mission Impossible 6 模拟题.想法是用结构体数组做一个链表. 比赛的时候WA了.说一下几个注意点. 1.光标到头的时候不能再动了. 2.字符总数不能超过M,如果V操作溢出则不执行V操作(而不是粘贴部分). 3.复制的时候有左右方向. 4.复制状态下进行了除L/R/D以外的操作则停止复制.注意!!此时不更新剪贴板. 5.每次操作之后记得更新光标的位置. 6.每个Case初始化各种变量时,串与剪贴板清空. 反思:比赛的时候思

The 2014 ACMICPC Asia Regional Beijing Online

[E] Explosion Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total [Problem Description] Everyone knows Matt enjoys playing games very much. Now, he is playing such a game. There are N rooms, each with one door.

2014 ACM/ICPC Asia Regional Guangzhou Online Wang Xifeng's Little Plot HDU5024

一道好枚举+模拟题目.转换思维视角 这道题是我做的,规模不大N<=100,以为正常DFS搜索,于是傻乎乎的写了起来.各种条件限制模拟过程 但仔细一分析发现对每个点进行全部八个方向的遍历100X100X100^8 .100X100个点,每个点在走的时候8中选择,TLE 于是改为另一个角度: 以符合要求的点为拐弯点,朝两个垂直的方向走,求出最远的距离.这样只要对每个点各个方向的长度知道,组合一下对应的就OK. 避免了每个点深搜. PS:搜索的时候x,y写反了,导致构图出现问题,以后用[dy][dx]

HDU 5014 Number Sequence(2014 ACM/ICPC Asia Regional Xi&#39;an Online) 题解

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5014 Number Sequence Problem Description There is a special number sequence which has n+1 integers. For each number in sequence, we have two rules: ● ai ∈ [0,n] ● ai ≠ aj( i ≠ j ) For sequence a and sequ

hdu6206 Apple 2017 ACM/ICPC Asia Regional Qingdao Online

地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6206 题目: Apple Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 530    Accepted Submission(s): 172 Problem Description Apple is Taotao's favouri

2016 ACM/ICPC Asia Regional Shenyang Online 1007/HDU 5898 数位dp

odd-even number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 388    Accepted Submission(s): 212 Problem Description For a number,if the length of continuous odd digits is even and the length