Difference between revisions of "2018 CCPC Guilin Onsite"

From EOJ Wiki
Jump to navigation Jump to search
Line 42: Line 42:
  
 
Solved by Xiejiadong. 01:46:47(+)
 
Solved by Xiejiadong. 01:46:47(+)
 +
 +
题意:每次可以将相邻的三个调转位置,求A到B的最小步数
 +
 +
题解:显然奇数位和偶数位独立
 +
 +
问题转换成交换相邻的两个数至少多少次,变成目标状态
 +
 +
把所有的1的座位抠出来,做个绝对值的和
  
 
== Problem E ==
 
== Problem E ==

Revision as of 11:12, 29 October 2018

Replay

oxx1108:

dreamcloud:

Xiejiadong:

  • 座位正好在志愿者边上,比赛前偷偷看了气球,发现黑球巨多,于是猜到了G是签到
  • 上来oxx暴切G,差点一血
  • H没想清楚,疯狂叉自己的代码。自闭
  • 滚榜好有趣啊。配音的裁判最呆萌
  • 穷游中国在群里说两年来第一次银牌,然后跌到铜牌了
  • 似乎压了两支清华队伍,然而并没有什么用
  • 没人跟我讨论C,一个人讨论了一个小时,还是没讨论清楚,Au梦想破灭
  • 桂林的风景真的好美啊
  • 象鼻山边上的酒店七楼阳台西餐真的好浪漫啊(浪漫不是我的
  • 发现从上海到桂林真的要颠簸一整天才能到,睡了一路还是想睡觉

Problem A

Unsolved.(-5)

Problem B

Unsolved.

Problem C

Unsolved.(-5)

Problem D

Solved by Xiejiadong. 01:46:47(+)

题意:每次可以将相邻的三个调转位置,求A到B的最小步数

题解:显然奇数位和偶数位独立

问题转换成交换相邻的两个数至少多少次,变成目标状态

把所有的1的座位抠出来,做个绝对值的和

Problem E

Unsolved.

Problem F

Unsolved.

Problem G

Solved by oxx1108. 00:19:03(+1)

Problem H

Solved by Xiejiadong. 02:25:45(+2)

Problem I

Unsolved.

Problem J

Solved by oxx1108. 02:23:42(+2)

Problem K

Unsolved.

Problem L

Solved by oxx1108. 04:50:55(+2)