oj.uz

Submission #635742

# Submission time Handle Problem Language Result Execution time Memory
635742 2022-08-26T18:13:07 Z MohammadAghil LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 117168 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize ("Ofast,unroll-loops")
#pragma GCC target ("avx2")
using namespace std;

typedef long long ll;
typedef pair<int, int> pp;

#define rep(i,l,r) for(int i = (l); i < (r); i++)
#define per(i,r,l) for(int i = (r); i >= (l); i--)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define pb push_back
#define ff first
#define ss second

void dbg(){
    cerr << endl;
}
template<typename Head, typename... Tail> void dbg(Head h, Tail... t){
    cerr << " " << h << ",";
    dbg(t...);
}
#define er(...) cerr << __LINE__ << " <" << #__VA_ARGS__ << ">:", dbg(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void IOS(){
    cin.tie(0) -> sync_with_stdio(0);
//    #ifndef ONLINE_JUDGE
//        freopen("inp.txt", "r", stdin);
//        freopen("out.txt", "w", stdout);
//    #endif
}

const ll mod = 1e9 + 7, maxn = 1e6 + 5, maxm = 20, inf = ll(1e9) + 5;

int val[maxn], ed[maxm], nxt[maxm], tmp, n;
vector<pp> adj[maxn];
bool vis[maxn];
int dist[maxm + 1][maxn], dq[maxn], st, en, tmp_vl[maxm][maxm];

void dfs(int r){


    dq[st = 0] = r, en = 1;
    vis[r] = true;
    while(st < en){
        int r = dq[st++];
        for(auto&[c, w]: adj[r]) if(!vis[c]){
            vis[c] =  true;
            val[c] = val[r];
            if(w + 1){
                ed[tmp] = r;
                nxt[tmp] = w;
                val[c] |= 1<<tmp;
                tmp++;
            }
            dq[en++] = c;
        }
    }


//    val[r] |= val[p];
//    for(auto&[c, w]: adj[r]) if(c - p){
//        if(w + 1){
//            ed[tmp] = r;
//            nxt[tmp] = w;
//            val[c] = 1<<tmp;
//            tmp++;
//            dfs(c, r);
//        } else{
//            dfs(c, r);
//        }
//    }
}


void dfs2(int r, int id){
//    vector<pp> stk;
//    for(auto&[c, w]: adj[r]) if(c - p){
//        dist[id][c] = dist[id][r] + 1;
//        dfs2(c, r);
//    }
    dq[st = 0]  = r, en = 1;
    fill(dist[id], dist[id] + n, -1);
    dist[id][r] = 0;
    while(st < en){
        int r = dq[st++];
        for(auto&[c, w]: adj[r]) if(dist[id][c] == -1){
            dist[id][c] = dist[id][r] + 1;
            dq[en++] = c;
        }
    }
}

int dp[maxm][1<<maxm];

int main(){ IOS();
    int s, t; cin >> n >> s >> t; s--, t--;
    int m = 0;
    rep(i,1,n){
        int u, v, w; cin >> u >> v >> w; u--, v--, w--;
        adj[u].pb({v, w});
        adj[v].pb({u, w});
        m += w != -1;
    }
    dfs(s);
    rep(i,0,m){
        dfs2(ed[i], i);
    }
    dfs2(s, m);

    rep(i,0,m){
        rep(j,0,m){
            tmp_vl[i][j] = dist[i][nxt[j]] + dist[j][nxt[j]];
        }
    }

    auto chk = [&](int msk, int r){
        return (val[r]&msk) == val[r];
    };
    vector<int> is(m), nis(m);
    int ptr_is = 0, ptr_nis = 0;
    per(i,(1<<m)-1,1){
        ptr_is = ptr_nis = 0;
        rep(e,0,m) {
            if(i>>e&1){
                if(chk(i, ed[e])) is[ptr_is++] = e;
            }else{
                if(chk(i, nxt[e]) && chk(i, ed[e])) nis[ptr_nis++] = e;
            }
        }
        rep(x,0,ptr_is){
            int e = is[x];
            dp[e][i] = inf;
            if(chk(i, t)){
                dp[e][i] = dist[e][t];
            }else{
                rep(j,0,ptr_nis){
                    dp[e][i] = min(dp[e][i], dp[nis[j]][i^(1<<nis[j])] + tmp_vl[e][nis[j]]);
                }
            }
        }
    }
    int ans = inf;
    rep(i,0,m){
        if(chk(0, nxt[i]) && chk(0, ed[i])) ans = min(ans, dp[i][1<<i] + dist[m][nxt[i]] + dist[i][nxt[i]]);
    }
    if(chk(0, t)){
        ans = dist[m][t];
    }
    cout << (ans == inf? -1: ans) << '\n';
    return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23876 KB Output is correct
3 Correct 77 ms 31684 KB Output is correct
4 Correct 86 ms 31552 KB Output is correct
5 Correct 88 ms 31652 KB Output is correct
6 Correct 77 ms 31568 KB Output is correct
7 Correct 76 ms 31556 KB Output is correct
8 Correct 83 ms 31560 KB Output is correct
9 Correct 79 ms 31588 KB Output is correct
10 Correct 78 ms 31672 KB Output is correct
11 Correct 93 ms 31680 KB Output is correct
12 Correct 86 ms 31052 KB Output is correct
13 Correct 77 ms 30952 KB Output is correct
14 Correct 73 ms 30984 KB Output is correct
15 Correct 73 ms 31052 KB Output is correct
16 Correct 73 ms 30972 KB Output is correct
17 Correct 74 ms 30980 KB Output is correct
18 Correct 81 ms 30964 KB Output is correct
19 Correct 70 ms 30992 KB Output is correct
20 Correct 64 ms 31064 KB Output is correct
21 Correct 65 ms 31072 KB Output is correct
22 Correct 12 ms 23788 KB Output is correct
23 Correct 13 ms 23924 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 12 ms 23892 KB Output is correct
26 Correct 12 ms 23892 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23792 KB Output is correct
2 Correct 12 ms 23884 KB Output is correct
3 Correct 14 ms 24056 KB Output is correct
4 Correct 13 ms 24020 KB Output is correct
5 Correct 105 ms 55240 KB Output is correct
6 Correct 82 ms 53676 KB Output is correct
7 Correct 100 ms 54984 KB Output is correct
8 Correct 103 ms 55112 KB Output is correct
9 Correct 114 ms 54380 KB Output is correct
10 Correct 65 ms 47632 KB Output is correct
11 Correct 64 ms 47528 KB Output is correct
12 Correct 65 ms 47416 KB Output is correct
13 Correct 62 ms 47440 KB Output is correct
14 Correct 64 ms 47416 KB Output is correct
15 Correct 93 ms 54396 KB Output is correct
16 Correct 109 ms 54772 KB Output is correct
17 Correct 102 ms 56216 KB Output is correct
18 Correct 66 ms 47468 KB Output is correct
19 Correct 62 ms 47456 KB Output is correct
20 Correct 64 ms 47516 KB Output is correct
21 Correct 62 ms 47440 KB Output is correct
22 Correct 63 ms 47432 KB Output is correct
23 Correct 67 ms 47444 KB Output is correct
24 Correct 63 ms 47436 KB Output is correct
25 Correct 263 ms 89580 KB Output is correct

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23876 KB Output is correct
3 Correct 77 ms 31684 KB Output is correct
4 Correct 86 ms 31552 KB Output is correct
5 Correct 88 ms 31652 KB Output is correct
6 Correct 77 ms 31568 KB Output is correct
7 Correct 76 ms 31556 KB Output is correct
8 Correct 83 ms 31560 KB Output is correct
9 Correct 79 ms 31588 KB Output is correct
10 Correct 78 ms 31672 KB Output is correct
11 Correct 93 ms 31680 KB Output is correct
12 Correct 86 ms 31052 KB Output is correct
13 Correct 77 ms 30952 KB Output is correct
14 Correct 73 ms 30984 KB Output is correct
15 Correct 73 ms 31052 KB Output is correct
16 Correct 73 ms 30972 KB Output is correct
17 Correct 74 ms 30980 KB Output is correct
18 Correct 81 ms 30964 KB Output is correct
19 Correct 70 ms 30992 KB Output is correct
20 Correct 64 ms 31064 KB Output is correct
21 Correct 65 ms 31072 KB Output is correct
22 Correct 12 ms 23788 KB Output is correct
23 Correct 13 ms 23924 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 12 ms 23892 KB Output is correct
26 Correct 12 ms 23892 KB Output is correct
27 Correct 15 ms 23792 KB Output is correct
28 Correct 12 ms 23884 KB Output is correct
29 Correct 14 ms 24056 KB Output is correct
30 Correct 13 ms 24020 KB Output is correct
31 Correct 105 ms 55240 KB Output is correct
32 Correct 82 ms 53676 KB Output is correct
33 Correct 100 ms 54984 KB Output is correct
34 Correct 103 ms 55112 KB Output is correct
35 Correct 114 ms 54380 KB Output is correct
36 Correct 65 ms 47632 KB Output is correct
37 Correct 64 ms 47528 KB Output is correct
38 Correct 65 ms 47416 KB Output is correct
39 Correct 62 ms 47440 KB Output is correct
40 Correct 64 ms 47416 KB Output is correct
41 Correct 93 ms 54396 KB Output is correct
42 Correct 109 ms 54772 KB Output is correct
43 Correct 102 ms 56216 KB Output is correct
44 Correct 66 ms 47468 KB Output is correct
45 Correct 62 ms 47456 KB Output is correct
46 Correct 64 ms 47516 KB Output is correct
47 Correct 62 ms 47440 KB Output is correct
48 Correct 63 ms 47432 KB Output is correct
49 Correct 67 ms 47444 KB Output is correct
50 Correct 63 ms 47436 KB Output is correct
51 Correct 263 ms 89580 KB Output is correct
52 Correct 1769 ms 105300 KB Output is correct
53 Execution timed out 2089 ms 117168 KB Time limit exceeded
54 Halted 0 ms 0 KB -