oj.uz

답안 #521102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521102 2022-01-31T18:11:43 Z blue Inside information (BOI21_servers) C++17
65 / 100
 3500 ms 32604 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) int(x.size())
 
const int mx = 120'000;
 
 
 
 
struct edge
{
    int v;
    int t;
};
 
vector<edge> S[1+mx];
 
 
 
 
 
struct query
{
    int a;
    int t;
};
 
vector<query> Q[1+mx]; //stored by d
 
 
 
 
 
vector<int> C[1+mx]; //stored by d
 
 
 
int N, K;
 
vi res(2*mx + 5);
 
 
 
 
 
 
 
 
 
 
 
 
vi banned(1+mx, 0);
 
vi st_count(1+mx, 0);
 
vi lst;
 
 
 
 
void dfs(int u, int p)
{
    lst.push_back(u);
 
    st_count[u] = 1;
    for(auto e: S[u])
    {
        int v = e.v;
        if(v == p) continue;
 
        if(banned[v]) continue;
 
        dfs(v, u);
        st_count[u] += st_count[v];
    }
}
 
 
vi out_good(1+mx); //going out from centroid
vi in_good(1+mx); //coming in to centroid
vi root_time(1+mx);
vi par_time(1+mx);
 
 
vi st_index(1+mx);
 
vi exists(1+mx, 0);
 
 
 
void dfs2(int u, int p)
{
    for(auto e: S[u])
    {
        int v = e.v;
        int t = e.t;
 
        if(v == p) continue;
 
        if(banned[v]) continue;
 
        root_time[v] = root_time[u];
        par_time[v] = t;
 
        out_good[v] = out_good[u] && (par_time[v] > par_time[u]);
        in_good[v] = in_good[u] && (par_time[v] < par_time[u]);
 
        st_index[v] = st_index[u];
 
        dfs2(v, u);
    }
}
 
 
vector<pii> obj_list;
 
vi BIT(1+mx, 0);
 
 
void solve(int src)
{
    lst.clear();
 
    dfs(src, src);
 
    int cent = -1;
 
 
    for(int u: lst)
    {
        exists[u] = 1;
 
        if(2 * st_count[u] < st_count[src]) continue;
 
        if(cent == -1) cent = u;
        else if(st_count[u] < st_count[cent]) cent = u;
    }
 
 
    // cerr << "\n\n\n\n";
    // for(int l: lst) cerr << l << ' ';
    // cerr << ": centroid = " << cent << '\n';
 
    // for(int l: lst) cerr << l << " : " << out_good[l] << ' ' << in_good[l] << ' ' << root_time[l] << ' ' << par_time[l] << '\n';
 
 
    int stid = 0;
    st_index[cent] = 0;
 
    in_good[cent] = 1;
    out_good[cent] = 1;
 
    for(auto e: S[cent])
    {
        int v = e.v;
        int t = e.t;
 
        if(banned[v]) continue;
 
        st_index[v] = ++stid;
        in_good[v] = out_good[v] = 1;
        root_time[v] = par_time[v] = t;
 
        dfs2(v, cent);
    }
 
 
 
    for(int d: lst)
    {
        for(query qr: Q[d])
        {
            int a = qr.a;
            int t = qr.t;
 
            if(!exists[a]) continue;
 
            if(d == cent)
            {
                if(a == cent)
                    res[t] = 1;
                else 
                    res[t] |= (out_good[a] && par_time[a] < t);
            }
            else
            {
                if(a == cent)
                    res[t] |= (in_good[d] && root_time[d] < t);
                else
                    res[t] |= (in_good[d] && out_good[a] && root_time[d] < root_time[a] && par_time[a] < t);
            }
        }
    }
 
 
 
    vector<pii> queries, updates;
 
    root_time[cent] = 0;
 
    for(int d: lst)
    {
        if(in_good[d] == 0) continue;
 
        for(int t: C[d])
        {
            if(root_time[d] > t) continue;
 
            queries.push_back({root_time[d], t});
        }
    }
 
    for(int a: lst)
    {
        if(out_good[a] == 0) continue;
 
        if(a == cent) continue;
 
        updates.push_back({root_time[a], par_time[a]});
    }
 
    sort(queries.begin(), queries.end(), [] (pii u, pii v)
    {
        return u.first > v.first;
    });
    sort(updates.begin(), updates.end(), [] (pii u, pii v)
    {
        return u.first > v.first;
    });
 
    int ui = -1;
 
    BIT = vi(N+K, 0);
 
    for(pii z: queries)
    {
        while(ui+1 < sz(updates) && updates[ui+1].first > z.first)
        {
            ui++;
            for(int q = updates[ui].second; q <= N+K-1; q += q&-q)
                BIT[q]++;
        }
 
        res[z.second]++;
        for(int q = z.second-1; q >= 1; q -= q&-q)
            res[z.second] += BIT[q];
    }

    while(ui >= 0)
    {
        for(int q = updates[ui].second; q <= N+K-1; q += q&-q)
            BIT[q]--;
        ui--;
    }
 
    // vi BIT(N+K, 0);
 
    // for(pii z: obj)
    // {
    //     if(z.second > 0) //count query
    //     {
    //         int t = z.second;
    //         res[t]++; //centroid
 
    //         for(int q = t-1; q >= 1; q -= q&-q)
    //             res[t] += BIT[q];
    //     }
    //     else //node
    //     {
    //         int t = -z.second;
 
    //         for(int q = t; q <= N+K-1; q += q&-q)
    //             BIT[q]++;
    //     }
    // }
 
 
 
 
 
 
 
 
 
    for(int u: lst) exists[u] = 0;
 
    banned[cent] = 1;
 
    for(auto e: S[cent])
    {
        if(banned[e.v]) continue;
        solve(e.v);
    }
 
 
    banned[cent] = 0;
 
    
}
 
 
 
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
    cin >> N >> K;
 
    char c[N+K];
 
    for(int q = 1; q <= N+K-1; q++)
    {
        cin >> c[q];
        if(c[q] == 'S')
        {
            int a, b;
            cin >> a >> b;
            S[a].push_back({b, q});
            S[b].push_back({a, q});
        }
        else if(c[q] == 'Q')
        {
            int a, d;
            cin >> a >> d;
            Q[d].push_back({a, q});
        }
        else
        {
            int d;
            cin >> d;
 
            C[d].push_back(q);
        }
    }
 
 
 
 
    solve(1);
 
 
 
 
    for(int q = 1; q <= N+K-1; q++)
    {
        if(c[q] == 'S') continue;
        else if(c[q] == 'Q')
        {
            if(res[q] == 1) cout << "yes\n";
            else cout << "no\n";
        }
        else cout << res[q] << '\n';
    }
}

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 16352 KB Output is correct
2 Correct 103 ms 16672 KB Output is correct
3 Correct 89 ms 16580 KB Output is correct
4 Correct 112 ms 16740 KB Output is correct
5 Correct 111 ms 16956 KB Output is correct
6 Correct 101 ms 16856 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 16352 KB Output is correct
2 Correct 103 ms 16672 KB Output is correct
3 Correct 89 ms 16580 KB Output is correct
4 Correct 112 ms 16740 KB Output is correct
5 Correct 111 ms 16956 KB Output is correct
6 Correct 101 ms 16856 KB Output is correct
7 Correct 29 ms 16424 KB Output is correct
8 Correct 120 ms 16548 KB Output is correct
9 Correct 112 ms 16968 KB Output is correct
10 Correct 110 ms 16656 KB Output is correct
11 Correct 114 ms 16964 KB Output is correct
12 Correct 98 ms 17096 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 16348 KB Output is correct
2 Correct 3362 ms 24896 KB Output is correct
3 Correct 3137 ms 24940 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 16348 KB Output is correct
2 Correct 3362 ms 24896 KB Output is correct
3 Correct 3137 ms 24940 KB Output is correct
4 Correct 32 ms 16448 KB Output is correct
5 Correct 2886 ms 25044 KB Output is correct
6 Correct 2821 ms 24416 KB Output is correct
7 Correct 3036 ms 24520 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16412 KB Output is correct
2 Correct 3137 ms 31076 KB Output is correct
3 Execution timed out 3584 ms 30732 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16412 KB Output is correct
2 Correct 3137 ms 31076 KB Output is correct
3 Execution timed out 3584 ms 30732 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16396 KB Output is correct
2 Correct 3249 ms 25048 KB Output is correct
3 Correct 3463 ms 24560 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16396 KB Output is correct
2 Correct 3249 ms 25048 KB Output is correct
3 Correct 3463 ms 24560 KB Output is correct
4 Correct 32 ms 16372 KB Output is correct
5 Correct 3335 ms 25668 KB Output is correct
6 Correct 3378 ms 24560 KB Output is correct

Subtask #9
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16412 KB Output is correct
2 Execution timed out 3528 ms 30684 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16412 KB Output is correct
2 Execution timed out 3528 ms 30684 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16404 KB Output is correct
2 Correct 107 ms 16660 KB Output is correct
3 Correct 83 ms 16624 KB Output is correct
4 Correct 118 ms 16740 KB Output is correct
5 Correct 101 ms 17052 KB Output is correct
6 Correct 87 ms 16784 KB Output is correct
7 Correct 28 ms 16440 KB Output is correct
8 Correct 3172 ms 24932 KB Output is correct
9 Correct 3013 ms 24872 KB Output is correct
10 Correct 33 ms 16368 KB Output is correct
11 Correct 3342 ms 31072 KB Output is correct
12 Correct 3499 ms 31064 KB Output is correct
13 Correct 3277 ms 30580 KB Output is correct
14 Correct 46 ms 16404 KB Output is correct
15 Correct 3383 ms 24940 KB Output is correct
16 Correct 3237 ms 24560 KB Output is correct
17 Correct 3322 ms 25792 KB Output is correct
18 Correct 3055 ms 25420 KB Output is correct
19 Correct 3273 ms 29024 KB Output is correct
20 Correct 3126 ms 27532 KB Output is correct
21 Correct 3384 ms 24764 KB Output is correct
22 Correct 2839 ms 25000 KB Output is correct
23 Correct 3251 ms 25212 KB Output is correct
24 Correct 3072 ms 25068 KB Output is correct
25 Correct 3236 ms 28432 KB Output is correct
26 Correct 3071 ms 24096 KB Output is correct
27 Correct 2986 ms 23220 KB Output is correct

Subtask #12
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16404 KB Output is correct
2 Correct 107 ms 16660 KB Output is correct
3 Correct 83 ms 16624 KB Output is correct
4 Correct 118 ms 16740 KB Output is correct
5 Correct 101 ms 17052 KB Output is correct
6 Correct 87 ms 16784 KB Output is correct
7 Correct 28 ms 16440 KB Output is correct
8 Correct 3172 ms 24932 KB Output is correct
9 Correct 3013 ms 24872 KB Output is correct
10 Correct 33 ms 16368 KB Output is correct
11 Correct 3342 ms 31072 KB Output is correct
12 Correct 3499 ms 31064 KB Output is correct
13 Correct 3277 ms 30580 KB Output is correct
14 Correct 46 ms 16404 KB Output is correct
15 Correct 3383 ms 24940 KB Output is correct
16 Correct 3237 ms 24560 KB Output is correct
17 Correct 3322 ms 25792 KB Output is correct
18 Correct 3055 ms 25420 KB Output is correct
19 Correct 3273 ms 29024 KB Output is correct
20 Correct 3126 ms 27532 KB Output is correct
21 Correct 3384 ms 24764 KB Output is correct
22 Correct 2839 ms 25000 KB Output is correct
23 Correct 3251 ms 25212 KB Output is correct
24 Correct 3072 ms 25068 KB Output is correct
25 Correct 3236 ms 28432 KB Output is correct
26 Correct 3071 ms 24096 KB Output is correct
27 Correct 2986 ms 23220 KB Output is correct
28 Correct 31 ms 16704 KB Output is correct
29 Correct 90 ms 16816 KB Output is correct
30 Correct 91 ms 16888 KB Output is correct
31 Correct 90 ms 16664 KB Output is correct
32 Correct 101 ms 16976 KB Output is correct
33 Correct 87 ms 17108 KB Output is correct
34 Correct 30 ms 16736 KB Output is correct
35 Correct 2746 ms 25292 KB Output is correct
36 Correct 2646 ms 24428 KB Output is correct
37 Correct 2724 ms 24548 KB Output is correct
38 Correct 29 ms 16668 KB Output is correct
39 Correct 3044 ms 31592 KB Output is correct
40 Correct 2771 ms 32604 KB Output is correct
41 Correct 2948 ms 31204 KB Output is correct
42 Correct 3114 ms 31148 KB Output is correct
43 Correct 28 ms 16724 KB Output is correct
44 Correct 2819 ms 25916 KB Output is correct
45 Correct 3123 ms 24844 KB Output is correct
46 Correct 3027 ms 25996 KB Output is correct
47 Correct 2991 ms 25932 KB Output is correct
48 Correct 3366 ms 27852 KB Output is correct
49 Correct 3354 ms 28676 KB Output is correct
50 Correct 3218 ms 27888 KB Output is correct
51 Correct 2738 ms 24224 KB Output is correct
52 Correct 2666 ms 24260 KB Output is correct
53 Correct 2670 ms 23856 KB Output is correct
54 Correct 2818 ms 24256 KB Output is correct
55 Correct 2662 ms 23992 KB Output is correct
56 Correct 3052 ms 23952 KB Output is correct
57 Correct 2868 ms 28016 KB Output is correct
58 Correct 2918 ms 24592 KB Output is correct
59 Correct 2840 ms 23072 KB Output is correct