oj.uz

답안 #1116791

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116791 2024-11-22T11:43:25 Z dead0ne 공장들 (JOI14_factories) C++17
0 / 100
 1466 ms 139360 KB 
#include <bits/stdc++.h>
#define pb push_back
#define spc << " " <<
//#define endl "\n"
#define all(x) x.begin(), x.end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define mid (l+r)/2
#define inf 1e15
#define MOD 998244353
#define MX 500005
using namespace std;

ll ans;
vii edges[MX], vt[MX];
int tin[MX], tout[MX], par[MX][20], dep[MX];
int tim=0;
ll dp1[MX], dp2[MX], has1[MX], has2[MX];
void dfs(int node, int pa){
    tin[node]=++tim;
    par[node][0]=pa;
    for(int i=1; i<20; i++) par[node][i] = par[par[node][i-1]][i-1];
    for(auto p:edges[node]){
        if(p.st==pa) continue;
        dep[p.st]=dep[node]+p.nd;
        dfs(p.st, node);
    }
    tout[node]=tim;
}
bool anc(int u, int v){
    return tin[u]<=tin[v] && tout[u]>=tout[v];
}
int lca(int u, int v){
    if(u==v) return u;
    if(dep[v]>dep[u]) swap(u,v);
    for(int i=19; i>=0; i--) if(!anc(par[u][i], v)) u = par[u][i];
    return par[u][0];
}

void dfs2(int node, int pa){
    dp1[node]=dp2[node]=inf;
    for(auto i:vt[node]){
        if(i.st==pa) continue;
        dfs2(i.st, node);
        dp1[node]=min(dp1[node], dp1[i.st]+i.nd);
        dp2[node]=min(dp2[node], dp2[i.st]+i.nd);
    }
    if(has1[node]) dp1[node]=0;
    else if(has2[node]) dp2[node]=0;
    ans=min(ans, dp1[node]+dp2[node]);
}

void Init(int N, int A[], int B[], int D[]){
    for(int i=0; i<N-1; i++){
        edges[A[i]].pb({B[i], D[i]});
        edges[B[i]].pb({A[i], D[i]});
    }
    dep[0]=0;
    dfs(0,0);
    for(int i=0; i<N; i++){
        has1[i]=has2[i]=0;
    }
}

ll Query(int S, int X[], int T, int Y[]){
    vi ver;
    for(int i=0; i<S; i++){
        has1[X[i]]=1;
        ver.pb(X[i]);
    }
    for(int i=0; i<T; i++){
        has2[Y[i]]=1;
        ver.pb(Y[i]);
    }
    sort(all(ver), [&](int a, int b){ return tin[a]<tin[b]; });
    for(int i=1; i<S+T; i++){
        ver.pb(lca(ver[i-1], ver[i]));
    }
    sort(all(ver), [&](int a, int b){ return tin[a]<tin[b]; });
    vi ver2 = {ver[0]};
    for(int i=1; i<ver.size(); i++) if(ver2.back()!=ver[i]) ver2.pb(ver[i]);
    swap(ver, ver2);
    stack<int> ss; ss.push(ver[0]);
    for(int i=1; i<ver.size(); i++){
        while(ss.size()>=2 && !anc(ss.top(), ver[i])){
            int f=ss.top(); ss.pop();
            vt[f].pb({ss.top(), dep[f]-dep[ss.top()]});
            vt[ss.top()].pb({f, dep[f]-dep[ss.top()]});
        }
        ss.push(ver[i]);
    }
    while(ss.size()>=2){
        int f=ss.top(); ss.pop();
        vt[f].pb({ss.top(), dep[f]-dep[ss.top()]});
        vt[ss.top()].pb({f, dep[f]-dep[ss.top()]});
    }

    ans=inf;
    dfs2(ver[0], ver[0]);
    for(auto i:ver){
        has1[i]=has2[i]=0;
        vt[i].clear();
    }
    return ans;
}

Compilation message

factories.cpp: In function 'long long int Query(int, int*, int, int*)':
factories.cpp:85:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for(int i=1; i<ver.size(); i++) if(ver2.back()!=ver[i]) ver2.pb(ver[i]);
      |                  ~^~~~~~~~~~~
factories.cpp:88:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for(int i=1; i<ver.size(); i++){
      |                  ~^~~~~~~~~~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 55888 KB Output is correct
2 Correct 758 ms 50248 KB Output is correct
3 Correct 764 ms 42492 KB Output is correct
4 Incorrect 721 ms 60416 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 55808 KB Output is correct
2 Correct 1154 ms 136992 KB Output is correct
3 Incorrect 1466 ms 139360 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 55888 KB Output is correct
2 Correct 758 ms 50248 KB Output is correct
3 Correct 764 ms 42492 KB Output is correct
4 Incorrect 721 ms 60416 KB Output isn't correct
5 Halted 0 ms 0 KB -