oj.uz

답안 #626049

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626049 2022-08-11T07:28:59 Z Soul234 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++14
17 / 100
 113 ms 39248 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
#define fi first
#define se second
#define ins insert

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;
const int MX = 1e5+5;

struct UF {
    int N; vi e;
    queue<pi> q;
    set<int> adj[MX], radj[MX], fl_ers[MX];
    ll curans = 0;
    void init(int _N) {
        N = _N;
        e.assign(MX, -1);
        FOR(i, 1, N+1) {
            fl_ers[i].ins(i);
        }
    }
    int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); }

    int get_size(int x) { return sz(adj[x]) + sz(radj[x]) + sz(fl_ers[x]); }

    void insFollow(int a, int b) {
        adj[a].ins(b);
        radj[b].ins(a);
        if(adj[b].count(a)) q.push({a, b});
    }

    void join(int a, int b) {
        if(a == b) return;

        if(get_size(a) < get_size(b)) swap(a, b);

        curans += -1LL*e[a]*sz(fl_ers[b]) - 1LL*e[b]*sz(fl_ers[a]);

        e[a] += e[b];
        e[b] = a;

        each(v, fl_ers[b]) {
            if(fl_ers[a].count(v)) curans += e[a];
            else fl_ers[a].ins(v);
        }

        assert(adj[a].count(b) && adj[b].count(a));
        assert(radj[a].count(b) && radj[b].count(a));

        adj[a].erase(b); radj[a].erase(b);
        adj[b].erase(a); radj[b].erase(a);

        each(v, adj[b]) {
            assert(radj[v].count(b));
            radj[v].erase(b);
            insFollow(a, v);
        }

        each(v, radj[b]) {
            assert(adj[v].count(b));
            adj[v].erase(b);
            insFollow(v, a);
        }
    }

    void query_upd(int a, int b) {
        b = find(b);
        if(find(a) == b || fl_ers[b].count(a)) return;
        fl_ers[b].ins(a);
        curans -= e[b];

        a = find(a);
        insFollow(a, b);

        while(!q.empty()) {
            tie(a, b) = q.front();
            q.pop();
            join(find(a), find(b));
        }
    }
};

int N, M;
UF dsu;

void solve() {
    cin >> N >> M;
    dsu.init(N+5);
    while(M-- > 0) {
        int a, b;
        cin >> a >> b;
        dsu.query_upd(a, b);
        cout << dsu.curans << nl;
    }
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

joitter2.cpp: In function 'void setIO(std::string)':
joitter2.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joitter2.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14804 KB Output is correct
2 Correct 7 ms 14724 KB Output is correct
3 Correct 7 ms 14700 KB Output is correct
4 Correct 7 ms 14804 KB Output is correct
5 Correct 8 ms 14804 KB Output is correct
6 Correct 8 ms 14804 KB Output is correct
7 Correct 8 ms 14804 KB Output is correct
8 Correct 8 ms 14804 KB Output is correct
9 Correct 9 ms 14804 KB Output is correct
10 Correct 8 ms 14708 KB Output is correct
11 Correct 8 ms 14804 KB Output is correct
12 Correct 10 ms 14716 KB Output is correct
13 Correct 8 ms 14736 KB Output is correct
14 Correct 7 ms 14804 KB Output is correct
15 Correct 7 ms 14804 KB Output is correct
16 Correct 8 ms 14804 KB Output is correct
17 Correct 8 ms 14804 KB Output is correct
18 Correct 9 ms 14804 KB Output is correct
19 Correct 8 ms 14804 KB Output is correct
20 Correct 8 ms 14804 KB Output is correct
21 Correct 8 ms 14864 KB Output is correct
22 Correct 7 ms 14804 KB Output is correct
23 Correct 8 ms 14804 KB Output is correct
24 Correct 8 ms 14764 KB Output is correct
25 Correct 8 ms 14804 KB Output is correct
26 Correct 8 ms 14804 KB Output is correct
27 Correct 8 ms 14804 KB Output is correct
28 Correct 8 ms 14700 KB Output is correct
29 Correct 7 ms 14804 KB Output is correct
30 Correct 7 ms 14804 KB Output is correct
31 Correct 7 ms 14804 KB Output is correct
32 Correct 7 ms 14792 KB Output is correct
33 Correct 9 ms 14844 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14804 KB Output is correct
2 Correct 7 ms 14724 KB Output is correct
3 Correct 7 ms 14700 KB Output is correct
4 Correct 7 ms 14804 KB Output is correct
5 Correct 8 ms 14804 KB Output is correct
6 Correct 8 ms 14804 KB Output is correct
7 Correct 8 ms 14804 KB Output is correct
8 Correct 8 ms 14804 KB Output is correct
9 Correct 9 ms 14804 KB Output is correct
10 Correct 8 ms 14708 KB Output is correct
11 Correct 8 ms 14804 KB Output is correct
12 Correct 10 ms 14716 KB Output is correct
13 Correct 8 ms 14736 KB Output is correct
14 Correct 7 ms 14804 KB Output is correct
15 Correct 7 ms 14804 KB Output is correct
16 Correct 8 ms 14804 KB Output is correct
17 Correct 8 ms 14804 KB Output is correct
18 Correct 9 ms 14804 KB Output is correct
19 Correct 8 ms 14804 KB Output is correct
20 Correct 8 ms 14804 KB Output is correct
21 Correct 8 ms 14864 KB Output is correct
22 Correct 7 ms 14804 KB Output is correct
23 Correct 8 ms 14804 KB Output is correct
24 Correct 8 ms 14764 KB Output is correct
25 Correct 8 ms 14804 KB Output is correct
26 Correct 8 ms 14804 KB Output is correct
27 Correct 8 ms 14804 KB Output is correct
28 Correct 8 ms 14700 KB Output is correct
29 Correct 7 ms 14804 KB Output is correct
30 Correct 7 ms 14804 KB Output is correct
31 Correct 7 ms 14804 KB Output is correct
32 Correct 7 ms 14792 KB Output is correct
33 Correct 9 ms 14844 KB Output is correct
34 Correct 9 ms 14872 KB Output is correct
35 Correct 84 ms 18360 KB Output is correct
36 Correct 103 ms 20768 KB Output is correct
37 Correct 105 ms 20928 KB Output is correct
38 Correct 99 ms 20548 KB Output is correct
39 Correct 10 ms 15108 KB Output is correct
40 Correct 13 ms 15444 KB Output is correct
41 Correct 11 ms 15424 KB Output is correct
42 Correct 10 ms 15068 KB Output is correct
43 Correct 11 ms 15060 KB Output is correct
44 Correct 11 ms 15072 KB Output is correct
45 Correct 10 ms 15060 KB Output is correct
46 Correct 10 ms 15060 KB Output is correct
47 Correct 15 ms 15216 KB Output is correct
48 Correct 11 ms 15316 KB Output is correct
49 Correct 17 ms 16004 KB Output is correct
50 Correct 113 ms 20936 KB Output is correct
51 Correct 15 ms 15392 KB Output is correct
52 Correct 91 ms 19284 KB Output is correct
53 Correct 18 ms 15864 KB Output is correct
54 Correct 91 ms 20076 KB Output is correct
55 Correct 12 ms 15444 KB Output is correct
56 Correct 17 ms 15532 KB Output is correct
57 Correct 12 ms 15444 KB Output is correct
58 Correct 12 ms 15444 KB Output is correct
59 Correct 15 ms 15444 KB Output is correct
60 Correct 94 ms 17780 KB Output is correct
61 Correct 12 ms 15316 KB Output is correct
62 Correct 95 ms 20300 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14804 KB Output is correct
2 Correct 7 ms 14724 KB Output is correct
3 Correct 7 ms 14700 KB Output is correct
4 Correct 7 ms 14804 KB Output is correct
5 Correct 8 ms 14804 KB Output is correct
6 Correct 8 ms 14804 KB Output is correct
7 Correct 8 ms 14804 KB Output is correct
8 Correct 8 ms 14804 KB Output is correct
9 Correct 9 ms 14804 KB Output is correct
10 Correct 8 ms 14708 KB Output is correct
11 Correct 8 ms 14804 KB Output is correct
12 Correct 10 ms 14716 KB Output is correct
13 Correct 8 ms 14736 KB Output is correct
14 Correct 7 ms 14804 KB Output is correct
15 Correct 7 ms 14804 KB Output is correct
16 Correct 8 ms 14804 KB Output is correct
17 Correct 8 ms 14804 KB Output is correct
18 Correct 9 ms 14804 KB Output is correct
19 Correct 8 ms 14804 KB Output is correct
20 Correct 8 ms 14804 KB Output is correct
21 Correct 8 ms 14864 KB Output is correct
22 Correct 7 ms 14804 KB Output is correct
23 Correct 8 ms 14804 KB Output is correct
24 Correct 8 ms 14764 KB Output is correct
25 Correct 8 ms 14804 KB Output is correct
26 Correct 8 ms 14804 KB Output is correct
27 Correct 8 ms 14804 KB Output is correct
28 Correct 8 ms 14700 KB Output is correct
29 Correct 7 ms 14804 KB Output is correct
30 Correct 7 ms 14804 KB Output is correct
31 Correct 7 ms 14804 KB Output is correct
32 Correct 7 ms 14792 KB Output is correct
33 Correct 9 ms 14844 KB Output is correct
34 Correct 9 ms 14872 KB Output is correct
35 Correct 84 ms 18360 KB Output is correct
36 Correct 103 ms 20768 KB Output is correct
37 Correct 105 ms 20928 KB Output is correct
38 Correct 99 ms 20548 KB Output is correct
39 Correct 10 ms 15108 KB Output is correct
40 Correct 13 ms 15444 KB Output is correct
41 Correct 11 ms 15424 KB Output is correct
42 Correct 10 ms 15068 KB Output is correct
43 Correct 11 ms 15060 KB Output is correct
44 Correct 11 ms 15072 KB Output is correct
45 Correct 10 ms 15060 KB Output is correct
46 Correct 10 ms 15060 KB Output is correct
47 Correct 15 ms 15216 KB Output is correct
48 Correct 11 ms 15316 KB Output is correct
49 Correct 17 ms 16004 KB Output is correct
50 Correct 113 ms 20936 KB Output is correct
51 Correct 15 ms 15392 KB Output is correct
52 Correct 91 ms 19284 KB Output is correct
53 Correct 18 ms 15864 KB Output is correct
54 Correct 91 ms 20076 KB Output is correct
55 Correct 12 ms 15444 KB Output is correct
56 Correct 17 ms 15532 KB Output is correct
57 Correct 12 ms 15444 KB Output is correct
58 Correct 12 ms 15444 KB Output is correct
59 Correct 15 ms 15444 KB Output is correct
60 Correct 94 ms 17780 KB Output is correct
61 Correct 12 ms 15316 KB Output is correct
62 Correct 95 ms 20300 KB Output is correct
63 Runtime error 30 ms 39248 KB Execution killed with signal 11
64 Halted 0 ms 0 KB -