微网站设计与开发竞赛,帝国cms资源网模板,紫云网站建设,威海做网站推广的企业文章目录 L2-001 紧急救援L2-002 链表去重L2-004 这是二叉搜索树吗#xff1f;L2-005 集合相似度L2-006 树的遍历L2-007 家庭房产L2-010 排座位L2-011 玩转二叉树L2-012 关于堆的判断L2-013 红色警报L2-014 列车调度L2-016 愿天下有情人都是失散多年的兄妹L2-019 悄悄关注L2-0… 文章目录 L2-001 紧急救援L2-002 链表去重L2-004 这是二叉搜索树吗L2-005 集合相似度L2-006 树的遍历L2-007 家庭房产L2-010 排座位L2-011 玩转二叉树L2-012 关于堆的判断L2-013 红色警报L2-014 列车调度L2-016 愿天下有情人都是失散多年的兄妹L2-019 悄悄关注L2-020 功夫传人L2-025 分而治之L2-026 小字辈L2-029 特立独行的幸福L2-031 深入虎穴L2-035 完全二叉树的层序遍历L2-036 网红点打卡攻略L2-038 病毒溯源L2-039 清点代码库L2-040 哲哲打游戏L2-042 老板的作息表 L2-001 紧急救援
#includeiostream
#includecstring
using namespace std;const int MAX520;
int jiu[MAX],g[MAX][MAX];
int n,m,s,d;
//num为最短路径条数ans是最大救援队数量
int ds[MAX],num[MAX],ans[MAX];
bool vis[MAX];
int last[MAX];//每次找出最短路径如果不唯一更新num,然后选出人最多的那一条路更新ans然后将那个节点加入到e当中去当遇到m时则停止
void dis(){memset(ds,0x3f,sizeof ds);ds[s]0;num[s]1;ans[s]jiu[s];for(int i0;in;i){int t-1;for(int j0;jn;j){if(!vis[j](t-1||ds[t]ds[j])) tj;}vis[t]1;// couttendl;for(int j0;jn;j){// coutj tendl;if(ds[j]ds[t]g[t][j]ds[j]!0x3f3f3f3f){num[j]num[t];// cout jj num[j] ds[j] ttendl;if(ans[t]ans[j]-jiu[j]){ans[j]ans[t]jiu[j];last[j]t;}}if(ds[j]ds[t]g[t][j]){ds[j]ds[t]g[t][j];num[j]num[t];ans[j]ans[t]jiu[j];last[j]t;//coutj num[j] ds[j]endl;}}}return ;
}void prin(int i){if(is) return ;prin(last[i]);coutlast[i] ;
}int main(){cinnmsd;for(int i0;in;i) cinjiu[i];memset(g,0x3f,sizeof g);for(int i0;im;i){int a,b,c;cinabc;g[a][b]g[b][a]c;}dis();coutnum[d] ans[d]endl;// couts ;prin(d);coutd;return 0;
}L2-002 链表去重
#includebits/stdc.h
using namespace std;const int N 1e5100;struct hh{int num,last;
}h[N];
int v[N];
int list1[N],list2[N];int main(){int str,n;cinstrn;for(int i0;in;i){int a,b,c;cinabc;h[a]{b,c};}int k str;int j10,j20;while(k!-1){int m abs(h[k].num);if(!v[m]){list1[j1] k;v[m]1;}else{list2[j2] k;}kh[k].last;}for(int i0;ij1;i){if(i!j1-1) printf(%05d %d %05d\n,list1[i],h[list1[i]].num,list1[i1]);else printf(%05d %d -1\n,list1[i],h[list1[i]].num);}for(int i0;ij2;i){if(i!j2-1) printf(%05d %d %05d\n,list2[i],h[list2[i]].num,list2[i1]);else printf(%05d %d -1\n,list2[i],h[list2[i]].num);}return 0;
}L2-004 这是二叉搜索树吗
#includebits/stdc.h
using namespace std;const int N1100;
int a[N];
int post[N];
int k0;
int cnt0;
bool B0;void check(int l,int r){//coutl rrendl;if(lr){//post[k]a[l];return;}int il1,jr;//3 2int root a[l];//5if(!B){while(a[i]rootir) i;while(a[j]rootjl) j--;}else{while(a[i]rootir) i;while(a[j]rootjl) j--;}if(i-j!1) return;check(l1,j);check(j1,r);cnt;//coutrootendl;post[k]root;
}int main(){int n;cinn;for(int i1;in;i) cina[i];check(1,n);if(cnt!n){B1;cnt0;check(1,n);}if(cnt!n) coutNO;else{coutYESendl;coutpost[0];for(int i1;in;i) cout post[i];}return 0;
}L2-005 集合相似度
#includebits/stdc.h
using namespace std;setint v[100];
setint::iterator it;int main(){int n;cinn;for(int i1;in;i){int k;cink;while(k--){int x;cinx;v[i].insert(x);}}int k;cink;while(k--){int x,y;cinxy;setint st;double ans0;for(itv[x].begin();it!v[x].end();it){if(v[y].find(*it) ! v[y].end()) ans;}ans/v[x].size()v[y].size()-ans;printf(%.2f%\n,ans*100);//coutansendl;}return 0;
}L2-006 树的遍历
#includebits/stdc.h
using namespace std;const int N50;
int post[N],in[N];
mapint,int c;void solve(int root,int l,int r,int idx){if(lr) return;int il;while(irin[i]!post[root]) i;c[idx]post[root];solve(root-ri-1,l,i-1,idx*2);solve(root-1,i1,r,idx*21);
}int main(){int n;cinn;for(int i1;in;i) cinpost[i];for(int i1;in;i) cinin[i];solve(n,1,n,1);auto it c.begin();printf(%d,it-second);it;for(it;it!c.end();it){printf( %d,it-second);}return 0;
}L2-007 家庭房产
#includebits/stdc.h
using namespace std;const int N 20000;
int f[N],minn[N],homes[N],homev[N],siz[N];
int nums[N],v[N];int find(int x){if(xf[x]) return x;return f[x]find(f[x]);
}void merge(int x,int y){xfind(x),yfind(y);if(xy) return; minn[y] min(minn[x],minn[y]);f[x]y;homes[y]homes[x];homev[y]homev[x];siz[y]siz[x];
}struct hh{int min_num;int sum;double ave_homes;double ave_homev;
}ans[N];bool cmp(hh x,hh y){if(x.ave_homevy.ave_homev) return x.min_numy.min_num;return x.ave_homevy.ave_homev;
}int main(){int n;cinn;for(int i0;i12000;i) f[i]i,minn[i]i,siz[i]1;int m0;for(int i0;in;i){int num,fa,mo,k,hms,hmv;cinnumfamok;nums[m]num;if(fa!-1) merge(fa,num);if(mo!-1) merge(mo,num);while(k--){int x;cinx;merge(x,num);}numfind(num);cinhmshmv;//coutnum minn[num] homes[num] homev[num]endl;homes[num] hms;homev[num] hmv;//coutnum minn[num] homes[num] homev[num]endl;}m0;for(int i0;in;i){int k find(nums[i]);if(!v[k]){v[k]1;ans[m]{minn[k],siz[k],(double)homes[k]/siz[k],(double)homev[k]/siz[k]};}}sort(ans,ansm,cmp);coutmendl;for(int i0;im;i){printf(%04d %d %.3lf %.3lf\n,ans[i].min_num,ans[i].sum,ans[i].ave_homes,ans[i].ave_homev);}return 0;
}L2-010 排座位
#includebits/stdc.h
using namespace std;const int N 320;
int f[N];
int emy[110][110];int get(int x){if(xf[x]) return x;return f[x]get(f[x]);
}void merge(int x,int y){xget(x),yget(y);f[x] y;
}int main(){int n,m,k;cinnmk;for(int i1;in*3;i) f[i]i;while(m--){int a,b,c;cinabc;if(c1) merge(a,b);else emy[a][b]1,emy[b][a]1;}while(k--){int a,b;cinab;//coutget(a) get(b) emy[a][b]endl;if(get(a)get(b)emy[a][b]!1) coutNo problemendl;else if(get(a)!get(b)emy[a][b]1) coutNo wayendl;else if(get(a)get(b)emy[a][b]1) coutOK but...endl;else coutOKendl;}return 0;
}L2-011 玩转二叉树
#includebits/stdc.h
using namespace std;const int N50;
int in[N],pre[N];
mapint,int c;void solve(int root,int l,int r,int idx){if(lr) return;int il;while(irin[i]!pre[root]) i;c[idx]pre[root];solve(root1,l,i-1,idx*21);solve(rooti-l1,i1,r,idx*2);
}int main(){int n;cinn;for(int i1;in;i) cinin[i];for(int i1;in;i) cinpre[i];solve(1,1,n,1);auto itc.begin();printf(%d,it-second);it;for(it;it!c.end();it){printf( %d,it-second);}return 0;
}L2-012 关于堆的判断
#includebits/stdc.h
using namespace std;const int N 1100;
int h[N];void up(int x){while(x/2h[x/2]h[x]){swap(h[x/2],h[x]);x/2;}
}int getnum(string s,int k){int ans0;for(int ik;is.size();i){if(s[i]0s[i]9) ans ans*10s[i]-0;}if(s[k]-) ans*(-1);return ans;
}int main(){int n,m;cinnm;for(int i1;in;i) cinh[i],up(i);while(m--){int x,i,j;cinx;for(j1;jn;j){if(h[j]x) break;}string s;getline(cin,s);bool A0;if(s[1]a){int num getnum(s,5);for(i1;in;i){if(h[i]num) break;}if(abs(i-j)1) A1;}else{if(s[8]r){if(j1) A1;}else if(s[8]p){int num getnum(s,18);for(i1;in;i){if(h[i]num) break;}if(h[i/2]h[j]) A1;}else{int num getnum(s,15);for(i1;in;i){if(h[i]num) break;}if(h[i*2]h[j]||h[i*21]h[j]) A1;}} //coutxendl;if(A) coutTendl;else coutFendl;}return 0;
}L2-013 红色警报
#includebits/stdc.h
using namespace std;const int N 550;
int g[N][N],v[N];
int n,m;void gdfs(int x){v[x]1;for(int i0;in;i){if(!v[i]g[x][i]) gdfs(i);}
}int dfs(){int cnt0;memset(v,0,sizeof v);for(int i0;in;i){if(!v[i]){cnt;gdfs(i);}}return cnt;
}bool check(int x){int a dfs();for(int i0;in;i) g[x][i]g[i][x]0;int b dfs();if(b-a1) return 1;else return 0;
}int main(){cinnm;while(m--){int x,y;cinxy;g[x][y]g[y][x]1;}int k;cink;for(int i0;ik;i){int x;cinx;bool Acheck(x);if(A) coutCity x is lost.endl;else coutRed Alert: City x is lost!endl;}if(kn) coutGame Over.;return 0;
}L2-014 列车调度
#includebits/stdc.h
using namespace std;int main(){int n;cinn;setint st;while(n--){int x;cinx;auto it st.lower_bound(x);if(it!st.end()){st.erase(*it);}st.insert(x);}coutst.size();
}L2-016 愿天下有情人都是失散多年的兄妹
#includebits/stdc.h
using namespace std;const int N 110000;
struct hh{char sex;int fa,mo;
}h[N];void check(int x,setint st,int cnt){if(x-1||cnt5||x0) return;st.insert(x);check(h[x].fa,st,cnt1);check(h[x].mo,st,cnt1);
}int main(){int n;cinn;for(int i0;in;i){int id;char sex;int fa,mom;cinidsexfamom;//coutid sex fa momendl;h[id]{sex,fa,mom};//1 3 4样例未出现在输入但出现在输出判断男女上if(fa!-1) h[fa].sexM;if(mom!-1) h[mom].sex F;}int k;cink;while(k--){int x,y;cinxy;if(h[x].sex h[y].sex) coutNever Mindendl;else{setint a,b;//coutxx yyendl;check(x,a,1);check(y,b,1);bool A0;//couta.size() b.size()b.size()endl;for(auto it a.begin();it!a.end();it){//coutit *itendl;if(b.find(*it)!b.end()) A1,coutNoendl;if(A) break;}if(!A) coutYesendl;}}return 0;
}L2-019 悄悄关注
#includebits/stdc.h
using namespace std;mapstring,double mp,mpp;int main(){int n,k,m0;cinn;string s;while(n--){cins;mp[s]0;}cinn;double ans0;for(int i0;in;i){cinsk;if(mp.find(s)!mp.end()) ansk,k0,m;mpp[s]k;}ansans/(double)m;bool A1;for(auto impp.begin();i!mpp.end();i){if(i-secondans) A0,couti-firstendl;}if(A) coutBing Mei You;return 0;
}
L2-020 功夫传人
#includebits/stdc.h
using namespace std;vectorvectorint v;
const int N 1e5100;
double dedao[N];
double ans;
double n,z,r;void bfs(){queueintq;q.push(0);while(!q.empty()){int kq.front();q.pop();for(int i0;iv[k].size();i){int mv[k][i];q.push(m);if(dedao[m]1) dedao[m]dedao[m]*dedao[k]*(1-r*0.01),ansdedao[m]*z;else dedao[m]dedao[k]*(1-r*0.01);}}
}int main(){cinnzr;v.resize(n);if(n1){int k,x;cinkx;coutz*x;return 0;}for(int i0;in;i){int k,x;cink;dedao[i]1;if(k0) cinx,dedao[i]x;else{while(k--) cinx,v[i].push_back(x);}}bfs();cout(long long)ans;return 0;
}L2-025 分而治之
#includebits/stdc.h
using namespace std;const int N1e4100;
int h[N],e[N*2],ne[N*2],idx0;
int a[N];
int n,m;void add(int a,int b){e[idx]b,ne[idx]h[a],h[a]idx;
}bool check(){bool A1;for(int i1;in;i){if(a[i]) continue;for(int jh[i];j!-1;jne[j]){int ke[j];if(!a[k]){//coutiendl;A0;break;}}}return A;
}int main(){cinnm;memset(h,-1,sizeof h);for(int i0;im;i){int x,y;cinxy;add(x,y),add(y,x);}int k;cink;while(k--){int v,x;cinv;memset(a,0,sizeof a);for(int i0;iv;i)cinx,a[x]1;if(check()) coutYESendl;else coutNOendl;}return 0;
}L2-026 小字辈
#includebits/stdc.h
using namespace std;const int N 1e5100;
vectorvectorint v;
int a[N],bei[N],maxx,maxn;void bfs(){queueint q;q.push(0);while(!q.empty()){int kq.front();a[k]1;q.pop();for(int j0;jv[k].size();j){int mv[k][j];if(a[m]) continue;q.push(m);bei[m]bei[k]1;if(bei[m]maxx) maxxbei[m],maxn0;if(maxxbei[m]) maxn;}}
}int main(){int n,x;cinn;v.resize(n1);for(int i1;in;i){cinx;if(x-1) x0;v[i].push_back(x);v[x].push_back(i);}bfs();coutmaxxendl;for(int i1;in;i)if(bei[i]maxx){couti;maxn--;if(maxn!0) cout ;}
}L2-029 特立独行的幸福
#includebits/stdc.h
using namespace std;const int N1e4;
int v[N];
mapint,int ans;bool isprim(int x){bool A1;for(int i2;i*ix;i)if(x%i0){A0;break;}return A;
}int main(){int a,b;cinab;for(int ia;ib;i){setint st;int ni;while(n!1){int num0;while(n){int kn%10;numk*k;n/10;}if(st.find(num)!st.end()) break;st.insert(num);nnum;v[num]1;}if(n1) ans[i]st.size();}if(!ans.size()) coutSAD;else{for(auto itans.begin();it!ans.end();it){int k it-first;if(v[k]) continue;if(isprim(k)) coutk 2*(it-second);else coutk it-second;coutendl;}}return 0;
}L2-031 深入虎穴
#includebits/stdc.h
using namespace std;int n;
vectorvectorint v1,v2;
int str-1,endd0;void bfs(vectorvectorint v,int x){queueint q;q.push(x);while(!q.empty()){int kq.front();//coutkkendl;q.pop();//if(q.empty()endd-1) enddk;if(q.empty()) strk;for(int i0;iv[k].size();i){q.push(v[k][i]);}}
}int main(){cinn;v1.resize(n10);v2.resize(n10);for(int i0;in;i){int k;cink;while(k--){int x;cinx;v1[i1].push_back(x);v2[x].push_back(i1);}}bfs(v2,1);//coutstr;bfs(v1,str);coutstr;return 0;
}L2-035 完全二叉树的层序遍历
#includebits/stdc.h
using namespace std;const int N50;
int n;
int post[N];void cinn(int x){if(xn) return;cinn(x*2);cinn(x*21);cinpost[x];
}int main(){cinn;cinn(1);for(int i1;in;i){if(i1) cout ;coutpost[i];}return 0;
}L2-036 网红点打卡攻略
#includebits/stdc.h
using namespace std;int n,m;
const int N220;
int g[N][N];
int v[N],lis[N];int main(){cinnm;while(m--){int a,b,c;cinabc;g[a][b]g[b][a]c;}int k;cink;int ans0,minn0x3f3f3f3f,w;for(int j1;jk;j){memset(v,0,sizeof v);int x;cinx;bool A0;int num0;for(int i1;ix;i){cinlis[i];if(!v[lis[i]]) v[lis[i]]1,num;else A1;}if(A||num!n) continue;if(!g[0][lis[1]]||!g[0][lis[x]]) continue;int sum0;sumg[0][lis[1]];for(int i2;in;i){if(!g[lis[i-1]][lis[i]]) sum0x3f3f3f3f;sumg[lis[i-1]][lis[i]];}sumg[lis[n]][0];if(minnsum){minnsum;wj;}//coutj sum minnendl;ans;}coutansendl;coutw minn;return 0;
}L2-038 病毒溯源
#includebits/stdc.h
using namespace std;int n;
const int N1e4100;
vectorint v[N];
int a[N];
vectorint temp,ans;void dfs(int x){if(temp.size()ans.size()){temp.clear();tempans;}for(int i0;iv[x].size();i){ans.push_back(v[x][i]);dfs(v[x][i]);ans.pop_back();}
}int main(){cinn;for(int i0;in;i){int k;cink;while(k--){int x;cinx;v[i].push_back(x);a[x]1;}if(v[i].size()) sort(v[i].begin(),v[i].end());}for(int i0;in;i){if(!a[i]){ans.push_back(i);dfs(i);}}couttemp.size()endl;for(int i0;itemp.size();i){if(i) cout ;couttemp[i];}return 0;
}L2-039 清点代码库
#include bits/stdc.h
using namespace std;
int n, m, t;
vectorint temp;
mapvectorint, int A;
multimapint, vectorint, greaterint B;
int main() {scanf(%d%d, n, m);temp.resize(m);for (int i 0; i n; i) {for (int j 0; j m; j) scanf(%d, temp[j]);A[temp];}for (auto it : A) B.insert({it.second, it.first});printf(%d\n, A.size());for (auto it : B) {printf(%d, it.first);for (auto it2 : it.second) printf( %d, it2);printf(\n);}return 0;
}L2-040 哲哲打游戏
#includebits/stdc.h
using namespace std;
const int N100004;
vectorint v[N];
int dan[N],p1;
int main()
{int n,m;cinnm;for(int i1;in;i){int k;cink;while(k--){int x;cinx;v[i].push_back(x);}}while(m--){int x,y;cinxy;if(x0){pv[p][y-1];}else if(x1){dan[y]p;coutpendl;}else {pdan[y];}}coutp;return 0;
}
L2-042 老板的作息表
#includeiostream
#includealgorithm
#includevector
using namespace std;
int main()
{int n;cinn;vectorpairstring,string s;for(int i0;in;i){string a,b,c;cinacb; s.push_back({a,b});}sort(s.begin(),s.end());string la-1;for(auto p:s){if(la-1){lap.second;if(p.first!00:00:00)cout00:00:00 - p.firstendl;}else{if(la!p.first) coutla - p.firstendl;lap.second;}}if(la!23:59:59) coutla - 23:59:59endl;return 0;
}
