oj.uz

답안 #952338

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952338 2024-03-23T14:43:48 Z vjudge306 Relay Marathon (NOI20_relaymarathon) C++17
17 / 100
 6000 ms 197468 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nn "\n"
#define x_x ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define intt int _; cin >> _; while (_--)
#define emp push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define ld long double
#define A first
#define B second
//#define int long long
typedef long long ll;
const ld eps = 1e-27;
// diff between decimals 0.000000001 mt19937 mt(time(nullptr));
struct ed {
int f; int t; ll w; ed(int f, int t, ll w): f(f), t(t), w(w){}
};
struct ss {
bool operator()(ed a, ed b) {
return a.w>b.w;
}
};
bool com(ed a, ed b)
{return a.w<b.w;}
int main() {

    x_x
    int n,k,m; cin>>n>>m>>k; vector<ed>adj[n+2];
    for (int i=0,a,b,c; i<m; i++)
    cin>>a>>b>>c, adj[a].emp({a,b,c}), adj[b].emp({b,a,c});

    int sp[n+2]={}; ll dis[n+2]; for (int i=0,x;i<k; i++) cin>>x, sp[x]=1;
    vector<ed>v;
    for (int z=1; z<=n; z++) {
        if (!sp[z]) continue;
       for (auto&i:dis)i=1e15;
    dis[z]=0; priority_queue<ed, vector<ed>, ss>pq; pq.push({z,z,0});
       while(!pq.empty()) {
        ed e=pq.top(); pq.pop();
        if (dis[e.t]<(e.w)) continue;

        for(auto i:adj[e.t]) {
            ed nw={e.t, i.t, e.w+i.w};
            if (dis[i.t]>nw.w) dis[i.t]=nw.w, pq.push(nw);
        }

       }
     for (int i=z+1; i<=n; i++)
     if (sp[i]&&dis[i]<1e15) v.emp({z,i,dis[i]});
    }
    ll ans=LLONG_MAX; sort(all(v), com);
    for (int i=0; i<v.size(); i++) {
        for (int j=i+1; j<v.size(); j++)
            if (v[i].f!=v[j].f&&v[i].t!=v[j].t&&v[i].f!=v[j].t&&v[i].t!=v[j].f)
            {ans=min(ans, v[i].w+v[j].w); break;}
    }
    cout<<ans;
  return 0;
}

Compilation message

RelayMarathon.cpp: In function 'int main()':
RelayMarathon.cpp:57:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<ed>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for (int i=0; i<v.size(); i++) {
      |                   ~^~~~~~~~~
RelayMarathon.cpp:58:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<ed>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int j=i+1; j<v.size(); j++)
      |                         ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 420 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 532 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 420 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 532 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 500 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 0 ms 600 KB Output is correct
36 Correct 32 ms 1712 KB Output is correct
37 Correct 65 ms 3136 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 29 ms 5968 KB Output is correct
40 Correct 52 ms 2720 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 68 ms 2736 KB Output is correct
43 Correct 26 ms 1728 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 176 ms 8164 KB Output is correct
47 Correct 48 ms 2348 KB Output is correct
48 Correct 40 ms 5928 KB Output is correct
49 Correct 110 ms 7060 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 17 ms 1484 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 26 ms 3412 KB Output is correct
54 Correct 36 ms 6068 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 97 ms 6656 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 21 ms 1664 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 7860 KB Output is correct
2 Correct 7 ms 4444 KB Output is correct
3 Execution timed out 6017 ms 197468 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 420 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 532 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 500 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 0 ms 600 KB Output is correct
36 Correct 32 ms 1712 KB Output is correct
37 Correct 65 ms 3136 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 29 ms 5968 KB Output is correct
40 Correct 52 ms 2720 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 68 ms 2736 KB Output is correct
43 Correct 26 ms 1728 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 176 ms 8164 KB Output is correct
47 Correct 48 ms 2348 KB Output is correct
48 Correct 40 ms 5928 KB Output is correct
49 Correct 110 ms 7060 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 17 ms 1484 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 26 ms 3412 KB Output is correct
54 Correct 36 ms 6068 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 97 ms 6656 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 21 ms 1664 KB Output is correct
61 Correct 162 ms 7860 KB Output is correct
62 Correct 7 ms 4444 KB Output is correct
63 Execution timed out 6017 ms 197468 KB Time limit exceeded
64 Halted 0 ms 0 KB -