Submission #10450339

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
struct unionfind{
    vector<int> par, sz;
    unionfind() {}
    unionfind(int n):par(n), sz(n, 1){
        for(int i=0; i<n; i++) par[i]=i;
    }
    int find(int x){
        if(par[x]==x) return x;
        return par[x]=find(par[x]);
    }
    void unite(int x, int y){
        x=find(x); y=find(y);
        if(x==y) return;
        if(sz[x]>sz[y]) swap(x, y);
        par[x]=y;
        sz[y]+=sz[x];
    }
    bool same(int x, int y){
        return find(x)==find(y);
    }
    int size(int x){
        return sz[find(x)];
    }
};
int main()
{
    int n, m, k;
	cin>>n>>m>>k;
	int a[100010], b[100010], c[100010], d[100010];
	unionfind uf(n);
	for(int i=0; i<m; i++){
		cin>>a[i]>>b[i];
		a[i]--; b[i]--;
		if(a[i]>b[i]) swap(a[i], b[i]);
		uf.unite(a[i], b[i]);
	}
	for(int i=0; i<k; i++){
		cin>>c[i]>>d[i];
		c[i]--; d[i]--;
		if(c[i]>d[i]) swap(c[i], d[i]);
	}
	vector<int> v;
	for(int i=0; i<n; i++){
		v.push_back(uf.find(i));
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	int ans[100010]={};
	for(auto x:v){
		ll cnt=uf.size(x);
		ans[x]+=cnt;
	}
	int myon[100010]={};
	for(int i=0; i<k; i++){
		if(uf.same(c[i], d[i])){
			myon[c[i]]++; myon[d[i]]++;
		}
	}
	for(int i=0; i<m; i++){
		myon[a[i]]++; myon[b[i]]++;
	}
	for(int i=0; i<n; i++) cout<<ans[uf.find(i)]-myon[i]-1<<" ";
	cout<<endl;
	return 0;
}

Submission Info

Judge Result