oj.uz

Submission #635720

# Submission time Handle Problem Language Result Execution time Memory
635720 2022-08-26T17:44:18 Z MohammadAghil LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 109412 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];

void dfs(int r, int p){
    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);
        }
    }
}

int dist[maxm + 1][maxn], dq[maxn], st, en;

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[1<<maxm][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, -1);
    rep(i,0,m){
        dfs2(ed[i], i);
    }
    dfs2(s, m);
    auto chk = [&](int msk, int r){
        return (val[r]&msk) == val[r];
    };
    per(i,(1<<m)-1,1){
        vector<int> is, nis;
        rep(e,0,m) {
            if(i>>e&1){
                if(chk(i, ed[e])) is.pb(e);
            }else{
                if(chk(i, nxt[e]) && chk(i, ed[e])) nis.pb(e);
            }
        }
        for(int e: is){
            dp[i][e] = inf;
            if(chk(i, t)){
                dp[i][e] = dist[e][t];
            }else{
                for(int x: nis){
                    dp[i][e] = min(dp[i][e], dp[i^(1<<x)][x] + dist[e][nxt[x]] + dist[x][nxt[x]]);
                }
            }

        }
    }
    int ans = inf;
    rep(i,0,m){
        if(chk(0, nxt[i]) && chk(0, ed[i])) ans = min(ans, dp[1<<i][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 13 ms 23764 KB Output is correct
2 Correct 13 ms 23796 KB Output is correct
3 Correct 78 ms 31684 KB Output is correct
4 Correct 78 ms 31716 KB Output is correct
5 Correct 85 ms 31808 KB Output is correct
6 Correct 88 ms 31736 KB Output is correct
7 Correct 87 ms 31760 KB Output is correct
8 Correct 84 ms 31816 KB Output is correct
9 Correct 81 ms 31936 KB Output is correct
10 Correct 77 ms 31776 KB Output is correct
11 Correct 80 ms 31816 KB Output is correct
12 Correct 74 ms 32776 KB Output is correct
13 Correct 81 ms 32488 KB Output is correct
14 Correct 76 ms 32200 KB Output is correct
15 Correct 88 ms 32964 KB Output is correct
16 Correct 76 ms 33484 KB Output is correct
17 Correct 77 ms 33564 KB Output is correct
18 Correct 72 ms 33872 KB Output is correct
19 Correct 70 ms 37196 KB Output is correct
20 Correct 69 ms 37068 KB Output is correct
21 Correct 70 ms 36804 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Correct 13 ms 23892 KB Output is correct
24 Correct 13 ms 23892 KB Output is correct
25 Correct 13 ms 23892 KB Output is correct
26 Correct 15 ms 23884 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 13 ms 23760 KB Output is correct
3 Correct 13 ms 23960 KB Output is correct
4 Correct 12 ms 24020 KB Output is correct
5 Correct 185 ms 65928 KB Output is correct
6 Correct 138 ms 65944 KB Output is correct
7 Correct 197 ms 65864 KB Output is correct
8 Correct 155 ms 65852 KB Output is correct
9 Correct 178 ms 65908 KB Output is correct
10 Correct 97 ms 65868 KB Output is correct
11 Correct 95 ms 65920 KB Output is correct
12 Correct 101 ms 65968 KB Output is correct
13 Correct 95 ms 65868 KB Output is correct
14 Correct 97 ms 65868 KB Output is correct
15 Correct 163 ms 65964 KB Output is correct
16 Correct 201 ms 66028 KB Output is correct
17 Correct 171 ms 65868 KB Output is correct
18 Correct 95 ms 66008 KB Output is correct
19 Correct 97 ms 66064 KB Output is correct
20 Correct 96 ms 66076 KB Output is correct
21 Correct 95 ms 66000 KB Output is correct
22 Correct 95 ms 66312 KB Output is correct
23 Correct 97 ms 66248 KB Output is correct
24 Correct 97 ms 66280 KB Output is correct
25 Correct 566 ms 106264 KB Output is correct

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23796 KB Output is correct
3 Correct 78 ms 31684 KB Output is correct
4 Correct 78 ms 31716 KB Output is correct
5 Correct 85 ms 31808 KB Output is correct
6 Correct 88 ms 31736 KB Output is correct
7 Correct 87 ms 31760 KB Output is correct
8 Correct 84 ms 31816 KB Output is correct
9 Correct 81 ms 31936 KB Output is correct
10 Correct 77 ms 31776 KB Output is correct
11 Correct 80 ms 31816 KB Output is correct
12 Correct 74 ms 32776 KB Output is correct
13 Correct 81 ms 32488 KB Output is correct
14 Correct 76 ms 32200 KB Output is correct
15 Correct 88 ms 32964 KB Output is correct
16 Correct 76 ms 33484 KB Output is correct
17 Correct 77 ms 33564 KB Output is correct
18 Correct 72 ms 33872 KB Output is correct
19 Correct 70 ms 37196 KB Output is correct
20 Correct 69 ms 37068 KB Output is correct
21 Correct 70 ms 36804 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Correct 13 ms 23892 KB Output is correct
24 Correct 13 ms 23892 KB Output is correct
25 Correct 13 ms 23892 KB Output is correct
26 Correct 15 ms 23884 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 13 ms 23760 KB Output is correct
29 Correct 13 ms 23960 KB Output is correct
30 Correct 12 ms 24020 KB Output is correct
31 Correct 185 ms 65928 KB Output is correct
32 Correct 138 ms 65944 KB Output is correct
33 Correct 197 ms 65864 KB Output is correct
34 Correct 155 ms 65852 KB Output is correct
35 Correct 178 ms 65908 KB Output is correct
36 Correct 97 ms 65868 KB Output is correct
37 Correct 95 ms 65920 KB Output is correct
38 Correct 101 ms 65968 KB Output is correct
39 Correct 95 ms 65868 KB Output is correct
40 Correct 97 ms 65868 KB Output is correct
41 Correct 163 ms 65964 KB Output is correct
42 Correct 201 ms 66028 KB Output is correct
43 Correct 171 ms 65868 KB Output is correct
44 Correct 95 ms 66008 KB Output is correct
45 Correct 97 ms 66064 KB Output is correct
46 Correct 96 ms 66076 KB Output is correct
47 Correct 95 ms 66000 KB Output is correct
48 Correct 95 ms 66312 KB Output is correct
49 Correct 97 ms 66248 KB Output is correct
50 Correct 97 ms 66280 KB Output is correct
51 Correct 566 ms 106264 KB Output is correct
52 Execution timed out 2025 ms 109412 KB Time limit exceeded
53 Halted 0 ms 0 KB -