Submission #66966099

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#pragma region
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<chrono>
#include<cinttypes>
#include<climits>
#include<cmath>
#include<complex>
#include<cstdio>
#include<cstring>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<limits>
#include<map>
#include<numeric>
#include<queue>
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#pragma region
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<chrono>
#include<cinttypes>
#include<climits>
#include<cmath>
#include<complex>
#include<cstdio>
#include<cstring>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<limits>
#include<map>
#include<numeric>
#include<queue>
#include<random>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<tuple>
#include<type_traits>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
//# pragma GCC target("avx2")
//# pragma GCC optimize("O3")
struct Init{ Init(){ std::cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(20) << fixed; } }init;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(x) begin((x)), end((x))
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define uq(v) v.erase(unique(begin(v), end(v)), end(v))
#define _overload4(_1,_2,_3,_4,name,...) name
#define _overload3(_1,_2,_3,name,...) name
#define _rep1(n) for(int i = 0; i < n; ++i)
#define _rep2(i,n) for(int i = 0; i < n; ++i)
#define _rep3(i,a,b) for(int i = a; i < b; ++i)
#define _rep4(i,a,b,c) for(int i = a; i < b; i += c)
#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)
#define _rrep1(n) for(int i = (n) - 1; i >= 0; --i)
#define _rrep2(i,n) for(int i = (n) - 1; i >= 0; --i)
#define _rrep3(i,a,b) for(int i = (b) - 1; i >= (a); --i)
#define _rrep4(i,a,b,c) for(int i = a + (b - a - 1) / c*c; i >= a; i -= c)
#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)
template<class T> using pq = priority_queue<T>;
template<class T> using pq_g = priority_queue<T, vector<T>, greater<T>>;
template<class T> bool chmax(T &a, const T &b){ if(a < b){a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b){ if(a > b){a = b; return 1; } return 0; }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
constexpr ull INF = (1ULL << 61) + (1ULL << 30);
constexpr int inf = (1 << 30);
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, 1 ,0, -1, 1, -1, 1, -1};

#pragma endregion

struct UnionFind{
    vector<int> par, rank, siz;
    UnionFind(int n): par(n, -1), rank(n, 0), siz(n, 1){}
    // x の根を求める
    int root(int x){
        if(par[x] == -1) return x;
        else return par[x] = root(par[x]);
    }
    // x と y が連結か
    bool same(int x, int y){
        return root(x) == root(y);
    }
    // x と y を結ぶ
    bool merge(int x, int y){
        int rx = root(x), ry = root(y);
        if(rx == ry) return false;
        if(rank[rx] < rank[ry]) swap(rx, ry);
        par[ry] = rx;
        if(rank[rx] == rank[ry]) ++rank[rx];
        siz[rx] += siz[ry];
        return true;
    }
    // x の連結成分の個数
    int size(int x){
        return siz[root(x)];
    }
};


void solve(){
    int N, M; cin >> N >> M;
    vector<set<int>> G(N);
    vector<int> U(M), V(M);
    rep(i, M){
        cin >> U[i] >> V[i];
        G[--U[i]].insert(--V[i]);
        G[V[i]].insert(U[i]);
    }
    int Q; cin >> Q;
    UnionFind uf(N);
    rep(i, Q){
        int X; cin >> X;
        --X;
        int u = U[X], v = V[X];
        int ur = uf.root(u);
        int vr = uf.root(v);
        if(ur == vr){
            cout << M << "\n";
            continue;
        }
        uf.merge(ur, vr);
        int nr = uf.root(ur);
        if(nr == ur){
            for(auto k: G[vr]){
                if(k == ur){
                    G[ur].erase(vr);
                    --M;
                    continue;
                }
                if(G[ur].contains(k)){
                    G[k].erase(vr);
                    --M;
                    continue;
                }
                G[ur].insert(k);
            }
            G[vr].clear();
            cout << M << "\n";
        }
    }
}

int main(){
    int T;
    T = 1;
    //cin >> T;
    rep(i, T) solve(); 
}

Submission Info

Compile Error

Main.cpp:1: warning: ignoring ‘#pragma region ’ [-Wunknown-pragmas]
    1 | #pragma region
      | 
Main.cpp:68: warning: ignoring ‘#pragma endregion ’ [-Wunknown-pragmas]
   68 | #pragma endregion
      | 

Judge Result