oj.uz

Submission #780094

# Submission time Handle Problem Language Result Execution time Memory
780094 2023-07-12T06:38:06 Z khanhphucscratch Factories (JOI14_factories) C++14
100 / 100
 3148 ms 339836 KB 
#include<bits/stdc++.h>
#include "factories.h"
using namespace std;
vector<long long> ad[500001], c[500001], ad2[500001], c2[500001];
long long n, type[500001], tin[500001], tout[500001], sparse[20][1000002], h[500001], dis[500001], lg2[1000003], appear[500001], ganl[500001], ganr[500001], dfsc = 0, cur = 0;
bool visited[500001];
void dfs(int u)
{
    tin[u] = ++dfsc;
    visited[u] = 1;
    sparse[0][++cur] = u;
    appear[u] = cur;
    for(int i = 0; i < ad[u].size(); i++) if(visited[ad[u][i]] == 0){
        int v = ad[u][i];
        h[v] = h[u] + 1;
        dis[v] = dis[u] + c[u][i];
        dfs(v);
        sparse[0][++cur] = u;
    }
    tout[u] = dfsc;
}
void preprocess()
{
    for(int i = 1; i < 20; i++){
        for(int j = 1; j + (1 << (i-1)) <= cur; j++){
            int k = j + (1 << (i-1));
            if(h[sparse[i-1][j]] < h[sparse[i-1][k]]) sparse[i][j] = sparse[i-1][j];
            else sparse[i][j] = sparse[i-1][k];
            //cout<<i<<" "<<j<<" "<<sparse[i][j]<<endl;
        }
    }
}
int lca(int u, int v)
{
    int l = appear[u], r = appear[v];
    if(l > r) swap(l, r);
    int x = lg2[r-l+1];
    if(h[sparse[x][l]] < h[sparse[x][r-(1 << x)+1]]) return sparse[x][l];
    else return sparse[x][r-(1 << x)+1];
}
bool cmp(int u, int v)
{
    return tin[u] < tin[v];
}
bool ancestor(int u, int v)
{
    return (tin[u] <= tin[v] && tout[u] >= tout[v]);
}
void Init(int N, int a[], int b[], int d[])
{
    n = N;
    for(int i = 0; i < n; i++){a[i]++; b[i]++;}
    for(int i = 0; i < n-1; i++){
        ad[a[i]].push_back(b[i]);
        ad[b[i]].push_back(a[i]);
        c[a[i]].push_back(d[i]);
        c[b[i]].push_back(d[i]);
    }
    h[0] = 1e18;
    dfs(1);
    preprocess();
    for(int i = 2; i <= 2*n; i++){
        if((1 << lg2[i-1])*2 > i) lg2[i] = lg2[i-1];
        else lg2[i] = lg2[i-1]+1;
    }
    for(int i = 1; i <= n; i++){
        visited[i] = 0; ganl[i] = 1e18; ganr[i] = 1e18;
    }
}
void dfsdp(int u)
{
    visited[u] = 1;
    ganl[u] = 1e18; ganr[u] = 1e18;
    if(type[u] == 1) ganl[u] = 0;
    if(type[u] == 2) ganr[u] = 0;
    for(int i = 0; i < ad2[u].size(); i++) if(visited[ad2[u][i]] == 0){
        int v = ad2[u][i];
        dfsdp(v);
        ganl[u] = min(ganl[u], ganl[v] + c2[u][i]);
        ganr[u] = min(ganr[u], ganr[v] + c2[u][i]);
    }
    visited[u] = 0;
}
long long Query(int s, int x[], int t, int y[])
{
    vector<int> st; //build virtual tree
    for(int i = 0; i < s; i++){
        x[i]++;
        st.push_back(x[i]);
        type[x[i]] = 1;
    }
    for(int i = 0; i < t; i++){
        y[i]++;
        st.push_back(y[i]);
        type[y[i]] = 2;
    }
    sort(st.begin(), st.end(), cmp);
    for(int i = 0; i < s+t-1; i++){
        int node = lca(st[i], st[i+1]);
        if(node != st[i] && node != st[i+1]) st.push_back(node);
    }
    sort(st.begin(), st.end(), cmp);
    stack<int> wtf;
    for(int u : st){
        while(wtf.size() > 0 && ancestor(wtf.top(), u) == 0) wtf.pop();
        if(wtf.size() > 0){
            ad2[u].push_back(wtf.top());
            ad2[wtf.top()].push_back(u);
            c2[u].push_back(dis[u] - dis[wtf.top()]);
            c2[wtf.top()].push_back(dis[u] - dis[wtf.top()]);
        }
        wtf.push(u);
    }
    int root = st[0];
    dfsdp(root);
    long long ans = 1e18;
    for(int u : st){
        ans = min(ans, (long long)ganl[u] + ganr[u]);
        type[u] = 0; ad2[u].clear(); c2[u].clear(); ganl[u] = 1e18; ganr[u] = 1e18;
    }
    return ans;
}
/*int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    cin>>n>>q;
    int u[n-1], v[n-1], cost[n-1];
    for(int i = 0; i < n-1; i++) cin>>u[i]>>v[i]>>cost[i];
    Init(n, u, v, cost);
    for(int test = 0; test < q; test++){
        int a, b;
        cin>>a>>b;
        int l[a], r[b];
        for(int i = 0; i < a; i++) cin>>l[i];
        for(int i = 0; i < b; i++) cin>>r[i];
        cout<<Query(a, l, b, r)<<'\n';
    }
}*/

Compilation message

factories.cpp: In function 'void dfs(int)':
factories.cpp:13:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i = 0; i < ad[u].size(); i++) if(visited[ad[u][i]] == 0){
      |                    ~~^~~~~~~~~~~~~~
factories.cpp: In function 'void dfsdp(int)':
factories.cpp:76:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for(int i = 0; i < ad2[u].size(); i++) if(visited[ad2[u][i]] == 0){
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 47816 KB Output is correct
2 Correct 685 ms 57820 KB Output is correct
3 Correct 646 ms 58628 KB Output is correct
4 Correct 657 ms 58660 KB Output is correct
5 Correct 658 ms 58992 KB Output is correct
6 Correct 529 ms 59060 KB Output is correct
7 Correct 673 ms 58916 KB Output is correct
8 Correct 707 ms 58960 KB Output is correct
9 Correct 663 ms 58992 KB Output is correct
10 Correct 541 ms 59020 KB Output is correct
11 Correct 677 ms 58844 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47624 KB Output is correct
2 Correct 1525 ms 317584 KB Output is correct
3 Correct 1671 ms 318544 KB Output is correct
4 Correct 1265 ms 318924 KB Output is correct
5 Correct 1556 ms 338452 KB Output is correct
6 Correct 1754 ms 320552 KB Output is correct
7 Correct 1123 ms 108028 KB Output is correct
8 Correct 907 ms 108668 KB Output is correct
9 Correct 909 ms 110692 KB Output is correct
10 Correct 1192 ms 109272 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 47816 KB Output is correct
2 Correct 685 ms 57820 KB Output is correct
3 Correct 646 ms 58628 KB Output is correct
4 Correct 657 ms 58660 KB Output is correct
5 Correct 658 ms 58992 KB Output is correct
6 Correct 529 ms 59060 KB Output is correct
7 Correct 673 ms 58916 KB Output is correct
8 Correct 707 ms 58960 KB Output is correct
9 Correct 663 ms 58992 KB Output is correct
10 Correct 541 ms 59020 KB Output is correct
11 Correct 677 ms 58844 KB Output is correct
12 Correct 24 ms 47624 KB Output is correct
13 Correct 1525 ms 317584 KB Output is correct
14 Correct 1671 ms 318544 KB Output is correct
15 Correct 1265 ms 318924 KB Output is correct
16 Correct 1556 ms 338452 KB Output is correct
17 Correct 1754 ms 320552 KB Output is correct
18 Correct 1123 ms 108028 KB Output is correct
19 Correct 907 ms 108668 KB Output is correct
20 Correct 909 ms 110692 KB Output is correct
21 Correct 1192 ms 109272 KB Output is correct
22 Correct 2870 ms 331740 KB Output is correct
23 Correct 2695 ms 331904 KB Output is correct
24 Correct 3148 ms 332348 KB Output is correct
25 Correct 3027 ms 334532 KB Output is correct
26 Correct 2696 ms 325652 KB Output is correct
27 Correct 2853 ms 339836 KB Output is correct
28 Correct 1981 ms 330812 KB Output is correct
29 Correct 2569 ms 324568 KB Output is correct
30 Correct 2681 ms 323972 KB Output is correct
31 Correct 2670 ms 324520 KB Output is correct
32 Correct 1269 ms 112472 KB Output is correct
33 Correct 987 ms 115224 KB Output is correct
34 Correct 1436 ms 107680 KB Output is correct
35 Correct 1359 ms 107344 KB Output is correct
36 Correct 1422 ms 107568 KB Output is correct
37 Correct 1362 ms 107544 KB Output is correct