oj.uz

답안 #635713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
635713 2022-08-26T17:37:42 Z MohammadAghil LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 107460 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){
    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 + 5][maxn], id;

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

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);
    rep(i,0,m){
        id = i;
        dfs2(ed[i], -1);
    }
    id = m;
    dfs2(s, -1);
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 123 ms 32576 KB Output is correct
4 Correct 96 ms 32560 KB Output is correct
5 Correct 80 ms 32672 KB Output is correct
6 Correct 82 ms 32504 KB Output is correct
7 Correct 92 ms 32652 KB Output is correct
8 Correct 107 ms 32720 KB Output is correct
9 Correct 93 ms 32772 KB Output is correct
10 Correct 98 ms 32700 KB Output is correct
11 Correct 109 ms 32692 KB Output is correct
12 Correct 84 ms 33628 KB Output is correct
13 Correct 89 ms 33880 KB Output is correct
14 Correct 73 ms 33616 KB Output is correct
15 Correct 79 ms 33716 KB Output is correct
16 Correct 81 ms 34280 KB Output is correct
17 Correct 72 ms 34308 KB Output is correct
18 Correct 73 ms 34752 KB Output is correct
19 Correct 83 ms 37964 KB Output is correct
20 Correct 103 ms 37816 KB Output is correct
21 Correct 97 ms 37716 KB Output is correct
22 Correct 13 ms 23816 KB Output is correct
23 Correct 13 ms 23892 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 15 ms 23828 KB Output is correct
26 Correct 13 ms 23828 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23740 KB Output is correct
2 Correct 13 ms 23824 KB Output is correct
3 Correct 16 ms 23960 KB Output is correct
4 Correct 13 ms 23892 KB Output is correct
5 Correct 202 ms 65852 KB Output is correct
6 Correct 145 ms 65928 KB Output is correct
7 Correct 213 ms 65916 KB Output is correct
8 Correct 161 ms 65848 KB Output is correct
9 Correct 226 ms 65900 KB Output is correct
10 Correct 98 ms 65868 KB Output is correct
11 Correct 95 ms 65896 KB Output is correct
12 Correct 98 ms 65888 KB Output is correct
13 Correct 107 ms 65816 KB Output is correct
14 Correct 104 ms 65888 KB Output is correct
15 Correct 157 ms 65860 KB Output is correct
16 Correct 210 ms 65908 KB Output is correct
17 Correct 185 ms 65868 KB Output is correct
18 Correct 96 ms 66132 KB Output is correct
19 Correct 92 ms 66000 KB Output is correct
20 Correct 105 ms 65996 KB Output is correct
21 Correct 114 ms 66008 KB Output is correct
22 Correct 93 ms 66296 KB Output is correct
23 Correct 98 ms 66388 KB Output is correct
24 Correct 104 ms 66296 KB Output is correct
25 Correct 596 ms 106172 KB Output is correct

Subtask #3
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 123 ms 32576 KB Output is correct
4 Correct 96 ms 32560 KB Output is correct
5 Correct 80 ms 32672 KB Output is correct
6 Correct 82 ms 32504 KB Output is correct
7 Correct 92 ms 32652 KB Output is correct
8 Correct 107 ms 32720 KB Output is correct
9 Correct 93 ms 32772 KB Output is correct
10 Correct 98 ms 32700 KB Output is correct
11 Correct 109 ms 32692 KB Output is correct
12 Correct 84 ms 33628 KB Output is correct
13 Correct 89 ms 33880 KB Output is correct
14 Correct 73 ms 33616 KB Output is correct
15 Correct 79 ms 33716 KB Output is correct
16 Correct 81 ms 34280 KB Output is correct
17 Correct 72 ms 34308 KB Output is correct
18 Correct 73 ms 34752 KB Output is correct
19 Correct 83 ms 37964 KB Output is correct
20 Correct 103 ms 37816 KB Output is correct
21 Correct 97 ms 37716 KB Output is correct
22 Correct 13 ms 23816 KB Output is correct
23 Correct 13 ms 23892 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 15 ms 23828 KB Output is correct
26 Correct 13 ms 23828 KB Output is correct
27 Correct 13 ms 23740 KB Output is correct
28 Correct 13 ms 23824 KB Output is correct
29 Correct 16 ms 23960 KB Output is correct
30 Correct 13 ms 23892 KB Output is correct
31 Correct 202 ms 65852 KB Output is correct
32 Correct 145 ms 65928 KB Output is correct
33 Correct 213 ms 65916 KB Output is correct
34 Correct 161 ms 65848 KB Output is correct
35 Correct 226 ms 65900 KB Output is correct
36 Correct 98 ms 65868 KB Output is correct
37 Correct 95 ms 65896 KB Output is correct
38 Correct 98 ms 65888 KB Output is correct
39 Correct 107 ms 65816 KB Output is correct
40 Correct 104 ms 65888 KB Output is correct
41 Correct 157 ms 65860 KB Output is correct
42 Correct 210 ms 65908 KB Output is correct
43 Correct 185 ms 65868 KB Output is correct
44 Correct 96 ms 66132 KB Output is correct
45 Correct 92 ms 66000 KB Output is correct
46 Correct 105 ms 65996 KB Output is correct
47 Correct 114 ms 66008 KB Output is correct
48 Correct 93 ms 66296 KB Output is correct
49 Correct 98 ms 66388 KB Output is correct
50 Correct 104 ms 66296 KB Output is correct
51 Correct 596 ms 106172 KB Output is correct
52 Execution timed out 2073 ms 107460 KB Time limit exceeded
53 Halted 0 ms 0 KB -