oj.uz

Submission #635381

# Submission time Handle Problem Language Result Execution time Memory
635381 2022-08-26T07:31:01 Z MohammadAghil LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 106272 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;
vector<pp> adj[maxn];

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

int dist[maxm + 5][maxn];

void dfs2(int r, int p, int id){
    for(auto[c, w]: adj[r]) if(c - p){
        dist[id][c] = dist[id][r] + 1;
        dfs2(c, r, id);
    }
}

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

int main(){ IOS();
    int n, 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, 0);
    rep(i,0,m){
        dfs2(ed[i], -1, i);
    }
    dfs2(s, -1, m);
    auto chk = [&](int msk, int r){
        return (val[r]&msk) == val[r];
    };
    per(i,(1<<m)-1,1){
        vector<int> is, nis;
        is.reserve(m);
        nis.reserve(m);
        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 14 ms 23764 KB Output is correct
3 Correct 81 ms 31244 KB Output is correct
4 Correct 108 ms 31404 KB Output is correct
5 Correct 89 ms 31392 KB Output is correct
6 Correct 87 ms 31200 KB Output is correct
7 Correct 78 ms 31344 KB Output is correct
8 Correct 85 ms 31320 KB Output is correct
9 Correct 84 ms 31492 KB Output is correct
10 Correct 79 ms 31304 KB Output is correct
11 Correct 109 ms 31332 KB Output is correct
12 Correct 74 ms 32716 KB Output is correct
13 Correct 82 ms 33144 KB Output is correct
14 Correct 84 ms 32784 KB Output is correct
15 Correct 76 ms 32924 KB Output is correct
16 Correct 72 ms 33624 KB Output is correct
17 Correct 76 ms 33704 KB Output is correct
18 Correct 79 ms 34072 KB Output is correct
19 Correct 93 ms 38160 KB Output is correct
20 Correct 97 ms 38060 KB Output is correct
21 Correct 82 ms 37820 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Correct 13 ms 23836 KB Output is correct
24 Correct 15 ms 23828 KB Output is correct
25 Correct 15 ms 23872 KB Output is correct
26 Correct 13 ms 23888 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23892 KB Output is correct
4 Correct 13 ms 23956 KB Output is correct
5 Correct 134 ms 65828 KB Output is correct
6 Correct 118 ms 65796 KB Output is correct
7 Correct 156 ms 65836 KB Output is correct
8 Correct 128 ms 65740 KB Output is correct
9 Correct 127 ms 65816 KB Output is correct
10 Correct 101 ms 65812 KB Output is correct
11 Correct 103 ms 65800 KB Output is correct
12 Correct 105 ms 65856 KB Output is correct
13 Correct 104 ms 65780 KB Output is correct
14 Correct 99 ms 65756 KB Output is correct
15 Correct 121 ms 65772 KB Output is correct
16 Correct 136 ms 65792 KB Output is correct
17 Correct 127 ms 65940 KB Output is correct
18 Correct 102 ms 66096 KB Output is correct
19 Correct 101 ms 65876 KB Output is correct
20 Correct 102 ms 65892 KB Output is correct
21 Correct 99 ms 66028 KB Output is correct
22 Correct 113 ms 66300 KB Output is correct
23 Correct 104 ms 66276 KB Output is correct
24 Correct 97 ms 66252 KB Output is correct
25 Correct 357 ms 106076 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 14 ms 23764 KB Output is correct
3 Correct 81 ms 31244 KB Output is correct
4 Correct 108 ms 31404 KB Output is correct
5 Correct 89 ms 31392 KB Output is correct
6 Correct 87 ms 31200 KB Output is correct
7 Correct 78 ms 31344 KB Output is correct
8 Correct 85 ms 31320 KB Output is correct
9 Correct 84 ms 31492 KB Output is correct
10 Correct 79 ms 31304 KB Output is correct
11 Correct 109 ms 31332 KB Output is correct
12 Correct 74 ms 32716 KB Output is correct
13 Correct 82 ms 33144 KB Output is correct
14 Correct 84 ms 32784 KB Output is correct
15 Correct 76 ms 32924 KB Output is correct
16 Correct 72 ms 33624 KB Output is correct
17 Correct 76 ms 33704 KB Output is correct
18 Correct 79 ms 34072 KB Output is correct
19 Correct 93 ms 38160 KB Output is correct
20 Correct 97 ms 38060 KB Output is correct
21 Correct 82 ms 37820 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Correct 13 ms 23836 KB Output is correct
24 Correct 15 ms 23828 KB Output is correct
25 Correct 15 ms 23872 KB Output is correct
26 Correct 13 ms 23888 KB Output is correct
27 Correct 12 ms 23764 KB Output is correct
28 Correct 13 ms 23764 KB Output is correct
29 Correct 12 ms 23892 KB Output is correct
30 Correct 13 ms 23956 KB Output is correct
31 Correct 134 ms 65828 KB Output is correct
32 Correct 118 ms 65796 KB Output is correct
33 Correct 156 ms 65836 KB Output is correct
34 Correct 128 ms 65740 KB Output is correct
35 Correct 127 ms 65816 KB Output is correct
36 Correct 101 ms 65812 KB Output is correct
37 Correct 103 ms 65800 KB Output is correct
38 Correct 105 ms 65856 KB Output is correct
39 Correct 104 ms 65780 KB Output is correct
40 Correct 99 ms 65756 KB Output is correct
41 Correct 121 ms 65772 KB Output is correct
42 Correct 136 ms 65792 KB Output is correct
43 Correct 127 ms 65940 KB Output is correct
44 Correct 102 ms 66096 KB Output is correct
45 Correct 101 ms 65876 KB Output is correct
46 Correct 102 ms 65892 KB Output is correct
47 Correct 99 ms 66028 KB Output is correct
48 Correct 113 ms 66300 KB Output is correct
49 Correct 104 ms 66276 KB Output is correct
50 Correct 97 ms 66252 KB Output is correct
51 Correct 357 ms 106076 KB Output is correct
52 Execution timed out 2076 ms 106272 KB Time limit exceeded
53 Halted 0 ms 0 KB -