oj.uz

답안 #387466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
387466 2021-04-08T12:56:13 Z jeroenodb 동기화 (JOI13_synchronization) C++14
50 / 100
 306 ms 23392 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x),end(x)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5;
const ll oo = 1e18;
namespace hld {
    int n;
    int chain[mxN],sz[mxN], parent[mxN],in[mxN], info[mxN], uploaded[mxN] = {};
    // vector<edge> edges;
    vi adj[mxN];
    vector<pi> edges;
    set<int,greater<int>> sets[mxN];
    int cnt = 0;
    void dfs(int at=0, int path=-1) {
        int min = in[at] = cnt++;
        chain[min] = (path==-1)?min:path;
        sets[chain[min]].insert(min);
        if(adj[at].empty()) 
            return;
        int mx=-2,heavy = -1;
        for(int to: adj[at]) {
            if(sz[to] > mx) {
                mx = sz[to];
                heavy=to;
            } 
        }
        assert(heavy!=-1);
        dfs(heavy,chain[min]);
        for(int to: adj[at]) {
            if(to!=heavy)
                dfs(to);
        }
    }
    void addedge(int a,int b) {
        // edges.push_back({a,b,c});
        adj[a].push_back(b);
        adj[b].push_back(a);
        edges.emplace_back(a,b);
    }
    void init(int nn) {
        n=nn;
        fill(sz, sz+n, 1);
        fill(parent, parent+n,-1);
        fill(info, info+n,1);
        vector<pi> q; q.reserve(n); q.emplace_back(0,-1);
        // Graph must be a tree
        // Do a bfs on nodes
        for(int i=0;i<(int)q.size();++i) {
            int at,from; tie(at,from) = q[i];
            for(int j=0;j<(int)adj[at].size();++j) {
                int& to = adj[at][j];
                if(to!=from) {
                    parent[to] = at;
                    q.emplace_back(to,at);
                } else {
                    swap(to,adj[at].back());
                    adj[at].pop_back();
                    j--;
                }
            }
        }
        assert(q.size()==n);
        for(int i=n-1;i>=0;--i) {
            int at = q[i].first;
            for(int to: adj[at]) 
                sz[at]+=sz[to];
        }
        dfs();
    }
    auto root(int at) { // at = in[node]
        while(chain[at]!=0) {
            if(!sets[chain[at]].empty() and *sets[chain[at]].rbegin() <= at) {
                break;
            }
            at = parent[chain[at]];
        }
        return *sets[chain[at]].lower_bound(at);
    }
    bool update(int i) {
        auto [iter,good] = sets[chain[i]].insert(i);
        if(!good) {
            sets[chain[i]].erase(iter);
        }
        return good;
    }
};
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n,m,q; cin >> n >> m >> q;
    for(int i=0;i<n-1;++i) {
        int a,b; cin >> a >> b;
        hld::addedge(a-1,b-1);
    }
    hld::init(n);
    
    while(m--) {
        using namespace hld;
        int eid; cin >> eid; eid--;
        auto [a,b] = edges[eid];
        a = in[a], b = in[b];
        if(a>b) swap(a,b);
        if(!update(b)) {
            info[root(a)]+=info[b]-uploaded[b];
        } else {
            uploaded[b] = info[b] = info[root(a)];
        }
    }

    while(q--) {
        using namespace hld;
        int c; cin >> c; c = in[c-1];
        cout << info[root(c)] << '\n';
    }
    return 0;
}

Compilation message

In file included from /usr/include/c++/9/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:33,
                 from synchronization.cpp:1:
synchronization.cpp: In function 'void hld::init(int)':
synchronization.cpp:66:24: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   66 |         assert(q.size()==n);
      |                ~~~~~~~~^~~
synchronization.cpp: In function 'bool hld::update(int)':
synchronization.cpp:84:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   84 |         auto [iter,good] = sets[chain[i]].insert(i);
      |              ^
synchronization.cpp: In function 'int main()':
synchronization.cpp:105:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  105 |         auto [a,b] = edges[eid];
      |              ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Incorrect 5 ms 7404 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 21276 KB Output is correct
2 Correct 83 ms 21088 KB Output is correct
3 Correct 88 ms 23392 KB Output is correct
4 Correct 90 ms 23392 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 7 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 21 ms 9068 KB Output is correct
8 Correct 306 ms 23392 KB Output is correct
9 Correct 300 ms 23392 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 306 ms 23392 KB Output is correct
2 Correct 106 ms 23264 KB Output is correct
3 Correct 107 ms 23392 KB Output is correct
4 Correct 110 ms 23392 KB Output is correct

Subtask #5
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Incorrect 5 ms 7404 KB Output isn't correct
4 Halted 0 ms 0 KB -