Submission #2179819

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;

#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define rep(n, i) Rep(0, n-1, i)
#define MAX 200000

const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const int MOD = 1000000007;

typedef long long ll;
typedef pair<ll, ll> llP;
typedef pair<int, int> intP;
typedef std::priority_queue<int> IntPrioQueue; //Z->A
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue; //A->Z


//number of elements
const int MAX_NODE = 100000;
//number of parents(par[i] = i => root)
int par[MAX_NODE];
//initialize
void init(int n){
    rep(n, i) par[i] = i;
}
//solve root
int root(int x){
    if (par[x] == x) return x;
    else return par[x] = root(par[x]);
}
//unit?
bool same(int x, int y){
    return root(x) == root(y);
}
//unite
void unite(int x, int y){
    x = root(x);
    y = root(y);
    if (x == y) return;
    par[x] = y;
}

void solve(void){
    int N, Q;
    cin >> N >> Q;
    init(N);
    rep(Q, meaningless){
        int p, a, b;
        scanf("%d %d %d\n", &p, &a, &b);
        if (p == 0) unite(a, b);
        else if (p == 1) {
            printf("%s\n", same(a, b)?"Yes":"No");
        }
    }
}

int main(void){
  solve();
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:64:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d\n", &p, &a, &b);
                                        ^

Judge Result