oj.uz

Submission #635369

# Submission time Handle Problem Language Result Execution time Memory
635369 2022-08-26T07:13:09 Z MohammadAghil LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 196352 KB 
#include <bits/stdc++.h>
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 = 21, inf = ll(1e18) + 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);
    }
}

ll 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);
    }
    assert(tmp == m && m < 21);
    dfs2(s, -1, m);
    auto chk = [&](int msk, int r){
        return (val[r]&msk) == val[r];
    };
    per(i,(1<<m)-1,1){
        rep(e,0,m){
            dp[i][e] = inf;
            int r = ed[e];
            if((i>>e&1) && chk(i, r)){
                if(chk(i, t)){
                    dp[i][e] = dist[e][t];
                }else{
                    rep(x,0,m) if(!(i>>x&1) && chk(i, nxt[x]) && chk(i, ed[x])){
                        dp[i][e] = min(dp[i][e], dp[i^(1<<x)][x] + dist[e][nxt[x]] + dist[x][nxt[x]]);
                    }
                }
            }
        }
    }
    ll 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 12 ms 23764 KB Output is correct
2 Correct 12 ms 23848 KB Output is correct
3 Correct 74 ms 31300 KB Output is correct
4 Correct 88 ms 31364 KB Output is correct
5 Correct 81 ms 31392 KB Output is correct
6 Correct 89 ms 31308 KB Output is correct
7 Correct 102 ms 31396 KB Output is correct
8 Correct 96 ms 31364 KB Output is correct
9 Correct 91 ms 31652 KB Output is correct
10 Correct 86 ms 31424 KB Output is correct
11 Correct 79 ms 31436 KB Output is correct
12 Correct 69 ms 32812 KB Output is correct
13 Correct 67 ms 33096 KB Output is correct
14 Correct 67 ms 32840 KB Output is correct
15 Correct 75 ms 32964 KB Output is correct
16 Correct 79 ms 34052 KB Output is correct
17 Correct 71 ms 34128 KB Output is correct
18 Correct 71 ms 34664 KB Output is correct
19 Correct 82 ms 38604 KB Output is correct
20 Correct 87 ms 38548 KB Output is correct
21 Correct 101 ms 38324 KB Output is correct
22 Correct 15 ms 23816 KB Output is correct
23 Correct 13 ms 23824 KB Output is correct
24 Correct 13 ms 23820 KB Output is correct
25 Correct 13 ms 23908 KB Output is correct
26 Correct 13 ms 23836 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 12 ms 23764 KB Output is correct
3 Correct 12 ms 24092 KB Output is correct
4 Correct 12 ms 24084 KB Output is correct
5 Correct 202 ms 110912 KB Output is correct
6 Correct 166 ms 110892 KB Output is correct
7 Correct 207 ms 110940 KB Output is correct
8 Correct 191 ms 110984 KB Output is correct
9 Correct 194 ms 110888 KB Output is correct
10 Correct 113 ms 110880 KB Output is correct
11 Correct 105 ms 110884 KB Output is correct
12 Correct 109 ms 110964 KB Output is correct
13 Correct 105 ms 111000 KB Output is correct
14 Correct 131 ms 110988 KB Output is correct
15 Correct 171 ms 111000 KB Output is correct
16 Correct 224 ms 111100 KB Output is correct
17 Correct 182 ms 110924 KB Output is correct
18 Correct 107 ms 111024 KB Output is correct
19 Correct 106 ms 111136 KB Output is correct
20 Correct 119 ms 111144 KB Output is correct
21 Correct 108 ms 111092 KB Output is correct
22 Correct 104 ms 111412 KB Output is correct
23 Correct 106 ms 111392 KB Output is correct
24 Correct 103 ms 111456 KB Output is correct
25 Correct 483 ms 196352 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 23848 KB Output is correct
3 Correct 74 ms 31300 KB Output is correct
4 Correct 88 ms 31364 KB Output is correct
5 Correct 81 ms 31392 KB Output is correct
6 Correct 89 ms 31308 KB Output is correct
7 Correct 102 ms 31396 KB Output is correct
8 Correct 96 ms 31364 KB Output is correct
9 Correct 91 ms 31652 KB Output is correct
10 Correct 86 ms 31424 KB Output is correct
11 Correct 79 ms 31436 KB Output is correct
12 Correct 69 ms 32812 KB Output is correct
13 Correct 67 ms 33096 KB Output is correct
14 Correct 67 ms 32840 KB Output is correct
15 Correct 75 ms 32964 KB Output is correct
16 Correct 79 ms 34052 KB Output is correct
17 Correct 71 ms 34128 KB Output is correct
18 Correct 71 ms 34664 KB Output is correct
19 Correct 82 ms 38604 KB Output is correct
20 Correct 87 ms 38548 KB Output is correct
21 Correct 101 ms 38324 KB Output is correct
22 Correct 15 ms 23816 KB Output is correct
23 Correct 13 ms 23824 KB Output is correct
24 Correct 13 ms 23820 KB Output is correct
25 Correct 13 ms 23908 KB Output is correct
26 Correct 13 ms 23836 KB Output is correct
27 Correct 12 ms 23764 KB Output is correct
28 Correct 12 ms 23764 KB Output is correct
29 Correct 12 ms 24092 KB Output is correct
30 Correct 12 ms 24084 KB Output is correct
31 Correct 202 ms 110912 KB Output is correct
32 Correct 166 ms 110892 KB Output is correct
33 Correct 207 ms 110940 KB Output is correct
34 Correct 191 ms 110984 KB Output is correct
35 Correct 194 ms 110888 KB Output is correct
36 Correct 113 ms 110880 KB Output is correct
37 Correct 105 ms 110884 KB Output is correct
38 Correct 109 ms 110964 KB Output is correct
39 Correct 105 ms 111000 KB Output is correct
40 Correct 131 ms 110988 KB Output is correct
41 Correct 171 ms 111000 KB Output is correct
42 Correct 224 ms 111100 KB Output is correct
43 Correct 182 ms 110924 KB Output is correct
44 Correct 107 ms 111024 KB Output is correct
45 Correct 106 ms 111136 KB Output is correct
46 Correct 119 ms 111144 KB Output is correct
47 Correct 108 ms 111092 KB Output is correct
48 Correct 104 ms 111412 KB Output is correct
49 Correct 106 ms 111392 KB Output is correct
50 Correct 103 ms 111456 KB Output is correct
51 Correct 483 ms 196352 KB Output is correct
52 Execution timed out 2066 ms 106736 KB Time limit exceeded
53 Halted 0 ms 0 KB -