题目链接:AtCoder Beginner Contest 362 A. Buy a Pen tag:签到 B. Right Triangle tag:模拟 C. Right Triangle tag:贪心 Description:给定n对整数li,ri;求一个整数序列,满足li<=xi<=ri,且∑inxi=0;如果没有则输出−1。 Solution:先判断是否有解,令mi=∑inli,ma=∑inri。如果且且mi<=0且ma>=0有...
AtCoder Beginner Contest 362 AtCoder Beginner Contest 362 前言 vp 的时候出了四题,被 C 题卡了一会,很久才出,D 题是 dijkstra 的板子,改下条件即可,E 题是个计数 dp,这类题一直不怎么擅长,想起之前杭电第一场那个序列立方的题也是类似这种计数 dp,需要加强练习。
思路:题目显然是构造题,容易发现只要\sum_{i=1}^{N}L_i\leq0 \leq \sum_{i=1}^{N}R_i必定有\sum_{i=1}^{N}X_i=0序列,这是充要条件。可以从两种方法去构造,我这里是从最小构造,根据dist=|\sum_{i=1}^{N}L_i-0|的情况,直接能调整到R的全部调整到R,看一下代码就明白了 Code #includ...
题目链接:AtCoder Beginner Contest 362 A. Buy a Pen tag:签到 B. Right Triangle tag:模拟 C. Right Triangle tag:贪心 Description:给定n对整数 li,ri ;求一个整数序列,满足 li<=xi<=ri ,且 ∑inxi=0 ;如果没有则输出-1。 Solution:先判断是否有解,令 mi=∑inli,ma=∑inri 。如果mi <= 0 且...
AtCoder Beginner Contest 291 | ABC 吊打萌新珍贵录像 | A~G 题解 121 -- 2:34:14 App yukicoder contest 435 | 完成度 [5 / 7] 274 -- 1:56:52 App AtCoder Beginner Contest 363 | 完成度 [6 / 7] 129 -- 2:34:36 App Codeforces Round 955 (Div. 2) | 完成度 [4 / 6] 354...
·AtCoder Beginner Contest (ABC) 这是最频繁且最简单的入门赛,通常情况下每月至少举行2次。2019年4月27日(含)之前,每场比赛共4题,时长100分钟,满分1000分且Rating超过1199的选手不计Rating值。自2019年5月19日起改版升级为6道题目,时长不变,满分2100分且Rating值超过1999的选手不计Rating值。改版之后比赛质量...
A 5.6% failure chance per testcase isn't very encouraging, though it's unlikely that all 28 testscases from the AtCoder's set are stressing the worst possible scenario. So I got my AC verdict on the 3rd attempt during the contest. This wouldn't work well on Codeforces because of system...
AtCoder Beginner Contest 169(题解)E - Count Median结论题给定nnn个xi∈[ai,bi]x_i\in[a_i,b_i]xi∈[ai,bi],求中位数的个数。定义:k=⌊n2⌋k=\lfloor\dfrac{n}{2}\rfloork=⌊2n⌋,对a,ba,ba,b进行排序后,为ak+1a_{k+1}ak+1为aia_iai的中位数,bk+1...
Σ 大赛——AtCoder Beginner Contest 353 https://www.bilibili.com/video/BV1kt421u7XK/ https://www.bilibili.com/video/BV1vf42127tH/ AtCoder Beginner Contest 353 实况(A~E) https://www.bilibili.com/video/BV1Gs421N748/ https://www.bilibili.com/video/BV19E42137MQ/ AtCoder Beginner Cont...
AtCoder Beginner Contest 169(题解)E - Count Median结论题给定nnn个xi∈[ai,bi]x_i\in[a_i,b_i]xi∈[ai,bi],求中位数的个数。定义:k=⌊n2⌋k=\lfloor\dfrac{n}{2}\rfloork=⌊2n⌋,对a,ba,ba,b进行排序后,为ak+1a_{k+1}ak+1为aia_iai的中位数,bk+1...