oj.uz

Submission #806774

# Submission time Handle Problem Language Result Execution time Memory
806774 2023-08-04T09:49:17 Z ashcomp LOSTIKS (INOI20_lostiks) C++14
23 / 100
 2000 ms 567788 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define all(x) x.begin() , x.end()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
#define wall cerr<<"------------------------"<<endl
 
typedef long long ll;

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
 
const ll INF = 1e9;
const ll maxn = 2e6 + 10;
const ll mod = 1e9 + 7;
 
int n , m , k , ST , EN;
int h[maxn] , p[maxn] , st[maxn] , en[maxn];
int a[maxn<<1] , rmq[maxn<<1][22] , ps_rmq[maxn<<1][22] , rrmq[maxn<<1][22] , ps_rrmq[maxn<<1][22] , len[maxn<<1];
vector<int> g[maxn] , LSA;
bool mrk[maxn];
void DFS(int v)
{
        mrk[v] = 1;
        LSA.push_back(v);
        st[v] = LSA.size()-1;
        for(auto u : g[v]){
 
                if(mrk[u]==1)continue;
                p[u] = v;
                h[u] = h[v]+1;
                DFS(u);
                LSA.push_back(v);
        }
        en[v] = LSA.size()-1;
        
}
inline void pre_LCA()
{
        LSA.push_back(0);
        p[ST] = -1;
        h[ST] = 1;
        DFS(ST);
        m = LSA.size()-1;
        //wall;
        for(int i=1; i<=m; i++){
                a[i] = h[LSA[i]];
        }
        for(int j=0; j<=21; j++){
                for(int i=1; i<=m; i++){
                        if(j==0){
                                rmq[i][j] = a[i];
                                rrmq[i][j] = a[i];
                                ps_rmq[i][j] = i;
                                ps_rrmq[i][j] = i;
                                continue;
                        }
                        if((i+(1<<j)-1)<=m){
                                rmq[i][j] = rmq[i][j-1];
                                ps_rmq[i][j] = ps_rmq[i][j-1];
                                if(rmq[i][j-1] > rmq[i+(1<<(j-1))][j-1]){
                                        rmq[i][j] = rmq[i+(1<<(j-1))][j-1];
                                        ps_rmq[i][j] = ps_rmq[i+(1<<(j-1))][j-1];
                                }
                        }
                        if((i-(1<<j)+1)>0){
                                rrmq[i][j] = rrmq[i][j-1];
                                ps_rrmq[i][j] = ps_rrmq[i][j-1];
                                if(rrmq[i][j-1] > rrmq[i-(1<<(j-1))][j-1]){
                                        rrmq[i][j] = rrmq[i-(1<<(j-1))][j-1];
                                        ps_rrmq[i][j] = ps_rrmq[i-(1<<(j-1))][j-1];
                                }
                        }
                }
        }
        int PS = 0;
        for(int i=1; i<=m; i++){
                if(((1<<PS)<<1)<=i){
                        PS++;
                }
                len[i] = PS;
        }
}//OK
inline int LCA(int v , int u)
{
        int l = min(st[v],st[u]) , r=max(st[v],st[u]);
        int ln = len[r-l+1];
        int x = rmq[l][ln] , y = rrmq[r][ln];
        if(x < y){
                int pos = ps_rmq[l][ln];
                return LSA[pos];
        }else{
                int pos = ps_rrmq[r][ln];
                return LSA[pos];
        }
}
inline int DIS(int v , int u)
{
        return (h[v]+h[u]-h[LCA(v,u)]-h[LCA(v,u)]);
}
 
vector<pii> eg[maxn];
bool mark[maxn];
int req[maxn];
map<int,int> MP[maxn]; 
void dfs(int v)
{
        mark[v] = 1;
        for(auto e : eg[v]){
                int u=e.F , w=e.S;
                if(mark[u]==1)continue;
                p[u] = v;
                req[u] = req[v];
                if(w!=0){
                        int x = MP[v][u];
                        req[u] |= (1<<x);
                }
                dfs(u);
        }
}
 
vector<pair<int,pii>> EG;
int dp[1<<22][22];
vector<int> ones[maxn];

int main()
{
        ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
        cin>>n>>ST>>EN;
        int ps = 0;
        for(int i=1; i<n; i++){
                int v,u,w; cin>>v>>u>>w;
                if(w!=0){
                        MP[v][u] = ps;
                        MP[u][v] = ps;
                        ps++;
                        EG.push_back({w,{v,u}});
                }
                eg[v].push_back({u,w});
                eg[u].push_back({v,w});
                g[v].push_back(u);
                g[u].push_back(v);
        }
        if((int)EG.size()>20){
                cout<<"COSNANAT";
                return 0;
        }
        /**/
        pre_LCA();
        for(int i=1; i<=n; i++){
                p[i] = -1;
        }
        dfs(ST);
        ps = EG.size() + 1;
        for(int i=1; i<(1<<ps); i++){
                for(int j=0; j<ps; j++){
                        if((1<<j)&i){
                                ones[i].push_back(j);
                        }
                }
        }

        for(int i=1; i<(1<<((int)EG.size()))+(1<<((int)EG.size())); i++){
                for(int j=0; j<((int)EG.size())+1; j++){
                        dp[i][j] = INF;
                }
        }
        for(int i=1; i<(1<<((int)EG.size())); i++){
                for(auto j : ones[i]){
                        int x = i^(1<<j);
                        int V=EG[j].S.F , U=EG[j].S.S , W=EG[j].F;
                        if(req[W]!=(req[W]&x))continue;
                        if(req[V]!=(req[V]&x) && req[U]!=(req[U]&x))continue;
                        if(x==0){
                                dp[i][j] = DIS(ST,W) + min(DIS(W,V),DIS(W,U));
                                continue;
                        }
                        for(auto f : ones[x]){
                                int v=EG[f].S.F , u=EG[f].S.S;
                                int D1=DIS(ST,v) , D2=DIS(ST,u);
                                if(D1>D2){
                                        swap(v,u);
                                }
                                dp[i][j] = min(dp[i][j] , dp[x][f]+DIS(v,W)+min(DIS(W,V),DIS(W,U)) );
                        }
                }
        }
        /***********************************/
        ps = ((int)EG.size());
        eg[EN].push_back({n+1,EN});
        eg[n+1].push_back({EN,EN});
        MP[EN][n+1] = ps;
        MP[EN][n+1] = ps;
        EG.push_back({EN,{EN,n+1}});
 
        for(int i=(1<<ps); i<(1<<(ps+1)); i++){
                int j = ps;
                int x = i^(1<<j);
                int V=EG[j].S.F , U=EG[j].S.S , W=EG[j].F;
                if(req[W]!=(req[W]&x))continue;
                if(req[V]!=(req[V]&x) && req[U]!=(req[U]&x))continue;
                if(x==0){
                        dp[i][j] = DIS(ST,W) + min(DIS(W,V),DIS(W,U));
                        continue;
                }
                for(auto f : ones[x]){
                        int v=EG[f].S.F , u=EG[f].S.S;
                        int D1=DIS(ST,v) , D2=DIS(ST,u);
                        if(D1>D2){
                                swap(v,u);
                        }
                        dp[i][j] = min(dp[i][j] , dp[x][f]+DIS(v,W)+min(DIS(W,V),DIS(W,U)) );
                }
        }
        int ans = INF;
        for(int i=(1<<ps); i<(1<<(ps+1)); i++){
                ans = min(ans , dp[i][ps]);
        }
        /*ll ans = INF;
        for(int i=1; i<(1<<((int)EG.size())); i++)
        {
                for(int j=0; j<((int)EG.size()); j++){
                        int V=EG[j].S.F , U=EG[j].S.S;
                        if(DIS(V,ST)>DIS(U,ST)){
                                swap(V,U);
                        }
                        if(req[EN]!=(req[EN]&i))continue;
                        ans = min(ans , (ll)dp[i][j] + DIS(V,EN));
                }
        }*/
        if(ans==INF){
                cout<<-1;
                return 0;
        }
        cout<<ans;
        return 0;
}
/*
3
1 3
1 2 3
1 3 2
*/
/*
10
1 10
1 2 0
2 3 0
3 4 0
4 5 2
2 6 4
2 7 0
7 8 5
8 9 6
9 10 0
ans = 19
*/
/**
4
1 4
1 2 0
1 3 2
3 4 1
ans = 4;
*/
/*
5
3 1
1 2 5
2 3 4
3 4 0
4 5 2
ans = 10;
*/

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 235160 KB Output is correct
2 Correct 101 ms 235224 KB Output is correct
3 Correct 234 ms 317252 KB Output is correct
4 Correct 226 ms 317348 KB Output is correct
5 Correct 230 ms 317412 KB Output is correct
6 Correct 232 ms 317320 KB Output is correct
7 Correct 232 ms 317448 KB Output is correct
8 Correct 229 ms 317500 KB Output is correct
9 Correct 228 ms 317824 KB Output is correct
10 Correct 256 ms 317492 KB Output is correct
11 Correct 238 ms 317452 KB Output is correct
12 Correct 230 ms 320032 KB Output is correct
13 Correct 220 ms 319296 KB Output is correct
14 Correct 222 ms 318696 KB Output is correct
15 Correct 223 ms 320272 KB Output is correct
16 Correct 222 ms 321344 KB Output is correct
17 Correct 244 ms 321504 KB Output is correct
18 Correct 227 ms 322204 KB Output is correct
19 Correct 227 ms 328696 KB Output is correct
20 Correct 239 ms 328412 KB Output is correct
21 Correct 249 ms 328048 KB Output is correct
22 Correct 101 ms 235320 KB Output is correct
23 Correct 105 ms 235440 KB Output is correct
24 Correct 104 ms 235380 KB Output is correct
25 Correct 101 ms 235480 KB Output is correct
26 Correct 99 ms 235448 KB Output is correct

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 235156 KB Output is correct
2 Correct 96 ms 235260 KB Output is correct
3 Correct 97 ms 235668 KB Output is correct
4 Correct 96 ms 235684 KB Output is correct
5 Correct 826 ms 405068 KB Output is correct
6 Correct 676 ms 405072 KB Output is correct
7 Correct 941 ms 404972 KB Output is correct
8 Correct 726 ms 405076 KB Output is correct
9 Correct 801 ms 405080 KB Output is correct
10 Correct 525 ms 405096 KB Output is correct
11 Correct 523 ms 405116 KB Output is correct
12 Correct 526 ms 405100 KB Output is correct
13 Correct 533 ms 405000 KB Output is correct
14 Correct 526 ms 405048 KB Output is correct
15 Correct 884 ms 405096 KB Output is correct
16 Correct 948 ms 405012 KB Output is correct
17 Correct 808 ms 405016 KB Output is correct
18 Correct 558 ms 405332 KB Output is correct
19 Correct 533 ms 405332 KB Output is correct
20 Correct 536 ms 405340 KB Output is correct
21 Correct 522 ms 405300 KB Output is correct
22 Correct 526 ms 405792 KB Output is correct
23 Correct 531 ms 405748 KB Output is correct
24 Correct 523 ms 405824 KB Output is correct
25 Execution timed out 2093 ms 567788 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 235160 KB Output is correct
2 Correct 101 ms 235224 KB Output is correct
3 Correct 234 ms 317252 KB Output is correct
4 Correct 226 ms 317348 KB Output is correct
5 Correct 230 ms 317412 KB Output is correct
6 Correct 232 ms 317320 KB Output is correct
7 Correct 232 ms 317448 KB Output is correct
8 Correct 229 ms 317500 KB Output is correct
9 Correct 228 ms 317824 KB Output is correct
10 Correct 256 ms 317492 KB Output is correct
11 Correct 238 ms 317452 KB Output is correct
12 Correct 230 ms 320032 KB Output is correct
13 Correct 220 ms 319296 KB Output is correct
14 Correct 222 ms 318696 KB Output is correct
15 Correct 223 ms 320272 KB Output is correct
16 Correct 222 ms 321344 KB Output is correct
17 Correct 244 ms 321504 KB Output is correct
18 Correct 227 ms 322204 KB Output is correct
19 Correct 227 ms 328696 KB Output is correct
20 Correct 239 ms 328412 KB Output is correct
21 Correct 249 ms 328048 KB Output is correct
22 Correct 101 ms 235320 KB Output is correct
23 Correct 105 ms 235440 KB Output is correct
24 Correct 104 ms 235380 KB Output is correct
25 Correct 101 ms 235480 KB Output is correct
26 Correct 99 ms 235448 KB Output is correct
27 Correct 105 ms 235156 KB Output is correct
28 Correct 96 ms 235260 KB Output is correct
29 Correct 97 ms 235668 KB Output is correct
30 Correct 96 ms 235684 KB Output is correct
31 Correct 826 ms 405068 KB Output is correct
32 Correct 676 ms 405072 KB Output is correct
33 Correct 941 ms 404972 KB Output is correct
34 Correct 726 ms 405076 KB Output is correct
35 Correct 801 ms 405080 KB Output is correct
36 Correct 525 ms 405096 KB Output is correct
37 Correct 523 ms 405116 KB Output is correct
38 Correct 526 ms 405100 KB Output is correct
39 Correct 533 ms 405000 KB Output is correct
40 Correct 526 ms 405048 KB Output is correct
41 Correct 884 ms 405096 KB Output is correct
42 Correct 948 ms 405012 KB Output is correct
43 Correct 808 ms 405016 KB Output is correct
44 Correct 558 ms 405332 KB Output is correct
45 Correct 533 ms 405332 KB Output is correct
46 Correct 536 ms 405340 KB Output is correct
47 Correct 522 ms 405300 KB Output is correct
48 Correct 526 ms 405792 KB Output is correct
49 Correct 531 ms 405748 KB Output is correct
50 Correct 523 ms 405824 KB Output is correct
51 Execution timed out 2093 ms 567788 KB Time limit exceeded
52 Halted 0 ms 0 KB -