oj.uz

답안 #737551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
737551 2023-05-07T10:43:42 Z Ronin13 Relay Marathon (NOI20_relaymarathon) C++14
5 / 100
 6000 ms 362804 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 < 50; 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() > 50)
        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 < 50; 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 < 50; 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() > 1000) break;
        if(cnt[to.s.f] < 50 && cnt[to.s.s] < 50){
            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 12 ms 16852 KB Output is correct
2 Correct 51 ms 16976 KB Output is correct
3 Correct 10 ms 16748 KB Output is correct
4 Correct 8 ms 16724 KB Output is correct
5 Correct 9 ms 16724 KB Output is correct
6 Correct 12 ms 16736 KB Output is correct
7 Correct 70 ms 16988 KB Output is correct
8 Correct 18 ms 16852 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 9 ms 16724 KB Output is correct
11 Correct 135 ms 16992 KB Output is correct
12 Correct 97 ms 16956 KB Output is correct
13 Correct 162 ms 17100 KB Output is correct
14 Correct 15 ms 16852 KB Output is correct
15 Correct 195 ms 17184 KB Output is correct
16 Correct 10 ms 16724 KB Output is correct
17 Correct 176 ms 17164 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 169 ms 17076 KB Output is correct
20 Correct 69 ms 16960 KB Output is correct
21 Correct 133 ms 17088 KB Output is correct
22 Correct 8 ms 16724 KB Output is correct
23 Correct 149 ms 17064 KB Output is correct
24 Correct 25 ms 16852 KB Output is correct
25 Correct 12 ms 16768 KB Output is correct
26 Correct 8 ms 16724 KB Output is correct
27 Correct 8 ms 16784 KB Output is correct
28 Correct 172 ms 17048 KB Output is correct
29 Correct 79 ms 16980 KB Output is correct
30 Correct 98 ms 17044 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 16852 KB Output is correct
2 Correct 51 ms 16976 KB Output is correct
3 Correct 10 ms 16748 KB Output is correct
4 Correct 8 ms 16724 KB Output is correct
5 Correct 9 ms 16724 KB Output is correct
6 Correct 12 ms 16736 KB Output is correct
7 Correct 70 ms 16988 KB Output is correct
8 Correct 18 ms 16852 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 9 ms 16724 KB Output is correct
11 Correct 135 ms 16992 KB Output is correct
12 Correct 97 ms 16956 KB Output is correct
13 Correct 162 ms 17100 KB Output is correct
14 Correct 15 ms 16852 KB Output is correct
15 Correct 195 ms 17184 KB Output is correct
16 Correct 10 ms 16724 KB Output is correct
17 Correct 176 ms 17164 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 169 ms 17076 KB Output is correct
20 Correct 69 ms 16960 KB Output is correct
21 Correct 133 ms 17088 KB Output is correct
22 Correct 8 ms 16724 KB Output is correct
23 Correct 149 ms 17064 KB Output is correct
24 Correct 25 ms 16852 KB Output is correct
25 Correct 12 ms 16768 KB Output is correct
26 Correct 8 ms 16724 KB Output is correct
27 Correct 8 ms 16784 KB Output is correct
28 Correct 172 ms 17048 KB Output is correct
29 Correct 79 ms 16980 KB Output is correct
30 Correct 98 ms 17044 KB Output is correct
31 Correct 12 ms 17236 KB Output is correct
32 Correct 19 ms 17576 KB Output is correct
33 Correct 13 ms 17356 KB Output is correct
34 Correct 9 ms 17236 KB Output is correct
35 Correct 8 ms 17236 KB Output is correct
36 Correct 508 ms 21672 KB Output is correct
37 Correct 939 ms 23372 KB Output is correct
38 Correct 30 ms 17748 KB Output is correct
39 Correct 3783 ms 23956 KB Output is correct
40 Correct 2759 ms 24172 KB Output is correct
41 Correct 29 ms 17744 KB Output is correct
42 Correct 3168 ms 24844 KB Output is correct
43 Correct 384 ms 21096 KB Output is correct
44 Correct 20 ms 17488 KB Output is correct
45 Correct 10 ms 17236 KB Output is correct
46 Execution timed out 6033 ms 25036 KB Time limit exceeded
47 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4853 ms 211108 KB Output is correct
2 Correct 107 ms 119332 KB Output is correct
3 Execution timed out 6045 ms 362804 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 16852 KB Output is correct
2 Correct 51 ms 16976 KB Output is correct
3 Correct 10 ms 16748 KB Output is correct
4 Correct 8 ms 16724 KB Output is correct
5 Correct 9 ms 16724 KB Output is correct
6 Correct 12 ms 16736 KB Output is correct
7 Correct 70 ms 16988 KB Output is correct
8 Correct 18 ms 16852 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 9 ms 16724 KB Output is correct
11 Correct 135 ms 16992 KB Output is correct
12 Correct 97 ms 16956 KB Output is correct
13 Correct 162 ms 17100 KB Output is correct
14 Correct 15 ms 16852 KB Output is correct
15 Correct 195 ms 17184 KB Output is correct
16 Correct 10 ms 16724 KB Output is correct
17 Correct 176 ms 17164 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 169 ms 17076 KB Output is correct
20 Correct 69 ms 16960 KB Output is correct
21 Correct 133 ms 17088 KB Output is correct
22 Correct 8 ms 16724 KB Output is correct
23 Correct 149 ms 17064 KB Output is correct
24 Correct 25 ms 16852 KB Output is correct
25 Correct 12 ms 16768 KB Output is correct
26 Correct 8 ms 16724 KB Output is correct
27 Correct 8 ms 16784 KB Output is correct
28 Correct 172 ms 17048 KB Output is correct
29 Correct 79 ms 16980 KB Output is correct
30 Correct 98 ms 17044 KB Output is correct
31 Correct 12 ms 17236 KB Output is correct
32 Correct 19 ms 17576 KB Output is correct
33 Correct 13 ms 17356 KB Output is correct
34 Correct 9 ms 17236 KB Output is correct
35 Correct 8 ms 17236 KB Output is correct
36 Correct 508 ms 21672 KB Output is correct
37 Correct 939 ms 23372 KB Output is correct
38 Correct 30 ms 17748 KB Output is correct
39 Correct 3783 ms 23956 KB Output is correct
40 Correct 2759 ms 24172 KB Output is correct
41 Correct 29 ms 17744 KB Output is correct
42 Correct 3168 ms 24844 KB Output is correct
43 Correct 384 ms 21096 KB Output is correct
44 Correct 20 ms 17488 KB Output is correct
45 Correct 10 ms 17236 KB Output is correct
46 Execution timed out 6033 ms 25036 KB Time limit exceeded
47 Halted 0 ms 0 KB -