codeforces
文章平均质量分 63
yezzz.
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #796 (Div. 2)
div2原创 2022-07-03 10:26:19 · 134 阅读 · 0 评论 -
Educational Codeforces Round 126 (Rated for Div. 2)
Educational Codeforces Round 126 (Rated for Div. 2)A - Array Balancing从后往前 直接反转即可,无后效性#include <bits/stdc++.h>#define int long long #define Pa pair<int,int> #define yes cout<<"YES\n";#define no cout<<"NO\n";using namespace原创 2022-04-11 12:20:19 · 492 阅读 · 2 评论 -
CodeTON Round 1 (Div. 1 + Div. 2)
CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!)A - Good Pairs签到~#include <bits/stdc++.h>#define int long long #define Pa pair<int,int> using namespace std;const int N=1e5+5;struct node { int x,id; bool operator < (const原创 2022-03-27 16:42:48 · 716 阅读 · 0 评论 -
Educational Codeforces Round 125 (Rated for Div. 2)
Educational Codeforces Round 125 (Rated for Div. 2)A - Integer Moves签到#include <bits/stdc++.h>#define int long long #define Pa pair<int,int> using namespace std;const int N=1e5+5;void solve(){ int x,y; cin>>x>>y原创 2022-03-23 21:20:36 · 698 阅读 · 0 评论 -
Codeforces Round #775 (Div. 2)
Codeforces Round #775 (Div. 2)A - Game签到题~#include <bits/stdc++.h>#define int long longusing namespace std;const int N=1e3+5;int a[N];void solve(){ int n,m; cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; int l=1,原创 2022-03-13 14:46:22 · 552 阅读 · 0 评论 -
Educational Codeforces Round 124 (Rated for Div. 2)
Educational Codeforces Round 124 (Rated for Div. 2)A - Playoff签到~#include <bits/stdc++.h>#define int long long using namespace std;const int N=1e5+5;void solve(){ int n; cin>>n; int ans=1; for(int i=1;i<=n;i++) an原创 2022-03-11 12:12:43 · 435 阅读 · 4 评论 -
CF770 E - Fair Share(神仙构造)
E - Fair Share分析:思维+欧拉回路首先考虑不成立的情况,当存在某一数只出现奇数次,则不成立对于每个序列都要 L R 二分,奇数号点向偶数号点建边,黑白染色后相邻两点被分别分到LR,这样以来每个序列都是LR二分的然后就是关键,最后要使LR是相同的,对于相同的数字,每两个每两个的建边最后再跑染色,是完全可以构造出来的#include <bits/stdc++.h>#define int long long using namespace std;原创 2022-02-26 13:39:04 · 281 阅读 · 0 评论 -
CF772 E - Cars(二分图染色,拓扑排序)
E - Cars分析:二分图染色,拓扑排序分两类情况:相遇:只能相向而行(xr<xlx_r<x_lxr<xl)相离:只能背向而行(xr>xlx_r>x_lxr>xl)因此,不管是什么情况,相邻两点方向不同,先跑一遍二分图染色,不成立,则 “NO”染完色之后,令 1向R走,0向L走,建有向图相遇:xr<xlx_r<x_lxr<xl ,建 1 到 0 的边相离:xr>xlx_r>x_lxr>xl原创 2022-02-25 16:46:21 · 486 阅读 · 0 评论 -
CF773 E - Anonymity Is Important(stl迭代器的各种用法)
E - Anonymity Is Important分析:区间覆盖,set去重,剔除无效信息输出有三种情况:NO:最好处理,在之前被删除过YES:对于当前x,它前面一个,后面一个不与它共有一个有效区间,也就是说x本身有一个有效区间(有效区间是指可能有病人的区间)N/A:即其它情况,与其它(前或后)有重合区间剔除无效信息:对于每一个点,至多两个区间对其有效,一个左一点,一个右一点#include <bits/stdc++.h>#define int long原创 2022-02-25 14:59:40 · 564 阅读 · 0 评论 -
Codeforces Round #773 (Div. 2)
Codeforces Round #773 (Div. 2)A - Hard Way签到题,当某两个点连线与x轴平行,且第三个点在这条连线之下,才做考虑#include <bits/stdc++.h>#define int long long using namespace std;const int N=1e5+5;void solve(){ int a,b,c,d,e,f; cin>>a>>b>>c>>d原创 2022-02-24 10:26:35 · 451 阅读 · 0 评论 -
Educational Codeforces Round 123 (Rated for Div. 2)
Educational Codeforces Round 123 (Rated for Div. 2)A - Doors and Keys#include <bits/stdc++.h>#define int long long using namespace std;const int N=1e5+5;void solve(){ string s; cin>>s; int a=0,b=0,c=0,fg=0; for(int i原创 2022-02-23 16:50:06 · 194 阅读 · 0 评论 -
Codeforces Round #772 (Div. 2)
Codeforces Round #772 (Div. 2)A - Min Or Sum签到题#include <bits/stdc++.h>#define int long long using namespace std;const int N=1e5+5;int a[N];void solve(){ int n; cin>>n; int s=0; for(int i=1;i<=n;i++) cin>>a[原创 2022-02-22 19:11:17 · 271 阅读 · 0 评论 -
Codeforces Round #761 (Div. 2)
Codeforces Round #761 (Div. 2)A - Forbidden Subsequence分析:只有当 T=“abc”,且主串排完序后,有"abc"在子序列的时候,需要将 bc 换一下位置#include <bits/stdc++.h>using namespace std;const int N=1e6+5;char s[N];int vis[55];signed main(){ int T; cin>>T; w原创 2021-12-16 23:46:03 · 439 阅读 · 0 评论 -
Codeforces Round #757 (Div. 2)
Codeforces Round #757 (Div. 2)A. Divan and a Store分析:贪心#include <bits/stdc++.h>#define int long long using namespace std;const int N=1e6+5;int a[N];void solve(){ int n,l,r,k; cin>>n>>l>>r>>k; for(int i原创 2021-11-26 22:27:50 · 530 阅读 · 0 评论 -
Codeforces Round #756 (Div. 3)
Codeforces Round #756 (Div. 3)A. Make Even分析:就 0,1,2,−10,1,2,-10,1,2,−1 四种情况#include<bits/stdc++.h>#define int long longusing namespace std;const int N=1e6+5;char s[N];signed main(){ int T; cin>>T; while(T--) {原创 2021-11-26 16:43:44 · 466 阅读 · 1 评论 -
Educational Codeforces Round 117 (Rated for Div. 2)
Educational Codeforces Round 117 (Rated for Div. 2)A. Distance构造#include <bits/stdc++.h>#define int long longusing namespace std;const int N=1e5+5;signed main(){ ios_base::sync_with_stdio(0); int T; cin>>T; while(T--)原创 2021-11-22 20:17:26 · 822 阅读 · 0 评论 -
Codeforces Round #753 (Div. 3)
Codeforces Round #753 (Div. 3)A. Linear Keyboard#include <bits/stdc++.h>#define int long long using namespace std;const int N=1e6+5;char s[N],sr[N];int a[N];signed main(){ int T; cin>>T; while(T--) { cin>>s+1>>sr+1;原创 2021-11-05 17:40:23 · 66 阅读 · 0 评论 -
Educational Codeforces Round 116 (Rated for Div. 2)
Educational Codeforces Round 116 (Rated for Div. 2)A - AB Balance分析:思维题,只有 ababab 两个字符,可以发现 ababab,bababa 的差值最大为 111并且,当开头和结尾为同一个字符时,差值必定为 000因此,只需判断一下开头结尾,修改一个字符即可#include <bits/stdc++.h>using namespace std; const int N=105;char s[N];原创 2021-11-01 14:54:38 · 55 阅读 · 0 评论 -
CF1593 E. Gardener and Tree (树上删叶子,BFS)
E. Gardener and Tree分析:在树上,从外层到里层逐层删叶子跑一遍 BFSBFSBFS 即可#include <bits/stdc++.h>using namespace std;const int N=1e6+5;vector <int> g[N];int du[N],dep[N];int sub;void bfs(int n,int k){ queue <int> q; for(int i=1;i<=n;i++原创 2021-10-22 10:43:19 · 193 阅读 · 0 评论 -
CF1593 D2. Half of Same(set,清空数组优化小技巧)
D2. Half of Same分析 (solution one):暴力枚举所有可能约数即可约数最大为 2e62e62e6,O(n∗2e6)O(n*2e6)O(n∗2e6),刚好卡过去由于是多组数据,要多次清空数组,这里有个优化的小技巧,详见代码#include <bits/stdc++.h>using namespace std;const int N=2e6+5;int a[105];int vis[N],cnt[N];signed main(){原创 2021-10-22 10:40:24 · 126 阅读 · 0 评论