oj.uz

답안 #737552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
737552 2023-05-07T10:44:55 Z Ronin13 Relay Marathon (NOI20_relaymarathon) C++14
17 / 100
 6000 ms 310620 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
const int nmax = 300001;
vector <ll> bit(nmax);

vector <vector <pll> > dp(nmax);
map <pii, bool> used;
vector <vector <pll> > g(nmax);
priority_queue <pair<ll, pii> > q;
void upd(int u, int x, ll len){
    bool tt;
    tt = false;
    for(int j = 0; j < 25; j++){
        if(dp[u][j].s == x){
            tt = true;
            if(len > dp[u][j].f) continue;
            dp[u][j].f = len;
            q.push({-dp[u][j].f, {u, dp[u][j].s}});
        }
    }
    if(!tt){
        if(len < dp[u].back().f)
        dp[u].pb({len, x}), q.push({-len, {u, x}});
    }
    sort(dp[u].begin(), dp[u].end());
    if(dp[u].size() > 25)
        dp[u].pop_back();

}

int main(){
    int n, k, m; cin >> n >> m >> k;
    for(int i = 1; i <= m; i++){
        int u, v; cin >> u >> v;
        ll w; cin >> w;
        g[u].pb({v, w});
        g[v].pb({u, w});
    }

    vector <int> sources;
    for(int i = 1 ;i <= k; i++){
        int x; cin >> x;
        sources.pb(x);
    }
   // cout << 1;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < 25; j++)
        dp[i].pb({1e18, 0});
    }
   // cout << 1;
    for(int to : sources){
        dp[to][0] = {0, to};
        q.push({0, {to, to}});
    }
    //cout << 1;
    while(!q.empty()){
        int v = q.top().s.f, y = q.top().s.s;
        ll val = -q.top().f;
        q.pop();
        if(used[{v, y}]) continue;
        used[{v, y}] = true;
        for(auto ed : g[v]){
            int to = ed.f;
            ll len = ed.s + val;
            upd(to, y, len);
        }
    }
    vector <pair<ll, pii> > vec;
    for(int to : sources){
        for(int j = 0; j < 25; j++){
            if(dp[to][j].f != 1e18)
            vec.pb({dp[to][j].f, {to, dp[to][j].s}});
        }
    }
    sort(vec.begin(), vec.end());
    int cnt[n + 1];
    fill(cnt, cnt + n + 1, 0);
    vector <pair<ll, pii> > cand;
    for(auto to : vec){
        if(cand.size() > 500) break;
        if(cnt[to.s.f] < 25 && cnt[to.s.s] < 25){
            cand.pb(to);
            cnt[to.s.f]++;
            cnt[to.s.s]++;
        }
    }
   // cout << 1;
    ll ans = 1e18;
    for(int i = 0; i < cand.size(); i++){
        for(int j =0; j < cand.size(); j++){
            set <int> st;
            st.insert(cand[i].s.f);
            st.insert(cand[i].s.s);
            st.insert(cand[j].s.f);
            st.insert(cand[j].s.s);
            if(st.size() == 4){
                ans = min(ans, cand[i].f + cand[j].f);
            }
        }
    }
    cout << ans;
    return 0;
}

Compilation message

RelayMarathon.cpp: In function 'int main()':
RelayMarathon.cpp:97:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, std::pair<int, int> >, std::allocator<std::pair<long long int, std::pair<int, int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     for(int i = 0; i < cand.size(); i++){
      |                    ~~^~~~~~~~~~~~~
RelayMarathon.cpp:98:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, std::pair<int, int> >, std::allocator<std::pair<long long int, std::pair<int, int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |         for(int j =0; j < cand.size(); j++){
      |                       ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16724 KB Output is correct
2 Correct 25 ms 16948 KB Output is correct
3 Correct 10 ms 16724 KB Output is correct
4 Correct 8 ms 16756 KB Output is correct
5 Correct 10 ms 16724 KB Output is correct
6 Correct 12 ms 16736 KB Output is correct
7 Correct 29 ms 16892 KB Output is correct
8 Correct 16 ms 16852 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 9 ms 16728 KB Output is correct
11 Correct 36 ms 16852 KB Output is correct
12 Correct 28 ms 16832 KB Output is correct
13 Correct 50 ms 16984 KB Output is correct
14 Correct 12 ms 16852 KB Output is correct
15 Correct 53 ms 17060 KB Output is correct
16 Correct 9 ms 16724 KB Output is correct
17 Correct 51 ms 16980 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 57 ms 17056 KB Output is correct
20 Correct 23 ms 16852 KB Output is correct
21 Correct 40 ms 16924 KB Output is correct
22 Correct 9 ms 16724 KB Output is correct
23 Correct 46 ms 16988 KB Output is correct
24 Correct 15 ms 16852 KB Output is correct
25 Correct 11 ms 16724 KB Output is correct
26 Correct 10 ms 16724 KB Output is correct
27 Correct 9 ms 16724 KB Output is correct
28 Correct 55 ms 16980 KB Output is correct
29 Correct 30 ms 16980 KB Output is correct
30 Correct 35 ms 16980 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16724 KB Output is correct
2 Correct 25 ms 16948 KB Output is correct
3 Correct 10 ms 16724 KB Output is correct
4 Correct 8 ms 16756 KB Output is correct
5 Correct 10 ms 16724 KB Output is correct
6 Correct 12 ms 16736 KB Output is correct
7 Correct 29 ms 16892 KB Output is correct
8 Correct 16 ms 16852 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 9 ms 16728 KB Output is correct
11 Correct 36 ms 16852 KB Output is correct
12 Correct 28 ms 16832 KB Output is correct
13 Correct 50 ms 16984 KB Output is correct
14 Correct 12 ms 16852 KB Output is correct
15 Correct 53 ms 17060 KB Output is correct
16 Correct 9 ms 16724 KB Output is correct
17 Correct 51 ms 16980 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 57 ms 17056 KB Output is correct
20 Correct 23 ms 16852 KB Output is correct
21 Correct 40 ms 16924 KB Output is correct
22 Correct 9 ms 16724 KB Output is correct
23 Correct 46 ms 16988 KB Output is correct
24 Correct 15 ms 16852 KB Output is correct
25 Correct 11 ms 16724 KB Output is correct
26 Correct 10 ms 16724 KB Output is correct
27 Correct 9 ms 16724 KB Output is correct
28 Correct 55 ms 16980 KB Output is correct
29 Correct 30 ms 16980 KB Output is correct
30 Correct 35 ms 16980 KB Output is correct
31 Correct 11 ms 16980 KB Output is correct
32 Correct 14 ms 17208 KB Output is correct
33 Correct 11 ms 17236 KB Output is correct
34 Correct 10 ms 16980 KB Output is correct
35 Correct 9 ms 16980 KB Output is correct
36 Correct 124 ms 19384 KB Output is correct
37 Correct 190 ms 20208 KB Output is correct
38 Correct 23 ms 17492 KB Output is correct
39 Correct 1709 ms 23128 KB Output is correct
40 Correct 694 ms 21304 KB Output is correct
41 Correct 23 ms 17492 KB Output is correct
42 Correct 710 ms 21728 KB Output is correct
43 Correct 99 ms 19140 KB Output is correct
44 Correct 15 ms 17236 KB Output is correct
45 Correct 9 ms 16980 KB Output is correct
46 Correct 5801 ms 26176 KB Output is correct
47 Correct 469 ms 20732 KB Output is correct
48 Correct 2316 ms 24096 KB Output is correct
49 Correct 4295 ms 25604 KB Output is correct
50 Correct 17 ms 17364 KB Output is correct
51 Correct 52 ms 18256 KB Output is correct
52 Correct 20 ms 17492 KB Output is correct
53 Correct 1212 ms 21676 KB Output is correct
54 Correct 2221 ms 23620 KB Output is correct
55 Correct 17 ms 17408 KB Output is correct
56 Correct 10 ms 16980 KB Output is correct
57 Correct 21 ms 17492 KB Output is correct
58 Correct 5356 ms 25508 KB Output is correct
59 Correct 8 ms 16952 KB Output is correct
60 Correct 57 ms 18680 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3567 ms 154720 KB Output is correct
2 Correct 65 ms 69168 KB Output is correct
3 Execution timed out 6062 ms 310620 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16724 KB Output is correct
2 Correct 25 ms 16948 KB Output is correct
3 Correct 10 ms 16724 KB Output is correct
4 Correct 8 ms 16756 KB Output is correct
5 Correct 10 ms 16724 KB Output is correct
6 Correct 12 ms 16736 KB Output is correct
7 Correct 29 ms 16892 KB Output is correct
8 Correct 16 ms 16852 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 9 ms 16728 KB Output is correct
11 Correct 36 ms 16852 KB Output is correct
12 Correct 28 ms 16832 KB Output is correct
13 Correct 50 ms 16984 KB Output is correct
14 Correct 12 ms 16852 KB Output is correct
15 Correct 53 ms 17060 KB Output is correct
16 Correct 9 ms 16724 KB Output is correct
17 Correct 51 ms 16980 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 57 ms 17056 KB Output is correct
20 Correct 23 ms 16852 KB Output is correct
21 Correct 40 ms 16924 KB Output is correct
22 Correct 9 ms 16724 KB Output is correct
23 Correct 46 ms 16988 KB Output is correct
24 Correct 15 ms 16852 KB Output is correct
25 Correct 11 ms 16724 KB Output is correct
26 Correct 10 ms 16724 KB Output is correct
27 Correct 9 ms 16724 KB Output is correct
28 Correct 55 ms 16980 KB Output is correct
29 Correct 30 ms 16980 KB Output is correct
30 Correct 35 ms 16980 KB Output is correct
31 Correct 11 ms 16980 KB Output is correct
32 Correct 14 ms 17208 KB Output is correct
33 Correct 11 ms 17236 KB Output is correct
34 Correct 10 ms 16980 KB Output is correct
35 Correct 9 ms 16980 KB Output is correct
36 Correct 124 ms 19384 KB Output is correct
37 Correct 190 ms 20208 KB Output is correct
38 Correct 23 ms 17492 KB Output is correct
39 Correct 1709 ms 23128 KB Output is correct
40 Correct 694 ms 21304 KB Output is correct
41 Correct 23 ms 17492 KB Output is correct
42 Correct 710 ms 21728 KB Output is correct
43 Correct 99 ms 19140 KB Output is correct
44 Correct 15 ms 17236 KB Output is correct
45 Correct 9 ms 16980 KB Output is correct
46 Correct 5801 ms 26176 KB Output is correct
47 Correct 469 ms 20732 KB Output is correct
48 Correct 2316 ms 24096 KB Output is correct
49 Correct 4295 ms 25604 KB Output is correct
50 Correct 17 ms 17364 KB Output is correct
51 Correct 52 ms 18256 KB Output is correct
52 Correct 20 ms 17492 KB Output is correct
53 Correct 1212 ms 21676 KB Output is correct
54 Correct 2221 ms 23620 KB Output is correct
55 Correct 17 ms 17408 KB Output is correct
56 Correct 10 ms 16980 KB Output is correct
57 Correct 21 ms 17492 KB Output is correct
58 Correct 5356 ms 25508 KB Output is correct
59 Correct 8 ms 16952 KB Output is correct
60 Correct 57 ms 18680 KB Output is correct
61 Correct 3567 ms 154720 KB Output is correct
62 Correct 65 ms 69168 KB Output is correct
63 Execution timed out 6062 ms 310620 KB Time limit exceeded
64 Halted 0 ms 0 KB -