oj.uz

답안 #553291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553291 2022-04-25T11:01:14 Z RaresFelix Collapse (JOI18_collapse) C++17
5 / 100
 15000 ms 414536 KB 
#include "collapse.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;
using Edge = tuple<int, int, int, int>; //from, to, begin, end
using vEd = vector<Edge>;
using vi = vector<int>;

struct DSU { /// with roll_back
    int n;
    vector<int> P, S;
    DSU(int n) : n(n) {
        P.resize(n), S.assign(n, 1);
        for(int i = 0; i < n; ++i) P[i] = i;
    }
    inline int repr(int u) {
        while(P[u] != u) u = P[u];
        return u;
    }
    int nr_uni = 0;
    stack<int> RP, RS;
    inline void uni(int u, int v) {
        u = repr(u), v = repr(v);
        if(u == v) return;
        if(S[u] < S[v]) swap(u, v);
        ++nr_uni, RP.push(v); RS.push(S[v]);
        P[v] = u, S[u] += S[v];
    }
    inline void roll_back(int update_count) {
        while(nr_uni > update_count) {
            --nr_uni;
            P[RP.top()] = RP.top();
            S[RP.top()] = RS.top();
            RP.pop(), RS.pop();
        }
    }
    inline void clear() {
        nr_uni = 0;
        while(!RP.empty()) RP.pop();
        while(!RS.empty()) RS.pop();
        for(int i = 0; i < n; ++i) P[i] = i, S[i] = 0;
    }
};

struct Bucket {
    DSU Simu;
    int begin, end;
    Bucket(int n, int begin, int end) : Simu(n), begin(begin), end(end) {}
    vector<Edge> idk;
    void clear() {
        Simu.clear(), idk.clear();
    }
    void add_edge(Edge nou) {
        auto &[f, t, b, e] = nou;
        if(e < begin || end < b) return;
        if(b <= begin && end <= e) { //complet
            Simu.uni(f, t);
            return;
        }
        idk.push_back(nou);
    }
    int query(int timp) {
        int count0 = Simu.nr_uni;
        for(auto &it : idk) {
            auto &[f, t, b, e] = it;
            if(b <= timp && timp <= e) Simu.uni(f, t);
        }
        int re = Simu.nr_uni;
        Simu.roll_back(count0);
        return re;
    }
};

vector<Bucket> Sol;
void solve(int n, int c, int q, vEd &edges, vi &W, vi &P, vi &R) {
    R.assign(q, 0);
    vector<vi> Queries(n + 2);
    for(int i = 0; i < q; ++i)
        Queries[P[i]].push_back(i);
    vector<vEd> Add(n + 1);
    for(auto &[f, t, b, e] : edges)
        Add[t].push_back({f, t, b, e});
    for(int i = 0; i < n; ++i) {
        for(auto &it : Add[i])
            for(auto &seg : Sol) seg.add_edge(it);
        for(auto &qid : Queries[i]) {
            int w = W[qid];
            int re = 0;
            for(auto &seg : Sol) {
                if(seg.begin <= w && w <= seg.end) {
                    re = seg.query(w);
                    break;
                }
            }
            R[qid] = i + 1 - re;
        }
    }
}

vector<int> simulateCollapse(
	int n,
	vector<int> T,
	vector<int> X,
	vector<int> Y,
	vector<int> W,
	vector<int> P
) {
    vEd edges;
    int c = T.size(), q = W.size();
    map<pair<int, int>, int> enabled;
    for(int i = 0 ; i < c; ++i)
        if(X[i] > Y[i]) swap(X[i], Y[i]);
    for(int i = 0 ; i < c; ++i) {
        if(!T[i])
            enabled[{X[i], Y[i]}] = i;
        else {
            edges.push_back({X[i], Y[i], enabled[{X[i], Y[i]}], i - 1});
            enabled[{X[i], Y[i]}] = -1;
        }
    }
    for(auto [p, e] : enabled) if(e != -1) {
        auto [f, t] = p;
        edges.push_back({f, t, e, c + 1});
    }

    int bucketSize = int(sqrt(c + 1));
    for(int lp = 0; lp <= c + 1; lp += bucketSize)
        Sol.emplace_back(n, lp, lp + bucketSize - 1);
    vector<int> R, R1, R2;
    solve(n, c, q, edges, W, P, R1);
    for(auto &it : P) it = n - 2 - it;
    for(auto &[a, b, c, d] : edges)
        a = n - 1 - a, b = n - 1 - b, a ^= b, b ^= a, a ^= b;
    for(auto &seg : Sol) seg.clear();
    solve(n, c, q, edges, W, P, R2);
    for(int i = 0; i < q; ++i) R.push_back(R1[i] + R2[i]);
    return R;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 956 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 15 ms 1584 KB Output is correct
7 Correct 3 ms 980 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 12 ms 5964 KB Output is correct
10 Correct 33 ms 6080 KB Output is correct
11 Correct 51 ms 6204 KB Output is correct
12 Correct 364 ms 6228 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 3708 KB Output is correct
2 Correct 30 ms 3652 KB Output is correct
3 Correct 177 ms 9412 KB Output is correct
4 Correct 42 ms 3612 KB Output is correct
5 Correct 350 ms 10552 KB Output is correct
6 Correct 69 ms 4632 KB Output is correct
7 Correct 633 ms 25704 KB Output is correct
8 Correct 469 ms 49236 KB Output is correct
9 Correct 39 ms 10692 KB Output is correct
10 Correct 42 ms 14384 KB Output is correct
11 Correct 102 ms 54268 KB Output is correct
12 Correct 973 ms 412932 KB Output is correct
13 Execution timed out 15078 ms 414536 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 3524 KB Output is correct
2 Correct 33 ms 3320 KB Output is correct
3 Correct 34 ms 3276 KB Output is correct
4 Correct 33 ms 3336 KB Output is correct
5 Correct 58 ms 3664 KB Output is correct
6 Correct 80 ms 4768 KB Output is correct
7 Correct 587 ms 21452 KB Output is correct
8 Execution timed out 15031 ms 71192 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 956 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 15 ms 1584 KB Output is correct
7 Correct 3 ms 980 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 12 ms 5964 KB Output is correct
10 Correct 33 ms 6080 KB Output is correct
11 Correct 51 ms 6204 KB Output is correct
12 Correct 364 ms 6228 KB Output is correct
13 Correct 29 ms 3708 KB Output is correct
14 Correct 30 ms 3652 KB Output is correct
15 Correct 177 ms 9412 KB Output is correct
16 Correct 42 ms 3612 KB Output is correct
17 Correct 350 ms 10552 KB Output is correct
18 Correct 69 ms 4632 KB Output is correct
19 Correct 633 ms 25704 KB Output is correct
20 Correct 469 ms 49236 KB Output is correct
21 Correct 39 ms 10692 KB Output is correct
22 Correct 42 ms 14384 KB Output is correct
23 Correct 102 ms 54268 KB Output is correct
24 Correct 973 ms 412932 KB Output is correct
25 Execution timed out 15078 ms 414536 KB Time limit exceeded
26 Halted 0 ms 0 KB -