oj.uz

답안 #635374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
635374 2022-08-26T07:16:18 Z MohammadAghil LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 106200 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 = 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 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 110 ms 31304 KB Output is correct
4 Correct 98 ms 31400 KB Output is correct
5 Correct 79 ms 31452 KB Output is correct
6 Correct 95 ms 31352 KB Output is correct
7 Correct 91 ms 31548 KB Output is correct
8 Correct 95 ms 31496 KB Output is correct
9 Correct 89 ms 31632 KB Output is correct
10 Correct 87 ms 31436 KB Output is correct
11 Correct 102 ms 31492 KB Output is correct
12 Correct 78 ms 32812 KB Output is correct
13 Correct 68 ms 33072 KB Output is correct
14 Correct 78 ms 32776 KB Output is correct
15 Correct 85 ms 33052 KB Output is correct
16 Correct 77 ms 33808 KB Output is correct
17 Correct 87 ms 33728 KB Output is correct
18 Correct 70 ms 34264 KB Output is correct
19 Correct 106 ms 38336 KB Output is correct
20 Correct 89 ms 38212 KB Output is correct
21 Correct 102 ms 37924 KB Output is correct
22 Correct 16 ms 23812 KB Output is correct
23 Correct 12 ms 23892 KB Output is correct
24 Correct 14 ms 23916 KB Output is correct
25 Correct 16 ms 23824 KB Output is correct
26 Correct 13 ms 23824 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23832 KB Output is correct
2 Correct 12 ms 23808 KB Output is correct
3 Correct 13 ms 24012 KB Output is correct
4 Correct 13 ms 23920 KB Output is correct
5 Correct 204 ms 65812 KB Output is correct
6 Correct 151 ms 65780 KB Output is correct
7 Correct 206 ms 65828 KB Output is correct
8 Correct 172 ms 65796 KB Output is correct
9 Correct 178 ms 65924 KB Output is correct
10 Correct 107 ms 65820 KB Output is correct
11 Correct 109 ms 65756 KB Output is correct
12 Correct 96 ms 65840 KB Output is correct
13 Correct 97 ms 65800 KB Output is correct
14 Correct 103 ms 65744 KB Output is correct
15 Correct 179 ms 65856 KB Output is correct
16 Correct 201 ms 65828 KB Output is correct
17 Correct 176 ms 65792 KB Output is correct
18 Correct 99 ms 65892 KB Output is correct
19 Correct 125 ms 65988 KB Output is correct
20 Correct 99 ms 66008 KB Output is correct
21 Correct 101 ms 65980 KB Output is correct
22 Correct 100 ms 66316 KB Output is correct
23 Correct 98 ms 66276 KB Output is correct
24 Correct 106 ms 66300 KB Output is correct
25 Correct 496 ms 105956 KB Output is correct

Subtask #3
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 110 ms 31304 KB Output is correct
4 Correct 98 ms 31400 KB Output is correct
5 Correct 79 ms 31452 KB Output is correct
6 Correct 95 ms 31352 KB Output is correct
7 Correct 91 ms 31548 KB Output is correct
8 Correct 95 ms 31496 KB Output is correct
9 Correct 89 ms 31632 KB Output is correct
10 Correct 87 ms 31436 KB Output is correct
11 Correct 102 ms 31492 KB Output is correct
12 Correct 78 ms 32812 KB Output is correct
13 Correct 68 ms 33072 KB Output is correct
14 Correct 78 ms 32776 KB Output is correct
15 Correct 85 ms 33052 KB Output is correct
16 Correct 77 ms 33808 KB Output is correct
17 Correct 87 ms 33728 KB Output is correct
18 Correct 70 ms 34264 KB Output is correct
19 Correct 106 ms 38336 KB Output is correct
20 Correct 89 ms 38212 KB Output is correct
21 Correct 102 ms 37924 KB Output is correct
22 Correct 16 ms 23812 KB Output is correct
23 Correct 12 ms 23892 KB Output is correct
24 Correct 14 ms 23916 KB Output is correct
25 Correct 16 ms 23824 KB Output is correct
26 Correct 13 ms 23824 KB Output is correct
27 Correct 14 ms 23832 KB Output is correct
28 Correct 12 ms 23808 KB Output is correct
29 Correct 13 ms 24012 KB Output is correct
30 Correct 13 ms 23920 KB Output is correct
31 Correct 204 ms 65812 KB Output is correct
32 Correct 151 ms 65780 KB Output is correct
33 Correct 206 ms 65828 KB Output is correct
34 Correct 172 ms 65796 KB Output is correct
35 Correct 178 ms 65924 KB Output is correct
36 Correct 107 ms 65820 KB Output is correct
37 Correct 109 ms 65756 KB Output is correct
38 Correct 96 ms 65840 KB Output is correct
39 Correct 97 ms 65800 KB Output is correct
40 Correct 103 ms 65744 KB Output is correct
41 Correct 179 ms 65856 KB Output is correct
42 Correct 201 ms 65828 KB Output is correct
43 Correct 176 ms 65792 KB Output is correct
44 Correct 99 ms 65892 KB Output is correct
45 Correct 125 ms 65988 KB Output is correct
46 Correct 99 ms 66008 KB Output is correct
47 Correct 101 ms 65980 KB Output is correct
48 Correct 100 ms 66316 KB Output is correct
49 Correct 98 ms 66276 KB Output is correct
50 Correct 106 ms 66300 KB Output is correct
51 Correct 496 ms 105956 KB Output is correct
52 Execution timed out 2081 ms 106200 KB Time limit exceeded
53 Halted 0 ms 0 KB -