这场比赛只过了两题,有很多题都有思路,但又一直被卡,菜是原罪吧,直接补题。
C题
题意是给无向的图,求每个点有多少个相邻点,找出相邻点个数递增的最长序列。用vector数组存一下就行。
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define maxn 1000010
ll num[maxn];
vector<ll>flag[maxn];
typedef struct st{
int member;
ll countt;
}stdy;
ll endd[maxn];
stdy maze[maxn];
bool cmp(stdy u,stdy v)
{
return u.countt<v.countt;
}
int main()
{
int n,m;
ll x,y;
scanf("%d %d",&n,&m);
memset(num,0,sizeof(num));
memset(maze,0,sizeof(maze));
for(int i=0;i<m;i++){
scanf("%lld %lld",&x,&y);
maze[x].member=x;
maze[y].member=y;
maze[x].countt++;
maze[y].countt++;
flag[x].push_back(y);
flag[y].push_back(x);
num[x]++;
num[y]++;
}
sort(maze,maze+n,cmp);
memset(endd,0,sizeof(endd));
for(int i=0;i<n;i++)
{
ll indx=maze[i].member;
int l=flag[indx].size();
for(int j=0;j<l;j++)
{
if(num[indx]<num[flag[indx][j]])
endd[flag[indx][j]]=max(endd[flag[indx][j]],endd[indx]+1);
}
}
ll maxx=0;
for(int i=0;i<n;i++)
maxx=max(maxx,endd[i]);
printf("%lld\n",maxx+1);
return 0;
}
H题
石头剪刀布,
一道纯模拟的题,把第二行出的改成能赢的,然后直接遍历找相同的就可以,在最后一段长度小于第二行时要特判。
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<vector>
using namespace std;
#define ll long long
const int mod=998244353;
/*ll qpow(ll a,ll b){
ll ans=1;
while(b){
if(b&1){
ans=ans*a;
}
a=a*a;
b>>=1;
}
return ans;
}*/
/*const char *a[]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};
struct s{
string sfz;
int sj,ks;
};*/
//int cmp(s a,s b){
// return a.pj>b.pj;
//}
/*ll gcd(ll a,ll b) // 求最大公因数
{
return b==0?a:gcd(b,a%b);
}
ll lcm(ll a,ll b)
{
ll k;
k=a*b/(gcd(a,b));
return k;
}*/
int main(){
int a,b;
cin>>a>>b;
string s1,s2;
cin>>s1;
cin>>s2;
for(int i=0;i<b;i++){
if(s2[i]=='R') s2[i]='S';
else if(s2[i]=='S')s2[i]='P';
else s2[i]='R';
}
int ans=0,maxx=0;
for(int i=0;i<a-b;i++){
ans=0;
for(int j=0;j<b;j++){
if(s1[i+j]==s2[j]) ans++;
}
maxx=max(ans,maxx);}
for(int i=a-b;i<a;i++){
ans=0;
for(int j=0;j<a-i;j++){
if(s1[i+j]==s2[j]) ans++;
}
maxx=max(ans,maxx);
}
cout<<maxx;
}
F题
希尔伯特曲线,当时以为可以推个简单点的公式出来疯狂打表,但是没有如愿。后来感觉太复杂就放弃了这题,补题发现规律还是好找的,下次要耐心啊
#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
ll x,y;
void rec(ll lev,ll num);
int main(){
ll lev,num;
while(cin>>lev>>num){
num--;
rec(lev,num);
printf("%lld %lld\n",x+1,y+1);
}
return 0;
}
void rec(ll lev,ll num){
if(lev==2){
if(num==0){
x=0,y=0;
}
else if(num==1){
x=0,y=1;
}
else if(num==2){
x=1,y=1;
}
else{
x=1,y=0;
}
return ;
}
ll mins=lev/2*lev/2;
ll k=num/mins;
rec(lev/2,num%mins);
ll h=num%mins;
if(k==0){
swap(x,y);
}
else if(k==1){
y+=lev/2;
}
else if(k==2){
x+=lev/2;
y+=lev/2;
}
else{
ll xx=x;
ll yy=y;
x=lev/2-1-yy;
y=lev/2-1-xx;
x+=lev/2;
}
}