codeforces
一只蓝色小鲨鱼
并不是我们主动选择辛苦和努力,而是别无选择!!!
一枚25考研,考公人。加油加油!!!
展开
-
D. Required Length
#include <bits/stdc++.h>#pragma GCC optimize(2)#define endl '\n' using namespace std; typedef long long ll;typedef pair<ll,int>PII; const int N=200010; int t,n,m;int a[N]; void solve(){ ll n,x; cin>>...原创 2022-05-24 15:44:24 · 519 阅读 · 0 评论 -
Educational Codeforces Round 129 (Rated for Div. 2) A. Game with Cards
题解:最大值哪边就哪边赢,如果一样就先出的赢,没什么好说的。#include <bits/stdc++.h>#pragma GCC optimize(2)#define endl '\n'using namespace std;typedef long long ll;typedef pair<int,int>PII;const int N=200010;int t,n,m;int a[N],b[N];void solve(){...原创 2022-05-24 10:58:05 · 85 阅读 · 0 评论 -
D - Circular Spanning Tree
Codeforces Round #793 (Div. 2) D(构造) - 知乎#include <bits/stdc++.h>#include <vector>using namespace std;typedef long long ll;typedef pair<int,int>PII;const int N=200010;int t,n,m;int a[...原创 2022-05-23 16:45:34 · 260 阅读 · 0 评论 -
C. LIS or Reverse LIS?
void solve(){ cin>>n; map<int,int>q; int cnt=0; for(int i=1;i<=n;i++) { int x; cin>>x; q[x]++; if(q[x]<=2)cnt++; } cout<<(cnt+1>>1)<<endl;}原创 2022-05-23 13:52:04 · 335 阅读 · 4 评论 -
B. AND Sorting
void solve(){ cin>>n; int res = (1 << 20) - 1; for(int i = 0; i < n; i++){ int x; cin >> x;//x<n; if (x != i) res &= i; } cout<<res<<endl;}原创 2022-05-23 13:49:36 · 261 阅读 · 0 评论 -
A. Palindromic Indices
void solve(){ cin>>n; string s; cin>>s; int tm=n/2,res=1; for(int i=tm+1;i<n;i++) { if(s[tm]!=s[i])break; else res++; } for(int i=tm-1;i>=0;i--) { if(s[tm]==s[i]) res++; else break; } cout<<res<&...原创 2022-05-23 13:46:34 · 181 阅读 · 0 评论 -
1669G - Fall Down
搜索每一个点;联系flood fill;#include <iostream>#include <algorithm>#include <cstring>using namespace std;const int N=55;int t,n,m;char g[N][N];void dfs(int x,int y){ if(x+1>n||g[x+1][y]=='o'||g[x+1][y]=='*') // 一般...原创 2022-05-21 13:51:57 · 232 阅读 · 0 评论 -
CF1672C Unequal Array
//寻找规律,如果只有一对输出0;// 如果只有三个挨着的输出1;// 超过两对的时候,只需要找出相等的对数,对应的下标,// 相减即可;因为>=两对的时候,两对中的数一定会被修改;#include <iostream>#include <algorithm>#include <cstring>using namespace std;const int N=200010;int n;int a[N];void so...原创 2022-05-20 14:54:27 · 90 阅读 · 0 评论 -
B. Z mod X = C
注意题中给出了a<b<c;#include <iostream>#include <algorithm>#include <cstring>using namespace std;const int N=10010;typedef long long LL;int main(){ int t; cin>>t; while(t--) { int a,b,c; cin>...原创 2022-05-20 10:56:13 · 184 阅读 · 0 评论 -
C. Dolce Vita(二分)
题意:给你一系列糖果,每个糖果有一个起始的价值 ai,我们每天都会获得x元,不可积累,每种糖果每天只能买一个,每天,所有糖果都会涨价+1元,问最多能买到多少糖果?分析:我们可以先排个序,因为贪心地想,肯定是先买最便宜的糖果更加省钱。然后如果我们买了第一个糖果 a1,那么达成什么条件才能买第二个呢,当然是所以第二个突破点,我们很自然的想到要用前缀和s[i]来判断最后,如何判断某种糖果可以买多少个呢?性质 : 前多少件物品价值不超过 m(给定的价值)//二分出前i件物品;...原创 2022-05-16 22:21:07 · 302 阅读 · 5 评论 -
【无标题】E. Eating Queries
1000测试数据;给定 n快糖果,每个糖果的价值是, 有 q次询问,每次询问给定义一个,问至少吃多少块糖果可以是总价值大于等于。贪心的想,每次从最大的开始吃.观察到 n,q<=1.5*1e5;排序后,考虑用前缀和维护数组,对于每次询问,二分找即可。复杂度核心代码超时了,为O(N) 于是考虑改为O(logN),前缀和加二分查询;sort(g,g+n); reverse(g,g+n); while(m--) { int x; cin...原创 2022-05-12 17:01:23 · 342 阅读 · 0 评论 -
Codeforces Round #790 (Div. 4)D. X-Sum
Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a gridaawithnnrows andmmcolumns with each cell having anon-negativeinteger written on it.Timur's challenge is to place a bishop on the board such that t...原创 2022-05-11 10:11:50 · 504 阅读 · 0 评论 -
Codeforces Round #790 (Div. 4)C. Most Similar Words
You are givennnwords ofequallengthmm, consisting of lowercase Latin alphabet letters. Theii-th word is denotedsisi.In one move you can chooseany position in any single wordand change the letter at that position to the previous or next l...原创 2022-05-11 09:26:48 · 572 阅读 · 0 评论 -
Codeforces Round #790 (Div. 4)B. Equal Candies
#include <iostream>#include <algorithm>#include <cstring> using namespace std; const int N=1010; int n,m;int f[N];int t;int g[N]; int main(){ int t; cin>>t; while(t--) { cin>>n; for(int i=1;i<=n;...原创 2022-05-11 09:23:37 · 163 阅读 · 0 评论 -
Codeforces Round #789 (Div. 2) B1. Tokitsukaze and Good 01-String (easy version)(greedy,思维)
题目链接:http://B2. Tokitsukaze and Good 01-String (hard version)因为要求 每一对的数相同,所以至少两个是相同就行,贪心,只要一对的两个相同就肯定满足;#include <iostream> //常用开头模板,保存在文档,下次直接用 #include <algorithm>#include <cstring>#include <queue>#defi...原创 2022-05-09 10:24:11 · 463 阅读 · 0 评论 -
Codeforces Round #789 (Div. 2) A :Tokitsukaze and All Zero Sequence (思维,unique)
https://codeforces.com/contest/1678/problem/AAC代码;#include <iostream> //常用开头模板,保存在文档,下次直接用 #include <algorithm>#include <cstring>#include <queue>#define sx first#define sy secondusing namespace std;type...原创 2022-05-09 10:07:44 · 369 阅读 · 0 评论 -
【无标题】CF1673C Palindrome Basis(完全背包dp,回文数,预处理)
题目链接:https://codeforces.com/problemset/problem/1673/C#include <iostream> //常用开头模板,保存在文档,下次直接用 #include <algorithm>#include <cstring>#define sx first#define sy secondusing namespace std;typedef long long LL;typedef...原创 2022-05-08 14:20:14 · 346 阅读 · 0 评论 -
CF144A Arrival of the General(思维)(存储)
::我竟然pair存值和下标 排序,二分找下标;计算,弄复杂了#include <iostream>}#include <algorithm>#include <cstring>using namespace std;const int N=110;int a[N];int maxs=0,mins=1e9;int main(){ int n; cin>>n; int x,y; for(int i=1;i&l..原创 2022-05-06 15:56:08 · 185 阅读 · 0 评论 -
CF148A Insomnia cure(思维)(阅读理解)
#include <iostream>#include <algorithm>#include <cstring>using namespace std;const int N=101000;int a[10];bool st[N];int main(){ int n=0; while(cin>>a[n])n++; int t=a[n-1]; int ans=0; for(int i=0;i<n-1;i++...原创 2022-05-05 22:35:20 · 212 阅读 · 0 评论 -
CF1660C Get an Even String
// 从前往后扫,用一个数组记录字母出现次数。// 如果当前字母出现两次,那么说明这个字母对可以 最快匹配,// cnt+=2;// 此时清空数组(其他字母肯定没有用了,否则不满足题目要求),// cout<<a.size()-cnt;#include <iostream>#include <cstring>using namespace std;int s[100];int main(){ int t; cin>>...原创 2022-05-04 15:38:42 · 221 阅读 · 0 评论 -
【无标题】CF1661B Getting Zero
//预处理dist[]存每个值到mod的最小步数;因为宽搜有最短性质;//倒着处理,#include <iostream>#include <algorithm>#include <cstring>using namespace std;const int N=33000,mod=32768;int n;long long dist[N];long long q[N];long long ans[N];void bfs()...原创 2022-05-04 14:56:34 · 393 阅读 · 1 评论