Submission #2699158


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

class UnionFind {
  vector<int> data;
 public:
  UnionFind(int size) : data(size, -1) { }
  bool unionSet(int x, int y) {
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
    }
    return x != y;
  }
  bool findSet(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};


void solve(int N,int K,int L,vi& p,vi& q,vi& r,vi& s) {
    UnionFind uf1(N), uf2(N);
    rep(i,K){
        uf1.unionSet(p[i], q[i]);
    }
    rep(i,L){
        uf2.unionSet(r[i], s[i]);
    }

    vector<ii> w(N);
    rep(i,N) w[i] = ii(uf1.root(i), uf2.root(i));

    map<ii,int> st;
    rep(i,N){
        ++st[ w[i] ];
    }

    rep(i,N){
        cout << st[ w[i] ];
        if (i < N-1) cout << " ";
    }
    cout << endl;
}

int main() {
    int N,K,L; cin>>N>>K>>L;
    vi p(K),q(K);
    rep(i,K) { cin>>p[i]>>q[i]; --p[i]; --q[i]; }
    vi r(L),s(L);
    rep(i,L) { cin>>r[i]>>s[i]; --r[i]; --s[i]; }

    solve(N,K,L,p,q,r,s);

    return 0;
}

Submission Info

Submission Time
Task D - 連結 / Connectivity
User naoya_t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 3622 Byte
Status
Exec Time 224 ms
Memory 16640 KB

Compile Error

./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:85:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     fgets(_buf, 256, stdin);
                            ^

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All 400 / 400 subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt 1 ms 256 KB
subtask0_1.txt 1 ms 256 KB
subtask0_2.txt 1 ms 256 KB
subtask1_0.txt 85 ms 1664 KB
subtask1_1.txt 224 ms 16640 KB
subtask1_10.txt 89 ms 1792 KB
subtask1_11.txt 203 ms 14976 KB
subtask1_12.txt 143 ms 14336 KB
subtask1_13.txt 156 ms 15616 KB
subtask1_14.txt 162 ms 11520 KB
subtask1_2.txt 126 ms 11264 KB
subtask1_3.txt 159 ms 15616 KB
subtask1_4.txt 163 ms 12416 KB
subtask1_5.txt 91 ms 1792 KB
subtask1_6.txt 192 ms 14080 KB
subtask1_7.txt 146 ms 15616 KB
subtask1_8.txt 165 ms 15744 KB
subtask1_9.txt 152 ms 8960 KB