Soon, the Open Olympiad in Informatics will take place, which you may know from theonline mirror of last yearor from the rounds345,469,545,626,707,775. This olympiad is prepared by Moscow Olympiad Scientific Co
Accept Code: #include<bits/stdc++.h>usingnamespacestd;constintmaxn=4e4+10;typedeflonglongll;inta[maxn],b[maxn],n,m,k;intsolve(intx){intcnt1=0,cnt2=0,cnt=0,y=k/x,res=0;for(inti=1;i<=n;i++){if(a[i])cnt1++;elsecnt1=0;if(cnt1>=x)cnt++; }for(inti=1;i<=m;i+...
A 出题人,你【】。 我们需要一个动态空间。你用一个 vector 来存这个矩阵,一开始的时候 resize 一下就好了。 然后考虑做题,曼哈顿距离想到把横竖分开来算距离。对于每个颜色开一个桶,然后对每个颜色的横纵坐标记录下来,从小到大遍历这个坐标,然后可以线性求出当前答案
Right now happens the first tour of the Open Olympiad in Informatics, and tomorrow will be the second one. This contest is prepared by Moscow Olympiad Scientific Committee that you may know by Moscow Team Olympiad, Moscow Olympiad for Young Students and Metropolises Olympiad (rounds327,342,345,...
CF1648A. Weird Sum曼哈顿距离x和y相独立可以分开做,每一维排个序求一下贡献很显然 CF1648B. Integral Array对于每一个数不同的数x,显然 \lfloor \frac{a[i]}{x}\rfloor 最多只有 \lfloor \frac{C}{x}\rfloor 个…
Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)(A-C),题意:根据第一段,只是让你找到任意一组元素,和为偶数即可。还可以根据OUTPUT最后一句,多种答案,输出任意一种。解析:随便找嘛,所以如果碰到单个偶数,直接输出,否则找出任意两
Codeforces Round #707 (Div. 2, based on Moscow Open Olympiad in Informatics) Problem 1501A. Alexey and Train 按题意,比较到站的最大值. using ll = long long; int a[105], b[105], c[105]; int main() { // ios_base::sync_with_stdio(false), cin.tie(0); ...
International Olympiad in Informatics (IOI) 问题陈述数据集 (IOI’2020 - IOI’2024): open-r1/ioi 测试用例: open-r1/ioi-test-cases 官方(基本真值)解决方案: open-r1/ioi-sample-solutions DeepSeek-R1 cots 数据集 (IOI’2020-IOI’2023): open-r1/ioi-cots IOI’2024 上 40 多个领先模型的评估数据...
Iran grabbed one gold medal and three silver medals at the 35th International Olympiad in Informatics, ranking seventh in the world among 91 countries. The IOI 2023 was held in Szeged, Hungary, from August 28th to September 4th. The International Olympiad in Informatics is an annual international...
对于算法类程序设计竞赛,被全世界广泛公认的有3项大赛,分别是于1989年创办,代表了高中生学科竞赛最高荣誉的IOI(International Olympiad in Informatics,国际信息学奥林匹克竞赛);由美国Topcoder公司从2001年开始举办,在个人程序设计竞赛中最具权威的Topcoder Algorithm比赛(TCO是这项系列赛的年度总决赛);以及于1970年创...