oj.uz

답안 #635376

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
635376 2022-08-26T07:20:54 Z MohammadAghil LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 121224 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){
        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]]);
                    }
                }
            }
        }
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23852 KB Output is correct
2 Correct 15 ms 23740 KB Output is correct
3 Correct 95 ms 31708 KB Output is correct
4 Correct 88 ms 31644 KB Output is correct
5 Correct 91 ms 31828 KB Output is correct
6 Correct 80 ms 31736 KB Output is correct
7 Correct 81 ms 32024 KB Output is correct
8 Correct 111 ms 32004 KB Output is correct
9 Correct 101 ms 32716 KB Output is correct
10 Correct 92 ms 31976 KB Output is correct
11 Correct 91 ms 32024 KB Output is correct
12 Correct 75 ms 38676 KB Output is correct
13 Correct 72 ms 37196 KB Output is correct
14 Correct 80 ms 35748 KB Output is correct
15 Correct 75 ms 39260 KB Output is correct
16 Correct 83 ms 41768 KB Output is correct
17 Correct 75 ms 41920 KB Output is correct
18 Correct 76 ms 43616 KB Output is correct
19 Correct 90 ms 58132 KB Output is correct
20 Correct 89 ms 57696 KB Output is correct
21 Correct 84 ms 56752 KB Output is correct
22 Correct 12 ms 23892 KB Output is correct
23 Correct 17 ms 23856 KB Output is correct
24 Correct 14 ms 23820 KB Output is correct
25 Correct 14 ms 23892 KB Output is correct
26 Correct 14 ms 23892 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23784 KB Output is correct
2 Correct 14 ms 23852 KB Output is correct
3 Correct 12 ms 24020 KB Output is correct
4 Correct 13 ms 24020 KB Output is correct
5 Correct 184 ms 65772 KB Output is correct
6 Correct 161 ms 65832 KB Output is correct
7 Correct 224 ms 65832 KB Output is correct
8 Correct 163 ms 65804 KB Output is correct
9 Correct 202 ms 65900 KB Output is correct
10 Correct 103 ms 65848 KB Output is correct
11 Correct 112 ms 65928 KB Output is correct
12 Correct 103 ms 65848 KB Output is correct
13 Correct 108 ms 65928 KB Output is correct
14 Correct 108 ms 65872 KB Output is correct
15 Correct 158 ms 65892 KB Output is correct
16 Correct 202 ms 65932 KB Output is correct
17 Correct 179 ms 65960 KB Output is correct
18 Correct 105 ms 66516 KB Output is correct
19 Correct 99 ms 66400 KB Output is correct
20 Correct 99 ms 66444 KB Output is correct
21 Correct 114 ms 66692 KB Output is correct
22 Correct 106 ms 67736 KB Output is correct
23 Correct 106 ms 67704 KB Output is correct
24 Correct 99 ms 67656 KB Output is correct
25 Correct 432 ms 106068 KB Output is correct

Subtask #3
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23852 KB Output is correct
2 Correct 15 ms 23740 KB Output is correct
3 Correct 95 ms 31708 KB Output is correct
4 Correct 88 ms 31644 KB Output is correct
5 Correct 91 ms 31828 KB Output is correct
6 Correct 80 ms 31736 KB Output is correct
7 Correct 81 ms 32024 KB Output is correct
8 Correct 111 ms 32004 KB Output is correct
9 Correct 101 ms 32716 KB Output is correct
10 Correct 92 ms 31976 KB Output is correct
11 Correct 91 ms 32024 KB Output is correct
12 Correct 75 ms 38676 KB Output is correct
13 Correct 72 ms 37196 KB Output is correct
14 Correct 80 ms 35748 KB Output is correct
15 Correct 75 ms 39260 KB Output is correct
16 Correct 83 ms 41768 KB Output is correct
17 Correct 75 ms 41920 KB Output is correct
18 Correct 76 ms 43616 KB Output is correct
19 Correct 90 ms 58132 KB Output is correct
20 Correct 89 ms 57696 KB Output is correct
21 Correct 84 ms 56752 KB Output is correct
22 Correct 12 ms 23892 KB Output is correct
23 Correct 17 ms 23856 KB Output is correct
24 Correct 14 ms 23820 KB Output is correct
25 Correct 14 ms 23892 KB Output is correct
26 Correct 14 ms 23892 KB Output is correct
27 Correct 12 ms 23784 KB Output is correct
28 Correct 14 ms 23852 KB Output is correct
29 Correct 12 ms 24020 KB Output is correct
30 Correct 13 ms 24020 KB Output is correct
31 Correct 184 ms 65772 KB Output is correct
32 Correct 161 ms 65832 KB Output is correct
33 Correct 224 ms 65832 KB Output is correct
34 Correct 163 ms 65804 KB Output is correct
35 Correct 202 ms 65900 KB Output is correct
36 Correct 103 ms 65848 KB Output is correct
37 Correct 112 ms 65928 KB Output is correct
38 Correct 103 ms 65848 KB Output is correct
39 Correct 108 ms 65928 KB Output is correct
40 Correct 108 ms 65872 KB Output is correct
41 Correct 158 ms 65892 KB Output is correct
42 Correct 202 ms 65932 KB Output is correct
43 Correct 179 ms 65960 KB Output is correct
44 Correct 105 ms 66516 KB Output is correct
45 Correct 99 ms 66400 KB Output is correct
46 Correct 99 ms 66444 KB Output is correct
47 Correct 114 ms 66692 KB Output is correct
48 Correct 106 ms 67736 KB Output is correct
49 Correct 106 ms 67704 KB Output is correct
50 Correct 99 ms 67656 KB Output is correct
51 Correct 432 ms 106068 KB Output is correct
52 Execution timed out 2074 ms 121224 KB Time limit exceeded
53 Halted 0 ms 0 KB -