oj.uz

Submission #85339

# Submission time Handle Problem Language Result Execution time Memory
85339 2018-11-19T11:29:34 Z mra2322001 Evacuation plan (IZhO18_plan) C++14
41 / 100
 1717 ms 47676 KB 
#include <bits/stdc++.h>
#define f0(i, n) for(int i(0); i < (n); i++)
#define f1(i, n) for(int i(1); i <= n; i++)

using namespace std;
typedef long long ll;
const int N = 100002;

int n, m, dist[N], parent[N];
pair <int, pair <int, int> > ed[N*5];
vector <vector <int> > v;
vector <vector <pair <int, int> > > a;

struct data{
    int u, v, l, r, ans;
} Q[N];

void dijkstra(){
    priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > q;
    f1(i, n) if(dist[i]==0) q.push({0, i});
    while(q.size()){
        int u = q.top().second, du = q.top().first;
        q.pop();
        if(du != dist[u]) continue;
        for(auto x:a[u]){
            if(dist[x.first] > du + x.second){
                dist[x.first] = du + x.second;
                q.push({dist[x.first], x.first});
            }
        }
    }
}

bool cmp(pair <int, pair <int, int> > a1, pair <int, pair <int, int> > a2){
    int x1 = min(dist[a1.second.first], dist[a1.second.second]);
    int x2 = min(dist[a2.second.first], dist[a2.second.second]);
    return x1 > x2;
}

int getroot(int u){
    if(parent[u]==u) return u;
    if(parent[u]==0) return u;
    parent[u] = getroot(parent[u]);
    return parent[u];
}

int Merge(int u, int v){
    parent[getroot(v)] = getroot(u);
}

int main(){
    ios_base::sync_with_stdio(0);

    cin >> n >> m;
    a.resize(n + 1);
    f1(i, m){
        int u, v, w; cin >> u >> v >> w;
        a[u].emplace_back(v, w);
        a[v].emplace_back(u, w);
        ed[i] = {w, {u, v}};
    }
    int len; cin >> len;
    memset(dist, 0x3f3f3f, sizeof(dist));
    while(len--){
        int x; cin >> x;
        dist[x] = 0;
    }
    dijkstra();
    sort(ed + 1, ed + m + 1, cmp);
    int q; cin >> q;
    f1(i, q){
        int u, v; cin >> u >> v;
        Q[i] = {u, v, 1, m, 0};
    }
    bool ok = 1;
    int g = 18;
    v.resize(m + 1);
    while(g--){
        f1(i, m) v[i].clear();
        ok = 0;
        f1(i, q){
            if(Q[i].l <= Q[i].r){
                int mid = (Q[i].l + Q[i].r)/2;
                v[mid].emplace_back(i);
                ok = 1;
            }
        }
        f1(i, n) parent[i] = 0;
        f1(i, m){
            Merge(ed[i].second.first, ed[i].second.second);
            for(auto x:v[i]){
                if(getroot(Q[x].u)==getroot(Q[x].v)){
                    Q[x].ans = i;
                    Q[x].r = i - 1;
                }
                else{
                    Q[x].l = i + 1;
                }
            }
        }
    }
    f1(i, q) cout << min(dist[ed[Q[i].ans].second.first], dist[ed[Q[i].ans].second.second]) << endl;
}

Compilation message

plan.cpp: In function 'int Merge(int, int)':
plan.cpp:49:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
plan.cpp: In function 'int main()':
plan.cpp:75:10: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
     bool ok = 1;
          ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 6 ms 888 KB Output is correct
3 Correct 6 ms 1016 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 6 ms 888 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 6 ms 888 KB Output is correct
10 Correct 7 ms 888 KB Output is correct
11 Correct 6 ms 888 KB Output is correct
12 Correct 6 ms 888 KB Output is correct
13 Correct 6 ms 888 KB Output is correct
14 Correct 6 ms 980 KB Output is correct
15 Correct 6 ms 932 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 6 ms 888 KB Output is correct
3 Correct 6 ms 1016 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 6 ms 888 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 6 ms 888 KB Output is correct
10 Correct 7 ms 888 KB Output is correct
11 Correct 6 ms 888 KB Output is correct
12 Correct 6 ms 888 KB Output is correct
13 Correct 6 ms 888 KB Output is correct
14 Correct 6 ms 980 KB Output is correct
15 Correct 6 ms 932 KB Output is correct
16 Correct 663 ms 22492 KB Output is correct
17 Incorrect 1717 ms 47676 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 760 KB Output is correct
6 Correct 3 ms 764 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 3 ms 816 KB Output is correct
10 Correct 3 ms 760 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 17472 KB Output is correct
2 Correct 1117 ms 35768 KB Output is correct
3 Correct 1152 ms 35940 KB Output is correct
4 Correct 138 ms 11308 KB Output is correct
5 Correct 1174 ms 36080 KB Output is correct
6 Correct 1113 ms 35748 KB Output is correct
7 Correct 1121 ms 35780 KB Output is correct
8 Correct 1134 ms 36028 KB Output is correct
9 Correct 1140 ms 35660 KB Output is correct
10 Correct 1134 ms 35888 KB Output is correct
11 Correct 1137 ms 35816 KB Output is correct
12 Correct 1100 ms 35856 KB Output is correct
13 Correct 1139 ms 35992 KB Output is correct
14 Correct 1129 ms 35892 KB Output is correct
15 Correct 1161 ms 35824 KB Output is correct
16 Correct 1150 ms 35740 KB Output is correct
17 Correct 1149 ms 35848 KB Output is correct
18 Correct 1155 ms 35836 KB Output is correct
19 Correct 106 ms 10460 KB Output is correct
20 Correct 1142 ms 35940 KB Output is correct
21 Correct 1020 ms 35892 KB Output is correct
22 Correct 109 ms 11356 KB Output is correct
23 Correct 113 ms 11000 KB Output is correct
24 Correct 117 ms 11360 KB Output is correct
25 Correct 115 ms 11508 KB Output is correct
26 Correct 124 ms 11188 KB Output is correct
27 Correct 143 ms 11264 KB Output is correct
28 Correct 117 ms 11488 KB Output is correct
29 Correct 144 ms 11256 KB Output is correct
30 Correct 115 ms 11408 KB Output is correct
31 Correct 141 ms 11256 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 6 ms 888 KB Output is correct
3 Correct 6 ms 1016 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 6 ms 888 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 6 ms 888 KB Output is correct
10 Correct 7 ms 888 KB Output is correct
11 Correct 6 ms 888 KB Output is correct
12 Correct 6 ms 888 KB Output is correct
13 Correct 6 ms 888 KB Output is correct
14 Correct 6 ms 980 KB Output is correct
15 Correct 6 ms 932 KB Output is correct
16 Correct 663 ms 22492 KB Output is correct
17 Incorrect 1717 ms 47676 KB Output isn't correct
18 Halted 0 ms 0 KB -