oj.uz

Submission #501182

# Submission time Handle Problem Language Result Execution time Memory
501182 2022-01-02T14:41:21 Z lukameladze Evacuation plan (IZhO18_plan) C++14
100 / 100
 1067 ms 67560 KB 
# include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pii pair <int, int>
using namespace std;
const int N = 5e5 + 5,M = 300005;
int n,m,a[N],b[N],dist[M],p[M],c[N],x,y,ans[M],vert;
int fr[M],to[M],qq,l[M],sz[M],r[M];
vector <int> v1[N];
vector <pii> vv;
priority_queue < pii > q;
vector <pii> v[M];
void init() {
    for (int i = 1; i <= n; i++) {
        dist[i] = 1e9;
    }
}
int get_col(int a) {
    if (a == p[a]) return a;
    else return p[a] = get_col(p[a]);
}
void col(int a, int b) {
    a = get_col(a);
    b = get_col(b);
    if (a == b) return ;
    if (sz[a] < sz[b]) swap(a,b);
    sz[a] += sz[b];
    sz[b] = 0;
    p[b] = a;
}
void binsearch() {
    for (int i = 0; i < m; i++) {
        v1[i].clear();
    }
    for (int i = 1; i <= n; i++) {
        p[i] = i;
        sz[i] = 1;
    }
    int q = qq;
    for (int i = 1; i <= q; i++) {
        v1[(l[i] + r[i])/2].pb(i);
    }
    for (int j = 0; j < m; j++) {
        col(a[vv[j].s],b[vv[j].s]);
        for (int j1 = 0; j1 < v1[j].size(); j1++) {
            int id = v1[j][j1];
            if (get_col(fr[id]) == get_col(to[id])) {
                ans[id] = vv[j].f;
                r[id] = j - 1;
            } else l[id] = j + 1;
        }
    }
}
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    init();
    for (int i = 1; i <= m; i++) {
        cin>>a[i]>>b[i]>>c[i];
        v[a[i]].pb({b[i],c[i]});
        v[b[i]].pb({a[i],c[i]});
    }
    cin>>x;
    for (int i = 1; i <= x; i++) {
        cin>>vert;
        q.push({0,vert});
        dist[vert] = 0;
    }
    while (!q.empty()) {
        x = -(q.top().f);
        y = q.top().s;
        q.pop();
        if (dist[y] < x) continue;
        for (int j = 0; j < v[y].size(); j++) {
            int to = v[y][j].f; int cost = v[y][j].s;
            if (dist[to] > x + cost) {
                dist[to] = x + cost;
                q.push({-dist[to],to});
            }
        }
    }
    for (int i = 1; i <= m; i++) {
        vv.pb({min(dist[a[i]],dist[b[i]]),i});
    }
    sort(vv.begin(),vv.end());
    reverse(vv.begin(),vv.end());
    cin>>qq;
    for (int i = 1; i <= qq; i++) {
        cin>>fr[i]>>to[i];
        l[i] = 0;
        r[i] = m - 1;
    }
    for (int i = 1; i <= 19; i++)
    binsearch();
    for (int i = 1; i <= qq; i++ ){
        cout<<ans[i]<<" ";
    }
}

Compilation message

plan.cpp: In function 'void binsearch()':
plan.cpp:46:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (int j1 = 0; j1 < v1[j].size(); j1++) {
      |                          ~~~^~~~~~~~~~~~~~
plan.cpp: At global scope:
plan.cpp:55:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main() {
      | ^~~~
plan.cpp: In function 'int main()':
plan.cpp:75:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |         for (int j = 0; j < v[y].size(); j++) {
      |                         ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19168 KB Output is correct
2 Correct 12 ms 19220 KB Output is correct
3 Correct 12 ms 19280 KB Output is correct
4 Correct 10 ms 19156 KB Output is correct
5 Correct 13 ms 19280 KB Output is correct
6 Correct 10 ms 19276 KB Output is correct
7 Correct 10 ms 19148 KB Output is correct
8 Correct 10 ms 19124 KB Output is correct
9 Correct 11 ms 19288 KB Output is correct
10 Correct 11 ms 19276 KB Output is correct
11 Correct 11 ms 19276 KB Output is correct
12 Correct 10 ms 19276 KB Output is correct
13 Correct 11 ms 19228 KB Output is correct
14 Correct 12 ms 19312 KB Output is correct
15 Correct 11 ms 19276 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19168 KB Output is correct
2 Correct 12 ms 19220 KB Output is correct
3 Correct 12 ms 19280 KB Output is correct
4 Correct 10 ms 19156 KB Output is correct
5 Correct 13 ms 19280 KB Output is correct
6 Correct 10 ms 19276 KB Output is correct
7 Correct 10 ms 19148 KB Output is correct
8 Correct 10 ms 19124 KB Output is correct
9 Correct 11 ms 19288 KB Output is correct
10 Correct 11 ms 19276 KB Output is correct
11 Correct 11 ms 19276 KB Output is correct
12 Correct 10 ms 19276 KB Output is correct
13 Correct 11 ms 19228 KB Output is correct
14 Correct 12 ms 19312 KB Output is correct
15 Correct 11 ms 19276 KB Output is correct
16 Correct 341 ms 37832 KB Output is correct
17 Correct 1010 ms 58436 KB Output is correct
18 Correct 63 ms 23464 KB Output is correct
19 Correct 232 ms 42252 KB Output is correct
20 Correct 999 ms 66604 KB Output is correct
21 Correct 422 ms 48756 KB Output is correct
22 Correct 240 ms 41300 KB Output is correct
23 Correct 1012 ms 66624 KB Output is correct
24 Correct 1002 ms 66536 KB Output is correct
25 Correct 896 ms 66420 KB Output is correct
26 Correct 246 ms 42048 KB Output is correct
27 Correct 228 ms 42252 KB Output is correct
28 Correct 242 ms 42152 KB Output is correct
29 Correct 226 ms 42252 KB Output is correct
30 Correct 233 ms 42376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19148 KB Output is correct
2 Correct 10 ms 19148 KB Output is correct
3 Correct 10 ms 19172 KB Output is correct
4 Correct 13 ms 19148 KB Output is correct
5 Correct 10 ms 19132 KB Output is correct
6 Correct 9 ms 19148 KB Output is correct
7 Correct 10 ms 19184 KB Output is correct
8 Correct 9 ms 19168 KB Output is correct
9 Correct 9 ms 19168 KB Output is correct
10 Correct 10 ms 19148 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 31216 KB Output is correct
2 Correct 664 ms 45196 KB Output is correct
3 Correct 686 ms 45232 KB Output is correct
4 Correct 100 ms 25460 KB Output is correct
5 Correct 721 ms 45284 KB Output is correct
6 Correct 673 ms 45248 KB Output is correct
7 Correct 693 ms 45220 KB Output is correct
8 Correct 687 ms 45140 KB Output is correct
9 Correct 683 ms 45184 KB Output is correct
10 Correct 700 ms 45200 KB Output is correct
11 Correct 686 ms 45244 KB Output is correct
12 Correct 719 ms 45212 KB Output is correct
13 Correct 673 ms 45180 KB Output is correct
14 Correct 679 ms 45228 KB Output is correct
15 Correct 655 ms 45248 KB Output is correct
16 Correct 694 ms 45132 KB Output is correct
17 Correct 765 ms 45228 KB Output is correct
18 Correct 665 ms 45240 KB Output is correct
19 Correct 96 ms 25536 KB Output is correct
20 Correct 698 ms 45240 KB Output is correct
21 Correct 504 ms 44908 KB Output is correct
22 Correct 113 ms 27072 KB Output is correct
23 Correct 124 ms 25932 KB Output is correct
24 Correct 111 ms 27116 KB Output is correct
25 Correct 111 ms 27112 KB Output is correct
26 Correct 138 ms 26032 KB Output is correct
27 Correct 101 ms 25496 KB Output is correct
28 Correct 117 ms 27072 KB Output is correct
29 Correct 110 ms 25460 KB Output is correct
30 Correct 108 ms 27064 KB Output is correct
31 Correct 104 ms 25528 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19168 KB Output is correct
2 Correct 12 ms 19220 KB Output is correct
3 Correct 12 ms 19280 KB Output is correct
4 Correct 10 ms 19156 KB Output is correct
5 Correct 13 ms 19280 KB Output is correct
6 Correct 10 ms 19276 KB Output is correct
7 Correct 10 ms 19148 KB Output is correct
8 Correct 10 ms 19124 KB Output is correct
9 Correct 11 ms 19288 KB Output is correct
10 Correct 11 ms 19276 KB Output is correct
11 Correct 11 ms 19276 KB Output is correct
12 Correct 10 ms 19276 KB Output is correct
13 Correct 11 ms 19228 KB Output is correct
14 Correct 12 ms 19312 KB Output is correct
15 Correct 11 ms 19276 KB Output is correct
16 Correct 341 ms 37832 KB Output is correct
17 Correct 1010 ms 58436 KB Output is correct
18 Correct 63 ms 23464 KB Output is correct
19 Correct 232 ms 42252 KB Output is correct
20 Correct 999 ms 66604 KB Output is correct
21 Correct 422 ms 48756 KB Output is correct
22 Correct 240 ms 41300 KB Output is correct
23 Correct 1012 ms 66624 KB Output is correct
24 Correct 1002 ms 66536 KB Output is correct
25 Correct 896 ms 66420 KB Output is correct
26 Correct 246 ms 42048 KB Output is correct
27 Correct 228 ms 42252 KB Output is correct
28 Correct 242 ms 42152 KB Output is correct
29 Correct 226 ms 42252 KB Output is correct
30 Correct 233 ms 42376 KB Output is correct
31 Correct 12 ms 19148 KB Output is correct
32 Correct 10 ms 19148 KB Output is correct
33 Correct 10 ms 19172 KB Output is correct
34 Correct 13 ms 19148 KB Output is correct
35 Correct 10 ms 19132 KB Output is correct
36 Correct 9 ms 19148 KB Output is correct
37 Correct 10 ms 19184 KB Output is correct
38 Correct 9 ms 19168 KB Output is correct
39 Correct 9 ms 19168 KB Output is correct
40 Correct 10 ms 19148 KB Output is correct
41 Correct 277 ms 31216 KB Output is correct
42 Correct 664 ms 45196 KB Output is correct
43 Correct 686 ms 45232 KB Output is correct
44 Correct 100 ms 25460 KB Output is correct
45 Correct 721 ms 45284 KB Output is correct
46 Correct 673 ms 45248 KB Output is correct
47 Correct 693 ms 45220 KB Output is correct
48 Correct 687 ms 45140 KB Output is correct
49 Correct 683 ms 45184 KB Output is correct
50 Correct 700 ms 45200 KB Output is correct
51 Correct 686 ms 45244 KB Output is correct
52 Correct 719 ms 45212 KB Output is correct
53 Correct 673 ms 45180 KB Output is correct
54 Correct 679 ms 45228 KB Output is correct
55 Correct 655 ms 45248 KB Output is correct
56 Correct 694 ms 45132 KB Output is correct
57 Correct 765 ms 45228 KB Output is correct
58 Correct 665 ms 45240 KB Output is correct
59 Correct 96 ms 25536 KB Output is correct
60 Correct 698 ms 45240 KB Output is correct
61 Correct 504 ms 44908 KB Output is correct
62 Correct 113 ms 27072 KB Output is correct
63 Correct 124 ms 25932 KB Output is correct
64 Correct 111 ms 27116 KB Output is correct
65 Correct 111 ms 27112 KB Output is correct
66 Correct 138 ms 26032 KB Output is correct
67 Correct 101 ms 25496 KB Output is correct
68 Correct 117 ms 27072 KB Output is correct
69 Correct 110 ms 25460 KB Output is correct
70 Correct 108 ms 27064 KB Output is correct
71 Correct 104 ms 25528 KB Output is correct
72 Correct 485 ms 48352 KB Output is correct
73 Correct 987 ms 67560 KB Output is correct
74 Correct 985 ms 67252 KB Output is correct
75 Correct 975 ms 67016 KB Output is correct
76 Correct 999 ms 67332 KB Output is correct
77 Correct 1043 ms 67280 KB Output is correct
78 Correct 1022 ms 67276 KB Output is correct
79 Correct 1067 ms 67232 KB Output is correct
80 Correct 1029 ms 67332 KB Output is correct
81 Correct 1012 ms 67252 KB Output is correct
82 Correct 1018 ms 67224 KB Output is correct
83 Correct 990 ms 67276 KB Output is correct
84 Correct 970 ms 67320 KB Output is correct
85 Correct 932 ms 67192 KB Output is correct
86 Correct 1012 ms 67428 KB Output is correct
87 Correct 1006 ms 67080 KB Output is correct
88 Correct 1022 ms 67072 KB Output is correct
89 Correct 232 ms 41388 KB Output is correct
90 Correct 1002 ms 67032 KB Output is correct
91 Correct 673 ms 65864 KB Output is correct
92 Correct 247 ms 42284 KB Output is correct
93 Correct 289 ms 39932 KB Output is correct
94 Correct 245 ms 42164 KB Output is correct
95 Correct 256 ms 42428 KB Output is correct
96 Correct 243 ms 38428 KB Output is correct
97 Correct 225 ms 40028 KB Output is correct
98 Correct 260 ms 42148 KB Output is correct
99 Correct 215 ms 39968 KB Output is correct
100 Correct 253 ms 42440 KB Output is correct