Codeforces Round #799 (Div. 4) （AK代码）
2024-05-18 17:27:08
可惜可惜，差一点AK
A
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;typedef pair<int,int>pii;
typedef pair<long,long> lpii;
typedef double db;
typedef vector<int> VI;
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define linf 9e18
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}int t;
int a,b,c,d;
int cnt;
int main(){scanf("%d",&t);while(t--){scanf("%d %d %d %d",&a,&b,&c,&d);cnt=0;if(b>a) cnt++;if(c>a) cnt++;if(d>a) cnt++;printf("%d\n",cnt);}return 0;
}B
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;typedef pair<int,int>pii;
typedef pair<long,long> lpii;
typedef double db;
typedef vector<int> VI;
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define linf 9e18
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
const int N=55;int t;
int n,a[N];
void work(){int ans=n;int t=0;map<int,int>mp;rep(i,1,n) mp[a[i]]++;for(auto &p:mp){ans-=(p.se-1);if(!((p.se)&1)) t++; }if(t&1) ans--;printf("%d\n",ans);
}
int main(){scanf("%d",&t);while(t--){scanf("%d",&n);rep(i,1,n) scanf("%d",&a[i]);work();}return 0;
}C
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;typedef pair<int,int>pii;
typedef pair<long,long> lpii;
typedef double db;
typedef vector<int> VI;
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define linf 9e18
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
const int N=10;int t;
char mp[N][N];void work(){int r,c;bool ok=false;rep(i,1,8){rep(j,1,8){if(i!=1 && i!=8 && j!=1 && j!=8 && mp[i][j]=='#'){if(mp[i-1][j-1]=='#' && mp[i-1][j+1]=='#' && mp[i+1][j-1]=='#' && mp[i+1][j+1]=='#'){r=i;c=j;ok=true;}}if(ok) break;}if(ok) break;}printf("%d %d \n",r,c);
}
int main(){scanf("%d",&t);while(t--){rep(i,1,8) rep(j,1,8) cin>>mp[i][j];work();}return 0;
}D
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;typedef pair<int,int>pii;
typedef pair<long,long> lpii;
typedef double db;
typedef vector<int> VI;
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define linf 9e18
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}const int mod=1440;
int t;
string s;
int x;bool judge(string str){int n=SZ(str);rep(i,0,n/2-1){if(str[i]!=str[n-1-i]) return false;}return true;
}
void work(){unordered_set<int>st;int ans=0;int h=stoi(s.substr(0,2));int m=stoi(s.substr(3,2));int now=h*60+m;while(true){if(st.count(now)) break;st.insert(now);now=(now+x)%mod;}for(auto n:st){int hh=n/60,mm=n%60;string a="",b="";if(hh<=9) a='0'+to_string(hh);else a=to_string(hh);if(mm<=9) b='0'+to_string(mm);else b=to_string(mm);string ss=a+':'+b;if(judge(ss)) ans++;}cout<<ans<<endl;
}
int main(){ios_base::sync_with_stdio(false);cin.tie(0);cin>>t;while(t--){cin>>s>>x;work();}return 0;
}E
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;typedef pair<int,int>pii;
typedef pair<long,long> lpii;
typedef double db;
typedef vector<int> VI;
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define linf 9e18
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
const int N=2e5+10;int t;
int n,s;
int a[N];void work(){int sum=0;int ans=inf;rep(i,1,n) sum+=a[i];if(sum<s){cout<<-1<<endl;return;}if(sum==s){cout<<0<<endl;return;}int L[N],R[N],tmp=0;memset(L,0,sizeof L);memset(R,0,sizeof R);rep(i,1,n){if(a[i]==1){tmp++;L[tmp]=i;}}tmp=0;per(i,n,1){if(a[i]==1){tmp++;R[tmp]=n-i+1;}}rep(i,0,sum-s) ans=min(ans,L[i]+R[sum-s-i]);cout<<ans<<endl;
}
int main(){ios_base::sync_with_stdio(false);cin.tie(0);cin>>t;while(t--){cin>>n>>s;rep(i,1,n) cin>>a[i];work();}return 0;
}F
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;typedef pair<int,int>pii;
typedef pair<long,long> lpii;
typedef double db;
typedef vector<int> VI;
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define linf 9e18
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
const int N=2e5+10;int t;
int n;
int a[N];
struct node{int i,j,k;node(int i,int j,int k){this->i=i;this->j=j;this->k=k;}
};
void work(){bool ok=false;map<int,int>mp;rep(i,1,n) a[i]%=10,mp[a[i]]++;vector<node>b;rep(i,0,9){rep(j,0,9){rep(k,0,9){if((i+j+k)%10==3) b.pb(node(i,j,k));}}}for(auto p:b){if(mp[p.i]!=0) mp[p.i]--;else continue;if(mp[p.j]!=0) mp[p.j]--;else{mp[p.i]++;continue;}if(mp[p.k]!=0) mp[p.k]--;else{mp[p.i]++;mp[p.j]++;continue;}ok=true;break;}cout<<(ok?"YES":"NO")<<endl;
}
int main(){ios_base::sync_with_stdio(false);cin.tie(0);cin>>t;while(t--){cin>>n;rep(i,1,n) cin>>a[i];work();}return 0;
}G
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;typedef pair<int,int>pii;
typedef pair<long,long> lpii;
typedef double db;
typedef vector<int> VI;
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define linf 9e18
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
const int N=2e5+10;int t;
int n,k;
ll a[N];void work(){vector<pii> v;int ans=0;bool f=1;int L,R;rep(i,1,n-1){//leftif(a[i]<a[i+1]*2){if(f){L=i;f=0;} }else{R=i;if(!f) v.pb({L,R});f=1;}}if(!f) v.pb({L,n}); for(auto p:v) ans+=max(0,p.se-p.fi+1-k);cout<<ans<<endl;
}
int main(){ios_base::sync_with_stdio(false);cin.tie(0);cin>>t;while(t--){cin>>n>>k;rep(i,1,n) cin>>a[i];work();}return 0;
}H
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;typedef pair<int,int>pii;
typedef pair<long,long> lpii;
typedef double db;
typedef vector<int> VI;
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define linf 9e18
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
const int N=2e5+10;int t;
int n,a[N];//a,l,r
//range max
pair<pair<int,int>,pair<int,int> > deal(vector<int> v){int b,l,r;int idx;int val=0;int n=v.size();vector<int>tmp(n,0);tmp[0]=1;for(int i=1;i<n;i++){tmp[i]=max(1,tmp[i-1]+1-(v[i]-v[i-1]-1));}for(int i=0;i<n;i++){if(tmp[i]>=val){val=tmp[i];idx=i;}}b=a[v[idx]];r=v[idx];while(idx>=0 && tmp[idx]>1) idx--;l=v[idx];return pair<pair<int,int>,pair<int,int> >({{val,b},{l,r}});
}
void work(){int b,l,r;int maxv=0;map<int,vector<int>>mp;rep(i,1,n) mp[a[i]].pb(i);for(auto &p:mp){pair<pair<int,int>,pair<int,int> >tmp=deal(p.se);if(tmp.fi.fi>maxv){maxv=tmp.fi.fi;b=tmp.fi.se;l=tmp.se.fi;r=tmp.se.se;}}cout<<b<<' '<<l<<' '<<r<<endl;
}
int main(){ios_base::sync_with_stdio(false);cin.tie(0);cin>>t;while(t--){cin>>n;rep(i,1,n) cin>>a[i];work();}return 0;
}Codeforces Round #799 (Div. 4) （AK代码）相关推荐
- Codeforces Round #723 Div. 2个人代码
Codeforces Round #723 Div. 2个人代码 写出来四题,开心QWQ A. Mean Inequality 题意:给一个数n,然后给2*n个数,让我们构造一个数列满足数列中任意一项 ...
- Codeforces 1660 Codeforces Round #780 (Div. 3)-AK题解
题目链接 A 题意 你现在有a个一元硬币和b个两元硬币,问你最小不能拼凑出来的钱数是多少? 思路 如果没有一元硬币,那么答案就是1 否则答案就是a+b∗2+1a+b*2+1a+b∗2+1. AC代码 ...
- 【CF补题】【ABC】Codeforces Round #777 (Div. 2) C++代码
A. Madoka and Math Dad [题意]求连续不带零且不相等位数的最大十进制数,使其位数之和为 n.有t个测试n [思考]根据样例我们就可以推测答案是121212...或212121. ...
- Codeforces Round #739 (Div. 3)（AK实况）
Codeforces Round #739 (Div. 3) A. Dislike of Threes 找到第kkk个既不是333的倍数,个位数上也不是333的数,也已预处理然后O(1)O(1)O(1 ...
- Codeforces Round #694 (Div. 1 + Div2)（A ~ H，8题全，超高质量题解）【每日亿题】2021/2/1、2/2
整理的算法模板合集: ACM模板 点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 目录 [每日亿题]Codeforces Round #694 (Div. 1 + Div2)(A ~ ...
- Codeforces Round #533 (Div. 2)题解
link orz olinr AK Codeforces Round #533 (Div. 2) 中文水平和英文水平都太渣..翻译不准确见谅 T1.给定n<=1000个整数,你需要钦定一个值t, ...
- # Codeforces Round #548 (Div. 2)C Edgy Trees
Codeforces Round #548 (Div. 2)C Edgy Trees 题目传送门 You are given a tree (a connected undirected graph ...
- Codeforces Round #777 (Div. 2） 简训
Codeforces Round #777 (Div. 2) 简训 导语 涉及的知识点 题目 A Madoka and Math Dad B Madoka and the Elegant Gift C ...
- Codeforces Round #686 (Div. 3) A-F题解
Codeforces Round #686 (Div. 3) A-F题解 A. Special Permutation 题意 给定 nnn ,输出一个长度为 nnn 的全排列,每个位置 iii 上的数 ...
- Codeforces Round #706 (Div. 2)-A. Split it!-题解
目录 Codeforces Round #706 (Div. 2)-A. Split it! Problem Description Input Output Sample Input Sample ...
最新文章
- 以下不是python文件读写方法的是-使用Python进行二进制文件读写的简单方法(推荐)...
- AIX系统文件安全性方面的几点考虑
- how to find your partner
- Xampp配置本地域名及常见错误解决
- ubuntu 14.10 64bit系统安装MBuntu主题(仿Mac主题)
- idea创建gredle项目jar包无法导入
- android原生桌面,谷歌官方出品的安卓原生桌面App 轻松干掉你手机上臃肿的的桌面！...
- 谈谈QQ 4.6版本的语音通话功能
- 【装机心得】win8或以上系统的电脑降级安装win7时的正确操作手册
- 分析mrp主要应用范围_MRP适用于相关需求的计划与控制
- 吐槽、吐槽、吐槽！！！！！！
- geany java编译器乱码_Ubuntu Geany打开文件乱码的解决方法
- principal java_CAS 单点登录服务端 如何获取到principal
- 抽油烟机CCC认证介绍以及CCC认证申请
- Tomcat7源码解析
- 日常所需 - 收藏集 - 掘金
- 实验七 Oracle数据库安全管理
- Idea 中解决git冲突
- SUMO获得车辆信息
- 自己觉得喜欢的2个项目，慢慢进步吧，呵呵