2016 ICPC China-Final 现场赛总结

  距离比赛结束快有一个礼拜了才抽出时间来写这篇总结。今年比赛打了也有5场了(4场区域赛+1场省赛),也取得了不错的成绩(区域赛两银),总的来说第一年就取得这成绩还是挺高兴的。我们队,我自己都渐渐的趋于成熟。明年的目标毫无疑问的是拿金,那就不能再像今年这么水,这么躺了。

  这场比赛基本上都是队友搞定的。深深的感到自己的无力,必须要更加努力才行了!不能总是成为那个吊车尾,拖后腿的人。天赋不如他人就得花费更多的时间去努力。在此,定下寒假的目标,在家的时间,大概有20来天吧,每天至少2套CF的题目(或者换换口味做别的,但是不能水过!)。一定要坚持下去。

  总的来说,这场下来还是挺开心的,不论是食堂伙食也好啊,其他一方面啊都是可以接受的,拿了个谷歌的帽子和背包也很不错,和铭神合影了也很开心,说不定是刚好吸了铭神的欧气了呢哈哈~

  总之,期末来了,要开始复习了,然后考试完了以后就抓紧地投入到ACM的刷题当中去吧。

  加油啊~!    

      

转载于:https://www.cnblogs.com/zzyDS/p/6192789.html

7-168 Dream to EC-Final 分数 20 作者 吕佳霖 单位 中国计量大学 ICPC Asia East Continent Final, one of the oldest, largest, and most prestigious programming competitions in China, is attracting more and more competitors from all over the country to participate in, including CJLUACMers. Moreover, it's a huge dream for most of them. During these years, the EC-Final was always hosted by Northwestern Polytechnical University (NWPU) in Xi'an City, Shann Xi Province. (Reference: http://m.haiwainet.cn/middle/3542417/2019/1218/content_31684163_1.html) As a competitor of ICPC EC-Final in 2019, Derrick took part in this programming competition and visited Xi'an City. However, Derrick had another dream that would be never come true, which was travelling in the ancient Xi'an City in Tang Dynasty. 微信图片_20210307183647(1).jpg In order to discover the landscape of the ancient Xi'an City, Derrick has already searched enough information about it. Just as Hundreds and Thousands of houses are like a Go game, and twelve streets are like a vegetable garden(百千家似围棋局,十二街如种菜畦)written by Juyi Bai. This poetry vividly demonstrates the structure of the ancient Xi'an City, it consists of several vertical streets and horizontal roads of the same lengths but different widths. Supposed that the shape of whole city is an n×n square, which composed of n vertical streets x 1 ​ , x 2 ​ ,..., x n ​ and n horizontal roads y 1 ​ , y 2 ​ ,..., y n ​ within the same lengths and different widths from centre. Derrick is curious about calculating the area of all intersections, because he wants to calculate the traffic flow accurately at each intersection in the ancient Xi'an City. However, Derrick considers this task is quite easy for you, so Derrick will spin the whole square with 45 degree at first, maybe clockwise or maybe counterclockwise. After that, you are asked to calculate the total area of all intersections for each row and each column. Input Specification: There are multiple test cases. The first line of the input contains an integer T, indicating the number of test cases. For each test case: The first line contains two integers n (1≤n≤1000) and d, indicating the size of the square and the direction of rotating the square. When d=1, it means that the direction of rotation is clockwise. When d=0, it means that the direction of rotation is counterclockwise. The second line contains n integers x 1 ​ , x 2 ​ ,..., x n ​ (0≤x i ​ ≤5×10 4 ), indicating the width of vertical streets at the i-th position from centre. The third line contains n integers y 1 ​ , y 2 ​ ,..., y n ​ (0≤y j ​ ≤5×10 4 ), indicating the width of horizontal roads at the j-th position from centre. It's guaranteed that the sum of n of all test cases will not exceed 2×10 4 . Output Specification: For each case, in the first line output 2n−1 integers separated by a space, indicating the total area of intersections for each row after rotating 45 degree. Similarly, in the second line print 2n−1 integers separated by a space, indicating the total area of intersections for each column after rotating 45 degree. Note: Please, DO NOT output extra spaces at the end of each line, or your answer may be considered incorrect! Sample Input: 1 3 0 1 2 3 3 2 1 Sample Output: 3 8 14 8 3 1 4 10 12 9 Hint: For example, the initial state of 3×3 square, the clockwise state of 3×3 square and the counterclockwise state of 3×3 square are shown as the following, respectively: 微信图片_20210307204029.png 代码长度限制 16 KB Java (javac) 时间限制 2000 ms 内存限制 64 MB Python (python2) 时间限制 2000 ms 内存限制 64 MB Python (python3) 时间限制 2000 ms 内存限制 64 MB 其他编译器 时间限制 1000 ms 内存限制 64 MB 栈限制 8192 KB翻译成中文
07-22
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符  | 博主筛选后可见
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值