Submission #525193

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<climits>
#include<algorithm>
#include<vector>
#include<valarray>
#include<string>
#include<set>
#include<map>
#include<stack>
#include<queue>
using namespace std;
  
  
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define DREP(i,n) for(int i=n;i>0;i--)
#define Rep(i,m,n) for(int i=m;i<n;i++)
#define scani(a) scanf("%d",&a)
#define scand(a) scanf("%lf",&a)
#define scans(s) scanf("%s",s)
#define readi(a) int a;scanf("%d",&a)
#define printi(a) printf("%d",a)
#define prints(s) printf("%s",s)
#define even(n) (((n)+1)%2)
#define odd(n) ((n)%2)
#define sg(x) ((x)?1:0)
#define LF printf("\n")
#define SPACE printf(" ")
#define pb push_back
#define mp make_pair
#define bs binary_search
#define all(a) (a).begin(),(a).end()
#define forall(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define MOD 1000000007
  
typedef long long LL;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef pair<double,double> pdd;
typedef pair<int,int> pii;
  
const double pi=acos(-1.0);
double rad(double t){return t*pi/180.0;}
double deg(double d){return d*180.0/pi;}
int GCD(int x,int y){if(x<y)swap(x,y);return x%y?GCD(y,x%y):y;}
int LCM(int x,int y){return x/GCD(x,y)*y;}

vector<pair<int,int> > edge[100009];
map<int,int> num;
int cost1[100009];
bool flag[100009];

void dfs(int a){
  flag[a]=true;
  rep(i,edge[a].size()){
    int next = edge[a][i].first;
    if(flag[next])continue;
    cost1[next]=cost1[a]^edge[a][i].second;
    dfs(next);
  }
}

int main(){
  readi(N);readi(X); 
  REP(loop,N-1){
    readi(x);readi(y);readi(c);
    edge[x].pb(mp(y,c));
    edge[y].pb(mp(x,c));
  }

  dfs(1);
  REP(i,N){
    if(num.find(cost1[i])!=num.end())num[cost1[i]]++;
    else num[cost1[i]]=1;
  }

  LL ans=0;
  
  if(X==0){
    forall(itr,num){
      LL n = itr->second;
      ans += n*(n-1)/2;
    }
  }else{
    forall(itr,num){
      int x = itr->first;
      if(num.find(x^X)!=num.end())
	ans += ((LL)num[x])*num[x^X];
    }
    ans/=2;
  }

  printf("%ld\n",ans);

  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:97:21: warning: format ‘%ld’ expects argument of type ‘long int’, but argument 2 has type ‘LL {aka long long int}’ [-Wformat=]
   printf("%ld\n",ans);
                     ^
./Main.cpp:68:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   readi(N);readi(X); 
           ^
./Main.cpp:68:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   readi(N);readi(X); 
                    ^
./Main.cpp:70:13: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     readi(x);readi(y);readi(c);
             ^
./Main.cpp:70:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     readi(x);readi(y);readi(c);
                      ^
./...

Judge Result