![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
AT
文章平均质量分 57
木落淮南,雨晴雲夢
这个作者很懒,什么都没留下…
展开
-
AtCoder Beginner Contest 225 E - 7
E - 7思路:按照(xi,yi−1)(x_i,y_i-1)(xi,yi−1)与(0,0)(0,0)(0,0)的斜率排序,贪心的选择斜率与当前斜率更靠前的即可,去除非法的情况就是最大的。非法的情况就是,(xi,yi−1)(x_i,y_i-1)(xi,yi−1)在y=kxy=kxy=kx(当前选择的斜率)上方#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>原创 2021-10-30 23:32:17 · 143 阅读 · 0 评论 -
AtCoder Beginner Contest 192 A--E
题目入口A - Star#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long//#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e9+7;const int M=2e3+5;const int N=1e6+原创 2021-02-20 21:55:02 · 287 阅读 · 0 评论 -
AtCoder Beginner Contest 191.E - Come Back Quickly
E - Come Back QuicklyTime Limit: 3 sec / Memory Limit: 1024 MBProblem Statementln the Republic of AtCoder, there are N towns numbered 1 through N and M roads numbered 1 through M.Road is a one-way roadfrom Town A; to Town B, and it takes Cyminutes to g原创 2021-02-06 21:57:53 · 305 阅读 · 0 评论 -
AtCoder Beginner Contest 213E - Stronger Takahashi
E - Stronger Takahashi 用dfs遍历同一个联通块中内容,并存入vector,然后利用bfs求不同联通快中的关系,好题!!!#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double lon原创 2021-08-08 23:14:03 · 92 阅读 · 0 评论 -
AtCoder Beginner Contest 209
AtCoder Beginner Contest 209A - Counting#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff//#define ll long long#define int long long//#define double long double#define re int#defin原创 2021-07-10 22:50:30 · 159 阅读 · 0 评论 -
AtCoder Beginner Contest 203(Sponsored by Panasonic)
AtCoder Beginner Contest 203(Sponsored by Panasonic)A - Chinchirorin#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff//#define ll long long#define int long long//#define double long原创 2021-05-30 22:25:58 · 217 阅读 · 0 评论 -
NOMURA Programming Contest 2021(AtCoder Regular Contest 121)
NOMURA Programming Contest 2021(AtCoder Regular Contest 121)太可惜了573RMB没了A 2nd Greatest Distance细节有点多,要小心#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff//#define ll long long#defin原创 2021-05-29 22:49:16 · 143 阅读 · 0 评论 -
AISing Programming Contest 2021(AtCoder Beginner Contest 202)ABCDE
AISing Programming Contest 2021(AtCoder Beginner Contest 202)A Three Dice#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff//#define ll long long//#define int long long//#define doub.原创 2021-05-23 22:17:27 · 163 阅读 · 0 评论 -
AtCoder Regular Contest 120
AtCoder Regular Contest 120本来今天上午打了上海的往届题目的练习赛,已经超级累了,但是还是没忍住,又开了一场。。。。。只做了两个。。A Max Add问:一个序列长度为n的数列a,有一个数k,k代表长度为1到n的连续子序列b,打印n次答案。对于长度为k的子序列b执行k次下述操作,i从1到k,每个b[i]加上当前序列最大数,最后输出该序列的和。通过观察得到题目的答案等于目前数量的最大数量与目前序列的长度的乘积加上前缀和的前缀和。#pragma GCC optimize原创 2021-05-23 21:54:36 · 235 阅读 · 0 评论 -
Mynavi Programming Contest 2021(AtCoder Beginner Contest 201)ABCDE
Mynavi Programming Contest 2021(AtCoder Beginner Contest 201)A - Tiny Arithmetic Sequence#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long//#define llu unsigned l原创 2021-05-15 22:34:01 · 377 阅读 · 0 评论 -
ZONe Energy Programming Contest
ZONe Energy Programming ContestA UFO Invasion#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double//#define double转载 2021-05-01 22:43:35 · 108 阅读 · 0 评论 -
ZONe Energy Programming Contest
ZONe Energy Programming ContestA UFO Invasion#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double//#define double原创 2021-05-01 22:42:48 · 73 阅读 · 0 评论 -
AtCoder Beginner Contest 199(Sponsored by Panasonic)A--E
AtCoder Beginner Contest 199(Sponsored by Panasonic)A Square Inequality#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double lon原创 2021-04-24 22:02:25 · 213 阅读 · 1 评论 -
Japanese Student Championship 2021 A--D
Japanese Student Championship 2021A Competition#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long//#define int long long//#define double long double#define re re转载 2021-04-17 17:21:02 · 1093 阅读 · 0 评论 -
AtCoder Beginner Contest 198
AtCoder Beginner Contest 198A Div#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define eps 1e-8//#define mo原创 2021-04-11 21:46:38 · 100 阅读 · 0 评论 -
AtCoder Beginner Contest 197(Sponsored by Panasonic)
链接A Rotate#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long//#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7#define ls(p)原创 2021-03-27 22:47:26 · 166 阅读 · 2 评论 -
AtCoder Regular Contest 114 A - Not coprime
昨晚居然把AT的事忘了,结果直接掉分,现在只能慢慢补了链接这道题,比较坑,贪心这些很难操作比如说这样一组数据510 15 25 35 40用贪心每次求最小的约数就可能得到10,但是结果应该是5于是我琢磨了以下,50以内的质数只有15个,所以可以用状压#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#de原创 2021-03-15 18:11:10 · 417 阅读 · 0 评论 -
Panasonic Programming Contest (AtCoder Beginner Contest 195) A--C
只AC了三个???是的,只AC了三个,因为今天实在是太疲惫了,上午打蓝桥,中午做科创,下午打CF,晚上打AT,再加上最近没休息好,打到最后我连读题的力气都没有了连接A - Health M Death#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int原创 2021-03-13 22:22:48 · 189 阅读 · 0 评论 -
AtCoder Beginner Contest 194 C - Squared Error
传送门看到别人的都是前缀和,我就来发一个不太主流的题解吧观察发现,A的取值在[-200,200],这个区间不算大,因此就可以记录每一个值的个数,再通过排列组合的方式求解,通过i和j的值是否相等进行判断,然后求解#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define原创 2021-03-07 08:59:56 · 247 阅读 · 0 评论 -
Caddi Programming Contest 2021(AtCoder Beginner Contest 193) A--D
传送门A - Discount#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7``using nam原创 2021-02-27 21:47:06 · 212 阅读 · 1 评论 -
AtCoder Regular Contest 113 A--D
题目入口A - ABC(枚举)#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e9+7;const int M=2e3+5;const int N=2*1原创 2021-02-21 22:33:40 · 275 阅读 · 1 评论