oj.uz

답안 #366465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366465 2021-02-14T08:46:04 Z idk321 동기화 (JOI13_synchronization) C++11
100 / 100
 451 ms 25080 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 100005;
vector<int> adj[N];
array<int, 2> edge[N];
int timer = 0;
int tin[N];
int tout[N];
int anc[N][20];
int info[N];
int bit[N];

void addNum(int pos, int num)
{
    for (int i = pos; i < N; i = i | (i + 1)) bit[i] += num;
}

int getSum(int pos)
{
    int sum = 0;
    for (int i = pos; i >= 0; i = (i &(i + 1)) - 1 ) sum += bit[i];

    return sum;
}

void dfs(int node, int par)
{
    tin[node] = timer;
    timer++;
    anc[node][0] = par;
    for (int i = 1; i < 20; i++)
    {
        if (anc[node][i - 1] == -1)
        {
            anc[node][i] = -1;
        } else
        {
            anc[node][i] = anc[anc[node][i - 1]][i - 1];
        }
    }

    for (int next : adj[node])
    {
        if (next == par) continue;
        dfs(next, node);
    }
    tout[node] = timer;
}

int getRoot(int node)
{
    for (int i = 19; i >= 0; i--)
    {
        if (anc[node][i] != -1 && getSum(tin[anc[node][i]]) == getSum(tin[node])) node = anc[node][i];
    }
    return node;
}


int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 1; i < n; i++)
    {
        int x, y;
        cin >> x >> y;
        edge[i] = {x, y};
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    dfs(1, -1);
    vector<int> change(m);
    for (int i = 0; i < m; i++) cin >> change[i];
    bool exist[N] = {};
    int passed[N] = {};


    for (int i = 1; i <= n; i++)
    {
        info[i] = 1;
        addNum(tin[i], 1);
        addNum(tout[i], -1);
    }


    for (int i = 0; i < m; i++)
    {
        int e = change[i];
        int a = edge[e][0];
        int b = edge[e][1];
        if (anc[a][0] == b) swap(a, b);
        if (exist[e])
        {
            a = getRoot(a);
            info[b] = info[a];
            passed[e] = info[a];
            addNum(tin[b], 1);
            addNum(tout[b], -1);
        } else
        {
            a = getRoot(a);
            b = getRoot(b);
            info[a] = info[b] + info[a] - passed[e];
            info[b] = 0;
            passed[e] = info[b] + info[a] - passed[e];
            addNum(tin[b], -1);
            addNum(tout[b], 1);
        }

        exist[e] = !exist[e];
    }

    for (int q1 = 0; q1 < q; q1++)
    {

        int c;
        cin >> c;
        c = getRoot(c);
        cout << info[c] << "\n";
    }

}

/*
5 6 3
1 2
1 3
2 4
2 5
1
2
1
4
4
3
1
4
5
*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3180 KB Output is correct
2 Correct 2 ms 3180 KB Output is correct
3 Correct 2 ms 3180 KB Output is correct
4 Correct 2 ms 3180 KB Output is correct
5 Correct 2 ms 3180 KB Output is correct
6 Correct 3 ms 3436 KB Output is correct
7 Correct 17 ms 4844 KB Output is correct
8 Correct 16 ms 4844 KB Output is correct
9 Correct 16 ms 4844 KB Output is correct
10 Correct 261 ms 19692 KB Output is correct
11 Correct 256 ms 19692 KB Output is correct
12 Correct 344 ms 24300 KB Output is correct
13 Correct 104 ms 19556 KB Output is correct
14 Correct 188 ms 18668 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 19820 KB Output is correct
2 Correct 141 ms 19564 KB Output is correct
3 Correct 176 ms 21612 KB Output is correct
4 Correct 201 ms 23276 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3180 KB Output is correct
2 Correct 2 ms 3180 KB Output is correct
3 Correct 2 ms 3308 KB Output is correct
4 Correct 3 ms 3308 KB Output is correct
5 Correct 2 ms 3308 KB Output is correct
6 Correct 4 ms 3436 KB Output is correct
7 Correct 27 ms 5356 KB Output is correct
8 Correct 407 ms 25080 KB Output is correct
9 Correct 407 ms 25068 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 410 ms 22124 KB Output is correct
2 Correct 260 ms 24300 KB Output is correct
3 Correct 260 ms 24428 KB Output is correct
4 Correct 260 ms 24556 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3180 KB Output is correct
2 Correct 2 ms 3180 KB Output is correct
3 Correct 2 ms 3180 KB Output is correct
4 Correct 2 ms 3180 KB Output is correct
5 Correct 4 ms 3436 KB Output is correct
6 Correct 21 ms 4972 KB Output is correct
7 Correct 311 ms 20588 KB Output is correct
8 Correct 451 ms 25052 KB Output is correct
9 Correct 152 ms 20708 KB Output is correct
10 Correct 220 ms 19948 KB Output is correct
11 Correct 177 ms 23148 KB Output is correct
12 Correct 178 ms 23020 KB Output is correct
13 Correct 265 ms 24556 KB Output is correct