好像是的qwq
by Pisces @ 2019-11-26 14:06:43
$$\Large{TQL}$$
by world_execute @ 2019-11-26 15:16:03
@[world_execute](/user/115196) %%%
by RainFestival @ 2019-11-27 13:09:14
```cpp
#include <iostream>
#include <string>
using namespace std;
int main(){
string a=TQL;
for(int i=1;i<=3;i++)
cout<<a<<endl;
return 0;
}
```
TQL
TQL
TQL
by MrJia12138 @ 2020-03-04 20:34:53
@[MrJia12138](/user/251186) 一看是代码立马复制粘贴提交一气呵成
by wallcrack @ 2020-03-05 20:16:42
```
#include<bits/stdc++.h>
#include<queue>
using namespace std;
int dis[3][3005]={-1};
vector<int> vv[3005];
void bfs(int rt,int ii){
queue<int> q;
q.push(rt);
dis[ii][rt]=0;
while(!q.empty()){
int fr=q.front();q.pop();
for(int i=0;i<vv[fr].size();i++){
if(dis[ii][i]==-1){
q.push(vv[fr][i]);
dis[ii][i]=dis[ii][vv[fr][i]]+1;
}
}
}
}
int main()
{
int n,m;std::cin>>n>>m;
for(int i=1;i<m;i++){
int a,b;cin>>a>>b;
vv[a].push_back(b);
vv[b].push_back(a);
}
int s1,s2,t1,t2;std::cin>>s1>>s2>>t1>>t2;
bfs(1,0);
bfs(s1,1);
bfs(s2,2);
int ans=2e9;
for(int i=1;i<=n;i++)
if(dis[0][i]+dis[1][i]<=t1&&dis[0][i]+dis[2][i]<=t2)
ans=min(ans,dis[0][i]+dis[1][i]+dis[2][i]);
if(ans==2e9) ans=-1;
else ans=m-ans;
printf("%d\n",ans);
return 0;
}
```
可我这代码是0分，怎么回事
by shimao @ 2020-07-17 22:19:35