codeforces 395 D

代码

#include 
#include 
#include 
using namespace std;
int x[100500];
int y[100500];
int k[100500];
int t[100500];
int dfs(){
    
}
int main(){
    //freopen("in.txt","r",stdin);
    int i,j,l,f1,f2,t1,t2,g1,g2,n,m;
    cin >> n;
    memset(x,0,sizeof(x));
    memset(y,0,sizeof(y));
    for(i=1;i> x[i] >> y[i];
    memset(k,0,sizeof(k));
    memset(t,0,sizeof(t));
    for(i=1;i<=n;i++)
        cin >> t[i];
        m=0;
    for(i=1;i

2个思路

#include 
#include 
#include 
#include 
using namespace std;
int x[100500];
int y[100500];
vectorqq[100500];
int se[100500];
int dfs(int y,int x){
    //cout << " y=  " << y << " x=  " << x << endl;
    if(qq[x].size()>1||qq[x][0]!=y){
    int i;
    int g1=0;
    for(i=0;i> n;
    memset(x,0,sizeof(x));
    memset(y,0,sizeof(y));
    memset(se,0,sizeof(se));
    for(i=1;i> x[i] >> y[i];
        qq[x[i]].push_back(y[i]);
        qq[y[i]].push_back(x[i]);
    }
    for(i=1;i<=n;i++)
        cin >> se[i];
   for(i=1;i