C:https://www.zhixincode.com/contest/6/problem/C?problem_id=73
中文题,题目也简单,稍微想一下就知道,从小到大排序之后,就不用考虑前面的了,只用一直加大的就行了。
AC:
ll arr[MAXN];
int main(){
int n,m;
while(cin>>n>>m){
for(int i=1;i<=n;++i){
cin>>arr[i];
}
sort(arr+1,arr+1+n);
int ans=n;
for(int i=1;i<n;++i){
if(arr[i+1]-arr[i]<=m){
ans--;
}
}
cout<<ans<<endl;
}
}
E:https://www.zhixincode.com/contest/6/problem/E?problem_id=76给你两条直线,n个圆,问从一条直线到另一条直线的最短距离,可以把线看成点,然后圆看成点,链接所有的路,最后构成最短路,然后跑一遍Dijkstra就行了
AC:
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<math.h>
//#include<map>
#include<set>
#include<deque>
#include<queue>
#include<stack>
#include<bitset>
#include<string>
#include<fstream>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
#define Pair pair<int,double>
//#define max(a,b) (a)>(b)?(a):(b)
//#define min(a,b) (a)<(b)?(a):(b)
#define clean(a,b) memset(a,b,sizeof(a))// 水印
//std::ios::sync_with_stdio(false);
// register
const int MAXN=1e3+10;
const int INF32=0x3f3f3f3f;
const ll INF64=0x3f3f3f3f3f3f3f3f;
const int mod=998244353;
const double PI=acos(-1.0);
struct node{
double x,y,r;
}dots[MAXN];
double mp[MAXN][MAXN];
double dis[MAXN],vis[MAXN];
int n;
double A,B,C1,C2;
struct cmp{
bool operator()(const Pair &a,const Pair &b){
return a.second>b.second;
}
};
void Dijkstr(){
priority_queue<Pair,vector<Pair >,cmp> que;
while(que.size()) que.pop();
for(int i=0;i<=n+1;++i){
dis[i]=999999999;
}
clean(vis,0);
dis[0]=0;
que.push({0,0});
while(que.size()){
Pair pir=que.top();
que.pop();
vis[pir.first]=1;
for(int i=0;i<=n+1;++i){
if(vis[i]==0&&dis[i]>dis[pir.first]+mp[pir.first][i]){
dis[i]=dis[pir.first]+mp[pir.first][i];
que.push({i,dis[i]});
}
}
}
cout<<dis[n+1]<<endl;
}
int main(){
while(cin>>n>>A>>B>>C1>>C2){
for(int i=0;i<=n+1;++i){
for(int j=0;j<=n+1;++j){
mp[i][j]=999999999;
}
}
mp[0][n+1]=mp[n+1][0]=fabs(C1-C2)/sqrt(A*A+B*B);
double x,y,r;
for(int i=1;i<=n;++i){
cin>>x>>y>>r;
dots[i]={x,y,r};
double res=fabs(A*x+B*y+C1)/sqrt(A*A+B*B)-r;
mp[0][i]=mp[i][0]=res>0?res:0;
res=fabs(A*x+B*y+C2)/sqrt(A*A+B*B)-r;
mp[i][n+1]=mp[n+1][0]=res>0?res:0;
}
for(int i=1;i<=n;++i){
for(int j=i+1;j<=n;++j){
double res=(sqrt((dots[i].x-dots[j].x)*(dots[i].x-dots[j].x)
+(dots[i].y-dots[j].y)*(dots[i].y-dots[j].y))
-dots[i].r-dots[j].r);
mp[i][j]=mp[j][i]=res>0?res:0;
}
}
Dijkstr();
}
}
H:https://www.zhixincode.com/contest/6/problem/H?problem_id=83
水题,石头剪刀布,然后相克的比较一下就行了。
AC:
int main(){
ll a,b,c,d,e,f;
while(cin>>a>>b>>c>>d>>e>>f){
ll ans=min(a,e)+min(b,f)+min(c,d);
cout<<ans<<endl;
}
}
K:https://www.zhixincode.com/contest/6/problem/K?problem_id=89
简单看一下题,括号匹配,对于一组数据,维护一个栈,对于匹配成功的一组,消去该组括号,然后该点的位置的元素=前一点的元素,这样就能避免重复了,最后每次比较的时候比较arr[l-1]和arr[r]即可。
AC:
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<math.h>
//#include<map>
#include<set>
#include<deque>
#include<queue>
#include<stack>
#include<bitset>
#include<string>
#include<fstream>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
#define Pair pair<int,int>
//#define max(a,b) (a)>(b)?(a):(b)
//#define min(a,b) (a)<(b)?(a):(b)
#define clean(a,b) memset(a,b,sizeof(a))// 水印
//std::ios::sync_with_stdio(false);
// register
const int MAXN=1e6+10;
const int INF32=0x3f3f3f3f;
const ll INF64=0x3f3f3f3f3f3f3f3f;
const int mod=998244353;
const double PI=acos(-1.0);
int arr[MAXN];
int main(){
int n,m,q;
while(cin>>n>>m>>q){
clean(arr,0);
stack<Pair> st;
while(st.size())
st.pop();
st.push({0,-2});
int x;
for(int i=1;i<=n;++i){
cin>>x;
if(st.top().second/2==x/2&&st.top().second%2==0&&x%2){
st.pop();
arr[i]=st.top().first;
//cout<<i<<": "<<arr[i]<<endl;
}
else{
st.push({i,x});
arr[i]=i;
}
}
// for(int i=1;i<=n;++i){
// cout<<arr[i]<<" ";
// }
int l,r;
while(q--){
cin>>l>>r;
if(arr[l-1]==arr[r])
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
}
}