제출 #484627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
484627		Victor	Pipes (CEOI15_pipes)	C++17	0 / 100	780 ms	62200 KiB

pipes

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

set<ii> ans;

struct union_find {
    int p[100001];
    short rank[100001];
    union_find(int n) {
        rep(i, 0, n) p[i] = i;
        memset(rank, 0, sizeof(rank));
    }

    int find_set(int i) { return p[i] == i ? i : find_set(p[i]); }
    void union_set(int i, int j) {
        i = find_set(i);
        j = find_set(j);
        if (i == j) return;

        if (rank[i] < rank[j]) swap(i, j);
        if (rank[i] == rank[j]) ++rank[i];
        p[j] = i;
    }
};

bitset<17> edges[6000000];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int n, m;
    cin >> n >> m;

    rep(i, 0, m) {
        int u, v;
        cin >> u >> v;
        --u;
        --v;
    }

    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10