oj.uz

답안 #1082597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1082597 2024-08-31T17:05:58 Z steveonalex 동기화 (JOI13_synchronization) C++17
100 / 100
 277 ms 27048 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1e5 + 69, LOG_N = 17;

int n, m, q;
int sum1[N], sum2[N];
vector<int> graph[N];
int h[N], parent[N][LOG_N], in[N], out[N];

struct FenwickTree{
    int n; 
    vector<int> a;

    FenwickTree(int _n){
        n = _n;
        a.resize(n+1);
    }

    void update(int i, int v){
        while(i <= n){
            a[i] += v;
            i += LASTBIT(i);
        }
    }

    void update(int l, int r, int v){
        update(l, v); update(r+1, -v);
    }

    int get(int i){
        int ans = 0;
        while(i > 0){
            ans += a[i];
            i -= LASTBIT(i);
        }
        return ans;
    }
};

void dfs(int u, int p){
    h[u] = h[p] + 1;
    in[u] = out[u] = ++in[0];
    for(int j = 1; MASK(j) < h[u]; ++j) 
        parent[u][j] = parent[parent[u][j-1]][j-1];
    for(int v: graph[u]) if (v != p){
        parent[v][0] = u;
        dfs(v, u);
        maximize(out[u], out[v]);
    }
}

int get_father(int u, FenwickTree &bit){
    int cu = bit.get(in[u]);
    for(int j = LOG_N - 1; j>=0; --j) if (parent[u][j] != 0){
        int v = parent[u][j];
        if (bit.get(in[v]) == cu) u = v;
    }
    return u;
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    cin >> n >> m >> q;
    vector<pair<int, int>> edge = {{0, 0}};
    for(int i = 1; i<n; ++i){
        int u, v; cin >> u >> v;
        edge.push_back({u, v});
        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    dfs(1, 0);

    for(pair<int, int> &i: edge) if (h[i.first] > h[i.second]) swap(i.first, i.second);

    FenwickTree bit(n);
    for(int i = 1; i<=n; ++i) {
        bit.update(in[i], out[i], 1);
        sum1[i] = sum2[i] = 1;
    }

    vector<int> exist(n);
    while(m--){
        int x; cin >> x;
        int u, v;
        tie(u, v) = edge[x];
        if (exist[x]){
            u = get_father(u, bit);
            sum2[v] = sum2[u];
            sum1[v] = 0;
            bit.update(in[v], out[v], 1);
        }
        else{
            u = get_father(u, bit), v = get_father(v, bit);
            sum2[u] += sum1[v];
            sum1[u] += sum1[v];
            bit.update(in[v], out[v], -1);
        }
        exist[x] ^= 1;
    }
    cout << "\n";
    while(q--){
        int x; cin >> x;
        x = get_father(x, bit);
        cout << sum2[x] << "\n";
    }

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 11 ms 4376 KB Output is correct
8 Correct 10 ms 4188 KB Output is correct
9 Correct 10 ms 4184 KB Output is correct
10 Correct 124 ms 18372 KB Output is correct
11 Correct 132 ms 18372 KB Output is correct
12 Correct 227 ms 26056 KB Output is correct
13 Correct 60 ms 18376 KB Output is correct
14 Correct 87 ms 17856 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 22208 KB Output is correct
2 Correct 92 ms 21960 KB Output is correct
3 Correct 109 ms 25544 KB Output is correct
4 Correct 116 ms 25540 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 3 ms 2908 KB Output is correct
7 Correct 17 ms 5204 KB Output is correct
8 Correct 264 ms 26868 KB Output is correct
9 Correct 263 ms 26820 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 264 ms 27048 KB Output is correct
2 Correct 163 ms 26560 KB Output is correct
3 Correct 155 ms 26820 KB Output is correct
4 Correct 157 ms 26816 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 13 ms 4468 KB Output is correct
7 Correct 157 ms 19400 KB Output is correct
8 Correct 277 ms 26824 KB Output is correct
9 Correct 75 ms 19392 KB Output is correct
10 Correct 106 ms 19140 KB Output is correct
11 Correct 136 ms 23240 KB Output is correct
12 Correct 119 ms 23236 KB Output is correct
13 Correct 170 ms 26816 KB Output is correct