제출 #568141

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
568141		abc864197532	조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2)	C++17	1 / 100	5038 ms	100768 KiB

joitter2

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    for (; l != r; ++l) cout << *l << " \n"[l + 1 == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    if (a.empty()) return o << "{}";
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout); 
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 1e9 + 7, N = 2000, logN = 20, K = 48763;

set <int> unvis[N], rev[N], norev[N];
set <int> both[N];
int ans = 0;

int main () {
    owo;
    int n, q;
    cin >> n >> q;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) if (i ^ j)
            unvis[i].insert(j), norev[j].insert(i);
    }
    auto upd = [&](int u, int v) {
        unvis[u].erase(v), norev[v].erase(u), rev[v].insert(u), ans++;
        if (!unvis[v].count(u))
            both[v].insert(u), both[u].insert(v);
    };
    while (q--) {
        int u, v;
        cin >> u >> v, --u, --v;
        if (unvis[u].count(v)) {
            upd(u, v);
            queue <pii> q;
            q.emplace(u, v);
            while (!q.empty()) {
                int u, v; tie(u, v) = q.front(); q.pop();
                vector <pii> add;
                if (unvis[u].size() > both[v].size()) {
                    for (int x : both[v]) if (unvis[u].count(x))
                        add.eb(u, x);
                } else {
                    for (int x : unvis[u]) if (both[v].count(x))
                        add.eb(u, x);
                }
                if (both[u].count(v)) {
                    if (rev[u].size() > norev[v].size()) {
                        for (int x : norev[v]) if (rev[u].count(x))
                            add.eb(x, v);
                    } else {
                        for (int x : rev[u]) if (norev[v].count(x))
                            add.eb(x, v);
                    }
                    swap(v, u);
                    if (rev[u].size() > norev[v].size()) {
                        for (int x : norev[v]) if (rev[u].count(x))
                            add.eb(x, v);
                    } else {
                        for (int x : rev[u]) if (norev[v].count(x))
                            add.eb(x, v);
                    }
                }
                for (auto [u, v] : add)
                    upd(u, v), q.emplace(u, v);
            }
        }
        cout << ans << '\n';
    }
}

• Subtask 1: 1 / 1
• Subtask 2: 0 / 16
• Subtask 3: 0 / 83