Submission #1063213

---

Source Code Expand

#define DEB
#include<bits/stdc++.h>
#define REP(i,m) for(int i=0;i<(m);++i)
#define REPN(i,m,in) for(int i=(in);i<(m);++i)
#define ALL(t) (t).begin(),(t).end()
#define CLR(a) memset((a),0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

using namespace std;


#ifdef DEB
#define dump(x)  cerr << #x << " = " << (x) << endl
#define prl cerr<<"called:"<< __LINE__<<endl
#define dumpR(x) cerr<<"\x1b[31m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
#define dumpY(x) cerr<<"\x1b[33m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
#define dumpG(x) cerr<<"\x1b[32m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
template<class T> void debug(T a,T b){ for(;a!=b;++a) cerr<<*a<<' ';cerr<<endl;}
#else
#define dump(x) ;
#define dumpR(x) ;
#define dumpY(x) ;
#define dumpG(x) ;
#define prl ;
template<class T> void debug(T a,T b){ ;}
#endif

template<class T> void chmin(T& a,const T& b) { if(a>b) a=b; }
template<class T> void chmax(T& a,const T& b) { if(a<b) a=b; }

typedef long long int lint;
typedef pair<int,lint> pi;

namespace std{
  template<class S,class T>
  ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.fr<<','<<a.sc<<')';
    return out;
  }
}

//const int INF=5e8;
int n,m,q;
vector<pi> g[100005];

lint xsum[100005];
bool vis[100005];

int cnt;
lint cycle[200005];
int dep[100005];
void dfs(int v,int p,lint sum,int d){
  xsum[v]=sum;
  dep[v]=d;
  vis[v]=1;
  for(auto e:g[v]){
    if(e.fr==p) continue;
    if(vis[e.fr]){
      if(dep[e.fr]<dep[v]) cycle[cnt++]=xsum[v]^xsum[e.fr]^e.sc;
      continue;
    }
    dfs(e.fr,v,sum^e.sc,d+1);
  }
}
int main(){
  cin>>n>>m>>q;
  REP(i,m){
    int a,b;
    lint c;
    scanf("%d%d%lld",&a,&b,&c);
    g[a].pb({b,c});
    g[b].pb({a,c});
  }
  dfs(0,-1,0ll,0);
  assert(cnt==m-n+1);

  int seek=0;
  int toflip[65];
  memset(toflip,-1,sizeof(toflip));
  for(int i=59;i>=0;--i){
    bool ok=false;
    REPN(j,cnt,seek) if(cycle[j]>>i&1){
      ok=true;
      swap(cycle[j],cycle[seek]);
      break;
    }
    if(!ok) continue;
    REP(j,cnt) if(j!=seek && cycle[j]>>i&1) cycle[j]^=cycle[seek];
    toflip[i]=seek;
    ++seek;
  }

  REP(hoge,q){
    int a,b;scanf("%d%d",&a,&b);
    lint res=xsum[a]^xsum[b];

    for(int i=59;i>=0;--i) if(!(res>>i&1) && ~toflip[i]){
      res^=cycle[toflip[i]];
    }
    cout<<res<<endl;
  }
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:73:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%lld",&a,&b,&c);
                               ^
./Main.cpp:97:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int a,b;scanf("%d%d",&a,&b);
                                ^

Judge Result